java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:50:44,694 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:50:44,696 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:50:44,707 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:50:44,707 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:50:44,708 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:50:44,709 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:50:44,710 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:50:44,712 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:50:44,713 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:50:44,714 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:50:44,714 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:50:44,715 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:50:44,716 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:50:44,716 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:50:44,718 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:50:44,720 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:50:44,721 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:50:44,722 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:50:44,723 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:50:44,725 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:50:44,725 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:50:44,725 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:50:44,726 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:50:44,727 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:50:44,728 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:50:44,728 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:50:44,728 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:50:44,729 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:50:44,729 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:50:44,729 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:50:44,730 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 09:50:44,740 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:50:44,740 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:50:44,741 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:50:44,741 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:50:44,741 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:50:44,742 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:50:44,742 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:50:44,742 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:50:44,742 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:50:44,742 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:50:44,742 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:50:44,742 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:50:44,743 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:50:44,743 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:50:44,743 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:50:44,743 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:50:44,743 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:50:44,743 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:50:44,744 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:50:44,744 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:50:44,744 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:50:44,744 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:50:44,744 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 09:50:44,773 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:50:44,780 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:50:44,782 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:50:44,783 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:50:44,783 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:50:44,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:50:44,886 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:50:44,886 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:50:44,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:50:44,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:50:44,893 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:50:44,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:50:44" (1/1) ... [2018-02-02 09:50:44,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30a9c6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:44, skipping insertion in model container [2018-02-02 09:50:44,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:50:44" (1/1) ... [2018-02-02 09:50:44,909 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:50:44,936 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:50:45,025 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:50:45,042 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:50:45,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:45 WrapperNode [2018-02-02 09:50:45,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:50:45,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:50:45,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:50:45,051 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:50:45,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:45" (1/1) ... [2018-02-02 09:50:45,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:45" (1/1) ... [2018-02-02 09:50:45,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:45" (1/1) ... [2018-02-02 09:50:45,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:45" (1/1) ... [2018-02-02 09:50:45,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:45" (1/1) ... [2018-02-02 09:50:45,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:45" (1/1) ... [2018-02-02 09:50:45,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:45" (1/1) ... [2018-02-02 09:50:45,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:50:45,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:50:45,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:50:45,085 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:50:45,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:45" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:50:45,131 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:50:45,131 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:50:45,131 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-02-02 09:50:45,131 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-02-02 09:50:45,132 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrstr [2018-02-02 09:50:45,132 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:50:45,132 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:50:45,132 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:50:45,132 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:50:45,132 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:50:45,132 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:50:45,133 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:50:45,133 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-02-02 09:50:45,133 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-02-02 09:50:45,133 INFO L128 BoogieDeclarations]: Found specification of procedure cstrstr [2018-02-02 09:50:45,133 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:50:45,133 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:50:45,133 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:50:45,343 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:50:45,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:50:45 BoogieIcfgContainer [2018-02-02 09:50:45,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:50:45,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:50:45,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:50:45,347 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:50:45,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:50:44" (1/3) ... [2018-02-02 09:50:45,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f25d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:50:45, skipping insertion in model container [2018-02-02 09:50:45,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:45" (2/3) ... [2018-02-02 09:50:45,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f25d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:50:45, skipping insertion in model container [2018-02-02 09:50:45,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:50:45" (3/3) ... [2018-02-02 09:50:45,350 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:50:45,359 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:50:45,365 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-02-02 09:50:45,399 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:50:45,399 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:50:45,399 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 09:50:45,399 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 09:50:45,399 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:50:45,400 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:50:45,400 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:50:45,400 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:50:45,401 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:50:45,414 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-02-02 09:50:45,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 09:50:45,422 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:45,423 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:45,424 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:45,428 INFO L82 PathProgramCache]: Analyzing trace with hash -718609434, now seen corresponding path program 1 times [2018-02-02 09:50:45,477 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:45,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:45,612 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:45,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:50:45,613 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:45,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:45,613 INFO L182 omatonBuilderFactory]: Interpolants [96#(= 1 (select |#valid| main_~nondetString1~0.base)), 93#true, 94#false, 95#(= (select |#valid| |main_#t~malloc20.base|) 1)] [2018-02-02 09:50:45,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:45,614 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:50:45,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:50:45,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:50:45,680 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2018-02-02 09:50:45,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:45,797 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-02-02 09:50:45,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:50:45,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 09:50:45,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:45,804 INFO L225 Difference]: With dead ends: 89 [2018-02-02 09:50:45,805 INFO L226 Difference]: Without dead ends: 86 [2018-02-02 09:50:45,806 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-02 09:50:45,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-02 09:50:45,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-02-02 09:50:45,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-02 09:50:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-02-02 09:50:45,836 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 13 [2018-02-02 09:50:45,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:45,836 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-02-02 09:50:45,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:50:45,837 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-02-02 09:50:45,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 09:50:45,837 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:45,837 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:45,838 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:45,838 INFO L82 PathProgramCache]: Analyzing trace with hash -718609433, now seen corresponding path program 1 times [2018-02-02 09:50:45,839 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:45,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:45,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:45,937 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:45,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:50:45,937 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:45,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:45,937 INFO L182 omatonBuilderFactory]: Interpolants [274#true, 275#false, 276#(<= 1 main_~length1~0), 277#(and (= 0 |main_#t~malloc20.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc20.base|)) (<= 1 main_~length1~0) (= (select |#valid| |main_#t~malloc20.base|) 1)), 278#(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)), 279#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0))] [2018-02-02 09:50:45,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-02 09:50:45,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:50:45,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:50:45,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:50:45,945 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 6 states. [2018-02-02 09:50:46,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:46,046 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-02-02 09:50:46,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:50:46,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-02 09:50:46,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:46,048 INFO L225 Difference]: With dead ends: 85 [2018-02-02 09:50:46,048 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 09:50:46,049 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-02 09:50:46,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 09:50:46,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-02-02 09:50:46,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-02 09:50:46,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-02-02 09:50:46,055 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 13 [2018-02-02 09:50:46,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:46,055 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-02-02 09:50:46,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:50:46,056 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-02-02 09:50:46,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:50:46,056 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:46,056 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:46,056 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:46,057 INFO L82 PathProgramCache]: Analyzing trace with hash -802055959, now seen corresponding path program 1 times [2018-02-02 09:50:46,057 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:46,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:46,093 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:46,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:50:46,093 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:46,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:46,094 INFO L182 omatonBuilderFactory]: Interpolants [452#true, 453#false, 454#(= 1 (select |#valid| |main_#t~malloc21.base|)), 455#(= 1 (select |#valid| main_~nondetString2~0.base))] [2018-02-02 09:50:46,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:46,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:50:46,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:50:46,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:50:46,095 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 4 states. [2018-02-02 09:50:46,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:46,151 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-02-02 09:50:46,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:50:46,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 09:50:46,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:46,153 INFO L225 Difference]: With dead ends: 84 [2018-02-02 09:50:46,153 INFO L226 Difference]: Without dead ends: 84 [2018-02-02 09:50:46,153 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:50:46,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-02 09:50:46,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-02-02 09:50:46,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 09:50:46,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-02-02 09:50:46,159 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 14 [2018-02-02 09:50:46,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:46,159 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-02-02 09:50:46,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:50:46,159 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-02-02 09:50:46,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:50:46,160 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:46,160 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:46,160 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:46,160 INFO L82 PathProgramCache]: Analyzing trace with hash -802055958, now seen corresponding path program 1 times [2018-02-02 09:50:46,161 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:46,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:46,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:46,224 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:46,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:50:46,224 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:46,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:46,225 INFO L182 omatonBuilderFactory]: Interpolants [626#true, 627#false, 628#(<= 1 main_~length2~0), 629#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|)) (<= 1 main_~length2~0)), 630#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))] [2018-02-02 09:50:46,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:46,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:50:46,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:50:46,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:50:46,226 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 5 states. [2018-02-02 09:50:46,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:46,255 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-02-02 09:50:46,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:50:46,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 09:50:46,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:46,257 INFO L225 Difference]: With dead ends: 83 [2018-02-02 09:50:46,258 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 09:50:46,258 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:50:46,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 09:50:46,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-02 09:50:46,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 09:50:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-02-02 09:50:46,262 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 14 [2018-02-02 09:50:46,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:46,262 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-02-02 09:50:46,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:50:46,262 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-02-02 09:50:46,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 09:50:46,263 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:46,263 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:46,263 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:46,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880583, now seen corresponding path program 1 times [2018-02-02 09:50:46,264 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:46,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:46,311 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:46,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:50:46,311 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:46,312 INFO L182 omatonBuilderFactory]: Interpolants [800#false, 801#(= 1 (select |#valid| main_~nondetString2~0.base)), 802#(= 1 (select |#valid| |cstrstr_#in~find.base|)), 803#(= 1 (select |#valid| |cstrstr_#t~post11.base|)), 799#true] [2018-02-02 09:50:46,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:46,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:50:46,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:50:46,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:50:46,312 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 5 states. [2018-02-02 09:50:46,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:46,380 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-02-02 09:50:46,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:50:46,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 09:50:46,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:46,380 INFO L225 Difference]: With dead ends: 82 [2018-02-02 09:50:46,381 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 09:50:46,381 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:50:46,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 09:50:46,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-02 09:50:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 09:50:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-02-02 09:50:46,384 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 17 [2018-02-02 09:50:46,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:46,384 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-02-02 09:50:46,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:50:46,384 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-02-02 09:50:46,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 09:50:46,384 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:46,385 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:46,385 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:46,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880582, now seen corresponding path program 1 times [2018-02-02 09:50:46,385 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:46,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:46,456 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:46,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:50:46,456 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:46,456 INFO L182 omatonBuilderFactory]: Interpolants [976#(and (<= 1 (select |#length| |cstrstr_#in~find.base|)) (= 0 |cstrstr_#in~find.offset|)), 977#(and (<= 1 (select |#length| |cstrstr_#t~post11.base|)) (= |cstrstr_#t~post11.offset| 0)), 970#true, 971#false, 972#(<= 1 main_~length2~0), 973#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|)) (<= 1 main_~length2~0)), 974#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 975#(and (= 0 main_~nondetString2~0.offset) (<= 1 (select |#length| main_~nondetString2~0.base)))] [2018-02-02 09:50:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:46,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:50:46,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:50:46,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:50:46,457 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 8 states. [2018-02-02 09:50:46,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:46,568 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-02-02 09:50:46,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:50:46,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-02 09:50:46,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:46,569 INFO L225 Difference]: With dead ends: 81 [2018-02-02 09:50:46,569 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 09:50:46,570 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:50:46,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 09:50:46,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-02 09:50:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 09:50:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-02-02 09:50:46,574 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 17 [2018-02-02 09:50:46,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:46,574 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-02-02 09:50:46,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:50:46,574 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-02-02 09:50:46,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:50:46,575 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:46,575 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:46,575 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:46,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098626, now seen corresponding path program 1 times [2018-02-02 09:50:46,577 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:46,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:46,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:46,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:46,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:50:46,633 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:46,633 INFO L182 omatonBuilderFactory]: Interpolants [1144#true, 1145#false, 1146#(= 1 (select |#valid| main_~nondetString2~0.base)), 1147#(= 1 (select |#valid| |cstrstr_#in~find.base|)), 1148#(= 1 (select |#valid| cstrstr_~find.base)), 1149#(= 1 (select |#valid| |cstrlen_#in~str.base|)), 1150#(= 1 (select |#valid| cstrlen_~s~0.base))] [2018-02-02 09:50:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:46,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:50:46,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:50:46,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:50:46,634 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 7 states. [2018-02-02 09:50:46,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:46,755 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-02-02 09:50:46,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:50:46,755 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-02 09:50:46,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:46,756 INFO L225 Difference]: With dead ends: 80 [2018-02-02 09:50:46,756 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 09:50:46,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:50:46,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 09:50:46,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-02 09:50:46,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 09:50:46,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-02-02 09:50:46,759 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 23 [2018-02-02 09:50:46,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:46,759 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-02-02 09:50:46,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:50:46,759 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-02-02 09:50:46,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:50:46,760 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:46,760 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:46,760 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:46,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098625, now seen corresponding path program 1 times [2018-02-02 09:50:46,760 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:46,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:46,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:46,883 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:46,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 09:50:46,883 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:46,884 INFO L182 omatonBuilderFactory]: Interpolants [1315#true, 1316#false, 1317#(and (<= main_~length2~0 1) (<= 1 main_~length2~0)), 1318#(and (<= main_~length2~0 1) (= 0 |main_#t~malloc21.offset|) (<= 1 main_~length2~0)), 1319#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (<= (+ main_~nondetString2~0.offset main_~length2~0) 1)), 1320#(and (= main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset))), 1321#(= 0 (select (select |#memory_int| |cstrstr_#in~find.base|) |cstrstr_#in~find.offset|)), 1322#(= 0 (select (select |#memory_int| |cstrstr_#t~post11.base|) |cstrstr_#t~post11.offset|)), 1323#(= 0 |cstrstr_#t~mem12|), 1324#(= 0 cstrstr_~c~0)] [2018-02-02 09:50:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:46,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:50:46,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:50:46,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:50:46,885 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 10 states. [2018-02-02 09:50:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:47,008 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-02-02 09:50:47,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:50:47,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-02 09:50:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:47,010 INFO L225 Difference]: With dead ends: 104 [2018-02-02 09:50:47,010 INFO L226 Difference]: Without dead ends: 104 [2018-02-02 09:50:47,011 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:50:47,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-02 09:50:47,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2018-02-02 09:50:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 09:50:47,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-02-02 09:50:47,015 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 23 [2018-02-02 09:50:47,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:47,016 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-02-02 09:50:47,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:50:47,016 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-02-02 09:50:47,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:50:47,017 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:47,017 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:47,017 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:47,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1390800317, now seen corresponding path program 1 times [2018-02-02 09:50:47,018 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:47,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:47,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:47,177 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:47,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 09:50:47,177 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:47,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:47,177 INFO L182 omatonBuilderFactory]: Interpolants [1537#true, 1538#false, 1539#(<= 1 main_~length2~0), 1540#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|)) (<= 1 main_~length2~0)), 1541#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 1542#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset)) (<= 2 (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base))))), 1543#(and (or (= 0 (select (select |#memory_int| |cstrstr_#in~find.base|) |cstrstr_#in~find.offset|)) (<= 2 (select |#length| |cstrstr_#in~find.base|))) (= 0 |cstrstr_#in~find.offset|)), 1544#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (or (= 0 (select (select |#memory_int| |cstrstr_#t~post11.base|) |cstrstr_#t~post11.offset|)) (<= (+ cstrstr_~find.offset 1) (+ |cstrstr_#t~post11.offset| (select |#length| cstrstr_~find.base)))) (= |cstrstr_#t~post11.offset| 0)), 1545#(and (or (= 0 |cstrstr_#t~mem12|) (<= (+ cstrstr_~find.offset 1) (select |#length| cstrstr_~find.base))) (<= 1 cstrstr_~find.offset)), 1546#(and (or (= 0 cstrstr_~c~0) (<= (+ cstrstr_~find.offset 1) (select |#length| cstrstr_~find.base))) (<= 1 cstrstr_~find.offset)), 1547#(and (<= (+ cstrstr_~find.offset 1) (select |#length| cstrstr_~find.base)) (<= 1 cstrstr_~find.offset)), 1548#(and (<= (+ |cstrlen_#in~str.offset| 1) (select |#length| |cstrlen_#in~str.base|)) (<= 1 |cstrlen_#in~str.offset|)), 1549#(and (<= 1 cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 1) (select |#length| cstrlen_~s~0.base)))] [2018-02-02 09:50:47,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:47,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:50:47,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:50:47,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:50:47,178 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 13 states. [2018-02-02 09:50:47,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:47,441 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-02-02 09:50:47,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:50:47,442 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-02-02 09:50:47,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:47,442 INFO L225 Difference]: With dead ends: 104 [2018-02-02 09:50:47,442 INFO L226 Difference]: Without dead ends: 104 [2018-02-02 09:50:47,443 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:50:47,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-02 09:50:47,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2018-02-02 09:50:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 09:50:47,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-02-02 09:50:47,445 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 23 [2018-02-02 09:50:47,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:47,445 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-02-02 09:50:47,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:50:47,445 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-02-02 09:50:47,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 09:50:47,446 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:47,446 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] [2018-02-02 09:50:47,446 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:47,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1853436480, now seen corresponding path program 1 times [2018-02-02 09:50:47,447 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:47,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:47,634 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-02 09:50:47,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:47,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 09:50:47,634 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:47,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:47,634 INFO L182 omatonBuilderFactory]: Interpolants [1768#true, 1769#false, 1770#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 1771#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 1772#(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))))), 1773#(and (or (<= 3 (select |#length| |cstrstr_#in~find.base|)) (= 0 (select (select |#memory_int| |cstrstr_#in~find.base|) 1)) (<= (select |#length| |cstrstr_#in~find.base|) 1)) (= 0 |cstrstr_#in~find.offset|)), 1774#(and (or (<= (+ |cstrstr_#t~post11.offset| (select |#length| cstrstr_~find.base)) cstrstr_~find.offset) (and (<= cstrstr_~find.offset (+ |cstrstr_#t~post11.offset| 1)) (= 0 (select (select |#memory_int| cstrstr_~find.base) 1)) (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset)) (<= (+ cstrstr_~find.offset 2) (+ |cstrstr_#t~post11.offset| (select |#length| cstrstr_~find.base)))) (= |cstrstr_#t~post11.offset| 0)), 1775#(or (<= (+ cstrstr_~find.offset 2) (select |#length| cstrstr_~find.base)) (and (<= cstrstr_~find.offset 1) (= 0 (select (select |#memory_int| cstrstr_~find.base) 1)) (<= 1 cstrstr_~find.offset)) (<= (select |#length| cstrstr_~find.base) cstrstr_~find.offset)), 1776#(or (<= (select |#length| |cstrlen_#in~str.base|) |cstrlen_#in~str.offset|) (<= (+ |cstrlen_#in~str.offset| 2) (select |#length| |cstrlen_#in~str.base|)) (and (= 0 (select (select |#memory_int| |cstrlen_#in~str.base|) 1)) (= 1 |cstrlen_#in~str.offset|))), 1777#(or (= 0 (select (select |#memory_int| cstrlen_~s~0.base) cstrlen_~s~0.offset)) (<= (select |#length| cstrlen_~s~0.base) cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base))), 1778#(and (or (= |cstrlen_#t~mem1| 0) (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base))) (<= 0 cstrlen_~s~0.offset)), 1779#(and (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base)) (<= 0 cstrlen_~s~0.offset)), 1780#(and (<= 1 cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 1) (select |#length| cstrlen_~s~0.base)))] [2018-02-02 09:50:47,634 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-02 09:50:47,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:50:47,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:50:47,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:50:47,635 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 13 states. [2018-02-02 09:50:47,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:47,930 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2018-02-02 09:50:47,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:50:47,930 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-02-02 09:50:47,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:47,931 INFO L225 Difference]: With dead ends: 108 [2018-02-02 09:50:47,931 INFO L226 Difference]: Without dead ends: 108 [2018-02-02 09:50:47,931 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:50:47,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-02 09:50:47,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2018-02-02 09:50:47,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 09:50:47,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2018-02-02 09:50:47,935 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 27 [2018-02-02 09:50:47,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:47,935 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2018-02-02 09:50:47,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:50:47,935 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-02-02 09:50:47,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 09:50:47,936 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:47,936 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:47,936 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:47,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1699013504, now seen corresponding path program 1 times [2018-02-02 09:50:47,937 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:47,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:48,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:48,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:48,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:50:48,011 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:48,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:48,012 INFO L182 omatonBuilderFactory]: Interpolants [2007#true, 2008#false, 2009#(= |#valid| |old(#valid)|), 2010#(and (= (store |#valid| |main_#t~malloc20.base| 0) |old(#valid)|) (= (select |#valid| |main_#t~malloc20.base|) 1)), 2011#(and (= (store (store |#valid| |main_#t~malloc21.base| 0) |main_#t~malloc20.base| (select (store |#valid| |main_#t~malloc20.base| 0) |main_#t~malloc20.base|)) |old(#valid)|) (not (= |main_#t~malloc20.base| |main_#t~malloc21.base|))), 2012#(= (store |#valid| |main_#t~malloc21.base| (select (store |#valid| |main_#t~malloc21.base| 0) |main_#t~malloc21.base|)) |old(#valid)|)] [2018-02-02 09:50:48,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:48,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:50:48,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:50:48,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:50:48,012 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 6 states. [2018-02-02 09:50:48,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:48,174 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2018-02-02 09:50:48,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:50:48,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-02 09:50:48,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:48,175 INFO L225 Difference]: With dead ends: 99 [2018-02-02 09:50:48,175 INFO L226 Difference]: Without dead ends: 75 [2018-02-02 09:50:48,175 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-02 09:50:48,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-02 09:50:48,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-02-02 09:50:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 09:50:48,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-02-02 09:50:48,178 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 28 [2018-02-02 09:50:48,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:48,178 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-02-02 09:50:48,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:50:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-02-02 09:50:48,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 09:50:48,179 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:48,179 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:48,179 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:48,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1948682038, now seen corresponding path program 1 times [2018-02-02 09:50:48,180 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:48,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:48,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:48,217 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:48,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:50:48,217 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:48,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:48,218 INFO L182 omatonBuilderFactory]: Interpolants [2192#false, 2193#(= 1 (select |#valid| main_~nondetString1~0.base)), 2194#(= 1 (select |#valid| |cstrstr_#in~s.base|)), 2195#(= 1 (select |#valid| cstrstr_~s.base)), 2196#(= 1 (select |#valid| |cstrstr_#t~post15.base|)), 2191#true] [2018-02-02 09:50:48,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:48,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:50:48,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:50:48,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:50:48,219 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 6 states. [2018-02-02 09:50:48,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:48,285 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-02-02 09:50:48,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:50:48,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-02 09:50:48,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:48,286 INFO L225 Difference]: With dead ends: 74 [2018-02-02 09:50:48,286 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 09:50:48,286 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-02 09:50:48,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 09:50:48,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-02 09:50:48,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 09:50:48,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-02-02 09:50:48,288 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 31 [2018-02-02 09:50:48,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:48,289 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-02-02 09:50:48,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:50:48,289 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-02-02 09:50:48,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 09:50:48,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:48,290 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:48,290 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:48,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1948682039, now seen corresponding path program 1 times [2018-02-02 09:50:48,293 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:48,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:48,381 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:48,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:50:48,381 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:48,381 INFO L182 omatonBuilderFactory]: Interpolants [2352#(and (= 0 |main_#t~malloc20.offset|) (<= 1 main_~length1~0)), 2353#(and (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 2354#(and (<= (+ main_~nondetString1~0.offset 1) (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 2355#(and (= 0 |cstrstr_#in~s.offset|) (<= 1 (select |#length| |cstrstr_#in~s.base|))), 2356#(and (<= 1 (select |#length| cstrstr_~s.base)) (= 0 cstrstr_~s.offset)), 2357#(and (<= 1 (select |#length| |cstrstr_#t~post15.base|)) (= |cstrstr_#t~post15.offset| 0)), 2349#true, 2350#false, 2351#(<= 1 main_~length1~0)] [2018-02-02 09:50:48,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:48,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:50:48,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:50:48,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:50:48,382 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 9 states. [2018-02-02 09:50:48,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:48,493 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2018-02-02 09:50:48,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:50:48,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-02 09:50:48,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:48,496 INFO L225 Difference]: With dead ends: 79 [2018-02-02 09:50:48,496 INFO L226 Difference]: Without dead ends: 79 [2018-02-02 09:50:48,496 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:50:48,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-02 09:50:48,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-02-02 09:50:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 09:50:48,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-02-02 09:50:48,499 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 31 [2018-02-02 09:50:48,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:48,499 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-02-02 09:50:48,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:50:48,499 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-02-02 09:50:48,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 09:50:48,500 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:48,500 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 09:50:48,500 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:48,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1308654915, now seen corresponding path program 2 times [2018-02-02 09:50:48,501 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:48,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:48,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:48,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 09:50:48,634 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:48,634 INFO L182 omatonBuilderFactory]: Interpolants [2528#(= 0 (select (select |#memory_int| cstrstr_~find.base) (+ (select |#length| cstrstr_~find.base) (- 1)))), 2529#(= 0 (select (select |#memory_int| |cstrlen_#in~str.base|) (+ (select |#length| |cstrlen_#in~str.base|) (- 1)))), 2530#(= 0 (select (select |#memory_int| cstrlen_~s~0.base) (+ (select |#length| cstrlen_~s~0.base) (- 1)))), 2531#(and (= 0 (select (select |#memory_int| cstrlen_~s~0.base) (+ (select |#length| cstrlen_~s~0.base) (- 1)))) (<= 0 cstrlen_~s~0.offset)), 2532#(and (<= 1 cstrlen_~s~0.offset) (or (= 0 (select (select |#memory_int| cstrlen_~s~0.base) cstrlen_~s~0.offset)) (<= (select |#length| cstrlen_~s~0.base) cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base)))), 2533#(and (<= 1 cstrlen_~s~0.offset) (or (= |cstrlen_#t~mem1| 0) (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base)))), 2534#(and (<= 1 cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base))), 2535#(and (<= 2 cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 1) (select |#length| cstrlen_~s~0.base))), 2522#true, 2523#false, 2524#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 2525#(and (= main_~nondetString2~0.offset 0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 2526#(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)))))), 2527#(= 0 (select (select |#memory_int| |cstrstr_#in~find.base|) (+ (select |#length| |cstrstr_#in~find.base|) (- 1))))] [2018-02-02 09:50:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:48,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:50:48,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:50:48,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:50:48,635 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 14 states. [2018-02-02 09:50:48,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:48,908 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2018-02-02 09:50:48,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:50:48,909 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-02-02 09:50:48,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:48,909 INFO L225 Difference]: With dead ends: 84 [2018-02-02 09:50:48,909 INFO L226 Difference]: Without dead ends: 84 [2018-02-02 09:50:48,910 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:50:48,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-02 09:50:48,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2018-02-02 09:50:48,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 09:50:48,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-02-02 09:50:48,911 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 31 [2018-02-02 09:50:48,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:48,911 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-02-02 09:50:48,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:50:48,911 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-02-02 09:50:48,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 09:50:48,912 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:48,912 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:48,912 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:48,912 INFO L82 PathProgramCache]: Analyzing trace with hash -211494479, now seen corresponding path program 1 times [2018-02-02 09:50:48,913 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:48,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:49,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:49,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:49,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 09:50:49,047 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:49,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:49,047 INFO L182 omatonBuilderFactory]: Interpolants [2720#(= 0 (select (select |#memory_int| |cstrstr_#in~s.base|) |cstrstr_#in~s.offset|)), 2721#(= 0 (select (select |#memory_int| cstrstr_~s.base) cstrstr_~s.offset)), 2722#(= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) |cstrstr_#t~post15.offset|)), 2723#(= 0 |cstrstr_#t~mem16|), 2724#(= cstrstr_~sc~0 0), 2712#true, 2713#false, 2714#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 2715#(and (= 0 |main_#t~malloc20.offset|) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= (select |#valid| |main_#t~malloc20.base|) 1)), 2716#(and (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 2717#(and (not (= main_~nondetString1~0.base |main_#t~malloc21.base|)) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 2718#(and (<= 1 main_~length1~0) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 2719#(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))] [2018-02-02 09:50:49,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:49,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:50:49,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:50:49,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:50:49,048 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 13 states. [2018-02-02 09:50:49,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:49,166 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-02-02 09:50:49,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:50:49,167 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-02-02 09:50:49,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:49,167 INFO L225 Difference]: With dead ends: 89 [2018-02-02 09:50:49,167 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 09:50:49,167 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:50:49,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 09:50:49,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-02 09:50:49,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 09:50:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-02 09:50:49,179 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 36 [2018-02-02 09:50:49,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:49,180 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-02 09:50:49,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:50:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-02 09:50:49,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 09:50:49,180 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:49,180 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:49,181 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:49,181 INFO L82 PathProgramCache]: Analyzing trace with hash -188862225, now seen corresponding path program 1 times [2018-02-02 09:50:49,182 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:49,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:49,363 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-02 09:50:49,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:49,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 09:50:49,364 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:49,364 INFO L182 omatonBuilderFactory]: Interpolants [2912#(and (or (= cstrstr_~sc~0 0) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base))) (<= 1 cstrstr_~s.offset)), 2913#(and (<= 1 cstrstr_~s.offset) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base))), 2914#(and (<= (+ |cstrstr_#t~post15.offset| 1) (select |#length| |cstrstr_#t~post15.base|)) (<= 1 |cstrstr_#t~post15.offset|)), 2900#true, 2901#false, 2902#(<= 1 main_~length1~0), 2903#(and (= 0 |main_#t~malloc20.offset|) (<= 1 main_~length1~0) (= (select |#valid| |main_#t~malloc20.base|) 1)), 2904#(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)), 2905#(and (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (not (= main_~nondetString1~0.base |main_#t~malloc21.base|))) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 2906#(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)), 2907#(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)))), 2908#(and (or (= 0 (select (select |#memory_int| |cstrstr_#in~s.base|) |cstrstr_#in~s.offset|)) (<= 2 (select |#length| |cstrstr_#in~s.base|))) (= 0 |cstrstr_#in~s.offset|)), 2909#(and (or (= 0 (select (select |#memory_int| cstrstr_~s.base) cstrstr_~s.offset)) (<= 2 (select |#length| cstrstr_~s.base))) (= 0 cstrstr_~s.offset)), 2910#(and (or (<= (+ cstrstr_~s.offset 1) (+ |cstrstr_#t~post15.offset| (select |#length| |cstrstr_#t~post15.base|))) (= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) |cstrstr_#t~post15.offset|))) (<= (+ |cstrstr_#t~post15.offset| 1) cstrstr_~s.offset) (= |cstrstr_#t~post15.offset| 0) (= |cstrstr_#t~post15.base| cstrstr_~s.base)), 2911#(and (<= 1 cstrstr_~s.offset) (or (= 0 |cstrstr_#t~mem16|) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base))))] [2018-02-02 09:50:49,364 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-02 09:50:49,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:50:49,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:50:49,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:50:49,365 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 15 states. [2018-02-02 09:50:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:49,674 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-02-02 09:50:49,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:50:49,674 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-02-02 09:50:49,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:49,675 INFO L225 Difference]: With dead ends: 81 [2018-02-02 09:50:49,675 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 09:50:49,675 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:50:49,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 09:50:49,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-02-02 09:50:49,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-02 09:50:49,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-02-02 09:50:49,677 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 36 [2018-02-02 09:50:49,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:49,677 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-02-02 09:50:49,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:50:49,677 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-02-02 09:50:49,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 09:50:49,678 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:49,678 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:49,678 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:49,678 INFO L82 PathProgramCache]: Analyzing trace with hash -7823713, now seen corresponding path program 1 times [2018-02-02 09:50:49,679 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:49,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:49,733 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:49,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:50:49,733 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:49,733 INFO L182 omatonBuilderFactory]: Interpolants [3095#true, 3096#false, 3097#(= 1 (select |#valid| main_~nondetString1~0.base)), 3098#(= 1 (select |#valid| |cstrstr_#in~s.base|)), 3099#(= 1 (select |#valid| cstrstr_~s.base)), 3100#(= 1 (select |#valid| |cstrncmp_#in~s1.base|)), 3101#(= 1 (select |#valid| cstrncmp_~s1.base))] [2018-02-02 09:50:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:49,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:50:49,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:50:49,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:50:49,734 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 7 states. [2018-02-02 09:50:49,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:49,812 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2018-02-02 09:50:49,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:50:49,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-02 09:50:49,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:49,813 INFO L225 Difference]: With dead ends: 77 [2018-02-02 09:50:49,813 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 09:50:49,813 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:50:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 09:50:49,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-02 09:50:49,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 09:50:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-02-02 09:50:49,814 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 39 [2018-02-02 09:50:49,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:49,814 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-02-02 09:50:49,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:50:49,815 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-02-02 09:50:49,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 09:50:49,815 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:49,815 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:49,815 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:49,815 INFO L82 PathProgramCache]: Analyzing trace with hash -7823712, now seen corresponding path program 1 times [2018-02-02 09:50:49,816 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:49,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:49,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:49,891 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:49,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:50:49,891 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:49,892 INFO L182 omatonBuilderFactory]: Interpolants [3264#(and (<= |cstrstr_#t~ret13| 0) (<= 0 |cstrstr_#t~ret13|)), 3265#(and (<= 0 cstrstr_~len~0) (<= cstrstr_~len~0 0)), 3266#(and (<= 0 |cstrncmp_#in~n|) (<= |cstrncmp_#in~n| 0)), 3267#(and (< 0 (+ (div cstrncmp_~n 4294967296) 1)) (<= cstrncmp_~n (* 4294967296 (div cstrncmp_~n 4294967296)))), 3260#true, 3261#false, 3262#(= cstrlen_~s~0.offset cstrlen_~str.offset), 3263#(and (<= 0 |cstrlen_#res|) (<= |cstrlen_#res| 0))] [2018-02-02 09:50:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:49,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:50:49,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:50:49,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:50:49,893 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 8 states. [2018-02-02 09:50:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:49,954 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-02-02 09:50:49,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:50:49,954 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-02-02 09:50:49,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:49,955 INFO L225 Difference]: With dead ends: 111 [2018-02-02 09:50:49,955 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 09:50:49,955 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:50:49,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 09:50:49,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-02-02 09:50:49,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 09:50:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2018-02-02 09:50:49,961 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 39 [2018-02-02 09:50:49,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:49,964 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2018-02-02 09:50:49,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:50:49,965 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2018-02-02 09:50:49,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 09:50:49,965 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:49,965 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1] [2018-02-02 09:50:49,966 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:49,966 INFO L82 PathProgramCache]: Analyzing trace with hash -701857031, now seen corresponding path program 2 times [2018-02-02 09:50:49,966 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:49,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:50,275 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:50,275 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:50,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 09:50:50,275 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:50,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:50,275 INFO L182 omatonBuilderFactory]: Interpolants [3492#true, 3493#false, 3494#(and (= 0 |main_#t~malloc20.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc20.base|)) (= (select |#valid| |main_#t~malloc20.base|) 1)), 3495#(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))), 3496#(and (= 0 main_~nondetString1~0.offset) (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 2)) (not (= main_~nondetString1~0.base |main_#t~malloc21.base|))) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 3497#(and (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 2)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (= 0 main_~nondetString1~0.offset) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 3498#(and (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) 1)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1)) (= 0 main_~nondetString1~0.offset)), 3499#(and (= 0 |cstrstr_#in~s.offset|) (or (= 0 (select (select |#memory_int| |cstrstr_#in~s.base|) 1)) (<= 3 (select |#length| |cstrstr_#in~s.base|)) (<= (select |#length| |cstrstr_#in~s.base|) 1))), 3500#(and (or (= 0 (select (select |#memory_int| cstrstr_~s.base) 1)) (<= 3 (select |#length| cstrstr_~s.base)) (<= (select |#length| cstrstr_~s.base) 1)) (= 0 cstrstr_~s.offset)), 3501#(and (or (and (or (<= (+ |cstrstr_#t~post15.offset| (select |#length| |cstrstr_#t~post15.base|)) cstrstr_~s.offset) (<= (+ cstrstr_~s.offset 2) (+ |cstrstr_#t~post15.offset| (select |#length| |cstrstr_#t~post15.base|)))) (<= (+ |cstrstr_#t~post15.offset| 1) cstrstr_~s.offset) (= |cstrstr_#t~post15.base| cstrstr_~s.base)) (and (<= (+ |cstrstr_#t~post15.offset| 1) cstrstr_~s.offset) (= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) 1)) (= |cstrstr_#t~post15.base| cstrstr_~s.base) (<= cstrstr_~s.offset (+ |cstrstr_#t~post15.offset| 1)))) (= |cstrstr_#t~post15.offset| 0)), 3502#(or (and (<= 1 cstrstr_~s.offset) (or (<= (+ cstrstr_~s.offset 2) (select |#length| cstrstr_~s.base)) (<= (select |#length| cstrstr_~s.base) cstrstr_~s.offset))) (and (= 0 (select (select |#memory_int| cstrstr_~s.base) 1)) (<= cstrstr_~s.offset 1) (<= 1 cstrstr_~s.offset))), 3503#(or (and (= 1 |cstrstr_#t~post15.offset|) (= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) |cstrstr_#t~post15.offset|))) (and (or (<= (select |#length| |cstrstr_#t~post15.base|) |cstrstr_#t~post15.offset|) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base))) (<= 2 cstrstr_~s.offset))), 3504#(or (and (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)) (<= 2 cstrstr_~s.offset)) (= 0 |cstrstr_#t~mem16|)), 3505#(or (= cstrstr_~sc~0 0) (and (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)) (<= 2 cstrstr_~s.offset))), 3506#(and (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)) (<= 2 cstrstr_~s.offset)), 3507#(and (<= (+ |cstrstr_#t~post15.offset| 1) (select |#length| |cstrstr_#t~post15.base|)) (<= 2 |cstrstr_#t~post15.offset|))] [2018-02-02 09:50:50,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:50,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:50:50,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:50:50,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:50:50,276 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 16 states. [2018-02-02 09:50:50,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:50,724 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2018-02-02 09:50:50,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:50:50,725 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-02-02 09:50:50,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:50,725 INFO L225 Difference]: With dead ends: 131 [2018-02-02 09:50:50,725 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 09:50:50,725 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2018-02-02 09:50:50,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 09:50:50,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-02-02 09:50:50,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 09:50:50,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2018-02-02 09:50:50,728 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 41 [2018-02-02 09:50:50,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:50,728 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2018-02-02 09:50:50,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:50:50,728 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2018-02-02 09:50:50,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 09:50:50,728 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:50,728 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:50,728 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:50,728 INFO L82 PathProgramCache]: Analyzing trace with hash 648064035, now seen corresponding path program 1 times [2018-02-02 09:50:50,729 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:50,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:50:50,937 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:50,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-02 09:50:50,938 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:50,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-02 09:50:50,938 INFO L182 omatonBuilderFactory]: Interpolants [3790#true, 3791#false, 3792#(<= 1 main_~length1~0), 3793#(and (= 0 |main_#t~malloc20.offset|) (<= 1 main_~length1~0) (= (select |#valid| |main_#t~malloc20.base|) 1)), 3794#(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)), 3795#(and (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (not (= main_~nondetString1~0.base |main_#t~malloc21.base|))) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 3796#(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)), 3797#(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)))), 3798#(and (or (= 0 (select (select |#memory_int| |cstrstr_#in~s.base|) |cstrstr_#in~s.offset|)) (<= 2 (select |#length| |cstrstr_#in~s.base|))) (= 0 |cstrstr_#in~s.offset|)), 3799#(and (or (= 0 (select (select |#memory_int| cstrstr_~s.base) cstrstr_~s.offset)) (<= 2 (select |#length| cstrstr_~s.base))) (= 0 cstrstr_~s.offset)), 3800#(and (= |cstrstr_#t~post15.offset| 0) (= |cstrstr_#t~post15.base| cstrstr_~s.base) (or (and (<= (+ cstrstr_~s.offset 1) (+ |cstrstr_#t~post15.offset| (select |#length| |cstrstr_#t~post15.base|))) (<= (+ |cstrstr_#t~post15.offset| 1) cstrstr_~s.offset)) (= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) |cstrstr_#t~post15.offset|)))), 3801#(or (= 0 |cstrstr_#t~mem16|) (and (<= 1 cstrstr_~s.offset) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)))), 3802#(or (= cstrstr_~sc~0 0) (and (<= 1 cstrstr_~s.offset) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)))), 3803#(and (<= 1 cstrstr_~s.offset) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base))), 3804#(and (<= (+ |cstrncmp_#in~s1.offset| 1) (select |#length| |cstrncmp_#in~s1.base|)) (<= 1 |cstrncmp_#in~s1.offset|)), 3805#(and (<= 1 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base)))] [2018-02-02 09:50:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:50:50,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:50:50,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:50:50,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:50:50,939 INFO L87 Difference]: Start difference. First operand 127 states and 144 transitions. Second operand 16 states. [2018-02-02 09:50:51,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:51,247 INFO L93 Difference]: Finished difference Result 172 states and 192 transitions. [2018-02-02 09:50:51,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:50:51,252 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-02-02 09:50:51,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:51,252 INFO L225 Difference]: With dead ends: 172 [2018-02-02 09:50:51,252 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 09:50:51,253 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-02-02 09:50:51,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 09:50:51,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2018-02-02 09:50:51,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 09:50:51,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 185 transitions. [2018-02-02 09:50:51,256 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 185 transitions. Word has length 43 [2018-02-02 09:50:51,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:51,256 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 185 transitions. [2018-02-02 09:50:51,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:50:51,257 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 185 transitions. [2018-02-02 09:50:51,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 09:50:51,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:51,257 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:51,257 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:51,257 INFO L82 PathProgramCache]: Analyzing trace with hash 19279971, now seen corresponding path program 1 times [2018-02-02 09:50:51,258 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:51,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:51,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:51,292 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:51,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 09:50:51,292 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:51,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:51,293 INFO L182 omatonBuilderFactory]: Interpolants [4160#(= 1 (select |#valid| cstrncmp_~s2.base)), 4161#(= 1 (select |#valid| |cstrncmp_#t~post3.base|)), 4153#true, 4154#false, 4155#(= cstrlen_~s~0.base |cstrlen_#in~str.base|), 4156#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (= 1 (select |#valid| cstrlen_~s~0.base))), 4157#(= 1 (select |#valid| |cstrlen_#in~str.base|)), 4158#(= 1 (select |#valid| cstrstr_~find.base)), 4159#(= 1 (select |#valid| |cstrncmp_#in~s2.base|))] [2018-02-02 09:50:51,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:51,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:50:51,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:50:51,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:50:51,294 INFO L87 Difference]: Start difference. First operand 155 states and 185 transitions. Second operand 9 states. [2018-02-02 09:50:51,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:51,345 INFO L93 Difference]: Finished difference Result 154 states and 182 transitions. [2018-02-02 09:50:51,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:50:51,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-02-02 09:50:51,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:51,346 INFO L225 Difference]: With dead ends: 154 [2018-02-02 09:50:51,346 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 09:50:51,346 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:50:51,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 09:50:51,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-02-02 09:50:51,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-02 09:50:51,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 182 transitions. [2018-02-02 09:50:51,349 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 182 transitions. Word has length 45 [2018-02-02 09:50:51,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:51,349 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 182 transitions. [2018-02-02 09:50:51,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:50:51,349 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 182 transitions. [2018-02-02 09:50:51,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 09:50:51,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:51,350 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:51,350 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:51,350 INFO L82 PathProgramCache]: Analyzing trace with hash 19279972, now seen corresponding path program 1 times [2018-02-02 09:50:51,351 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:51,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:51,478 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:51,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 09:50:51,479 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:51,479 INFO L182 omatonBuilderFactory]: Interpolants [4480#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0)), 4481#(<= 1 cstrstr_~find.offset), 4482#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 4483#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 1) (select |#length| cstrlen_~s~0.base))), 4484#(<= (+ |cstrlen_#in~str.offset| 1) (select |#length| |cstrlen_#in~str.base|)), 4485#(and (<= (+ cstrstr_~find.offset 1) (select |#length| cstrstr_~find.base)) (<= 1 cstrstr_~find.offset)), 4486#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= (+ |cstrncmp_#in~s2.offset| 1) (select |#length| |cstrncmp_#in~s2.base|))), 4487#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 4488#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 1 |cstrncmp_#t~post3.offset|)), 4474#true, 4475#false, 4476#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 4477#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 4478#(= 0 main_~nondetString2~0.offset), 4479#(= 0 |cstrstr_#in~find.offset|)] [2018-02-02 09:50:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:51,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:50:51,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:50:51,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:50:51,480 INFO L87 Difference]: Start difference. First operand 154 states and 182 transitions. Second operand 15 states. [2018-02-02 09:50:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:51,699 INFO L93 Difference]: Finished difference Result 165 states and 194 transitions. [2018-02-02 09:50:51,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:50:51,699 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-02 09:50:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:51,700 INFO L225 Difference]: With dead ends: 165 [2018-02-02 09:50:51,701 INFO L226 Difference]: Without dead ends: 165 [2018-02-02 09:50:51,701 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:50:51,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-02 09:50:51,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 158. [2018-02-02 09:50:51,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 09:50:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2018-02-02 09:50:51,706 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 45 [2018-02-02 09:50:51,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:51,706 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2018-02-02 09:50:51,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:50:51,706 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2018-02-02 09:50:51,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 09:50:51,707 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:51,707 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:51,707 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:51,710 INFO L82 PathProgramCache]: Analyzing trace with hash -156113105, now seen corresponding path program 3 times [2018-02-02 09:50:51,710 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:51,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:51,984 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:50:51,984 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:51,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 09:50:51,984 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:51,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:51,985 INFO L182 omatonBuilderFactory]: Interpolants [4832#(= 0 (select (select |#memory_int| cstrstr_~s.base) (+ (select |#length| cstrstr_~s.base) (- 1)))), 4833#(and (= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) (+ (select |#length| |cstrstr_#t~post15.base|) (- 1)))) (= |cstrstr_#t~post15.base| cstrstr_~s.base)), 4834#(or (and (or (<= (select |#length| |cstrstr_#t~post15.base|) |cstrstr_#t~post15.offset|) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base))) (<= (+ |cstrstr_#t~post15.offset| 1) cstrstr_~s.offset)) (= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) |cstrstr_#t~post15.offset|))), 4835#(or (= 0 |cstrstr_#t~mem16|) (and (<= 1 cstrstr_~s.offset) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)))), 4836#(or (= cstrstr_~sc~0 0) (and (<= 1 cstrstr_~s.offset) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)))), 4837#(and (<= 1 cstrstr_~s.offset) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base))), 4838#(and (<= (+ |cstrstr_#t~post15.offset| 1) (select |#length| |cstrstr_#t~post15.base|)) (<= 1 |cstrstr_#t~post15.offset|)), 4824#true, 4825#false, 4826#(and (= 0 |main_#t~malloc20.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc20.base|)) (= (select |#valid| |main_#t~malloc20.base|) 1)), 4827#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 4828#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base |main_#t~malloc21.base|)) (= main_~nondetString1~0.offset 0)), 4829#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 4830#(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)), 4831#(= 0 (select (select |#memory_int| |cstrstr_#in~s.base|) (+ (select |#length| |cstrstr_#in~s.base|) (- 1))))] [2018-02-02 09:50:51,985 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:50:51,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:50:51,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:50:51,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:50:51,986 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand 15 states. [2018-02-02 09:50:52,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:52,393 INFO L93 Difference]: Finished difference Result 157 states and 184 transitions. [2018-02-02 09:50:52,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:50:52,394 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-02-02 09:50:52,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:52,395 INFO L225 Difference]: With dead ends: 157 [2018-02-02 09:50:52,395 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 09:50:52,395 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2018-02-02 09:50:52,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 09:50:52,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2018-02-02 09:50:52,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-02 09:50:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2018-02-02 09:50:52,397 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 46 [2018-02-02 09:50:52,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:52,397 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2018-02-02 09:50:52,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:50:52,397 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2018-02-02 09:50:52,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 09:50:52,397 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:52,397 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:50:52,397 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:52,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1348184644, now seen corresponding path program 1 times [2018-02-02 09:50:52,398 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:52,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:52,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:50:52,452 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:52,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:50:52,452 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:52,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:52,453 INFO L182 omatonBuilderFactory]: Interpolants [5121#true, 5122#false, 5123#(= 1 (select |#valid| main_~nondetString1~0.base)), 5124#(= 1 (select |#valid| |cstrstr_#in~s.base|)), 5125#(= 1 (select |#valid| cstrstr_~s.base)), 5126#(= 1 (select |#valid| |cstrncmp_#in~s1.base|)), 5127#(= 1 (select |#valid| cstrncmp_~s1.base)), 5128#(= 1 (select |#valid| |cstrncmp_#t~post9.base|))] [2018-02-02 09:50:52,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:50:52,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:50:52,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:50:52,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:50:52,453 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand 8 states. [2018-02-02 09:50:52,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:52,530 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2018-02-02 09:50:52,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:50:52,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-02-02 09:50:52,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:52,531 INFO L225 Difference]: With dead ends: 100 [2018-02-02 09:50:52,531 INFO L226 Difference]: Without dead ends: 100 [2018-02-02 09:50:52,531 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:50:52,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-02 09:50:52,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-02-02 09:50:52,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 09:50:52,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2018-02-02 09:50:52,533 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 47 [2018-02-02 09:50:52,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:52,533 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2018-02-02 09:50:52,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:50:52,533 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2018-02-02 09:50:52,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 09:50:52,534 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:52,534 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:50:52,534 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:52,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1348184645, now seen corresponding path program 1 times [2018-02-02 09:50:52,534 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:52,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:52,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:50:52,558 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:52,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:50:52,558 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:52,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:52,559 INFO L182 omatonBuilderFactory]: Interpolants [5335#true, 5336#false, 5337#(= |cstrstr_#t~post15.base| cstrstr_~s.base), 5338#(and (<= 0 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base))), 5339#(and (<= (+ |cstrncmp_#t~post9.offset| 1) (select |#length| |cstrncmp_#t~post9.base|)) (<= 0 |cstrncmp_#t~post9.offset|))] [2018-02-02 09:50:52,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:50:52,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:50:52,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:50:52,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:50:52,559 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand 5 states. [2018-02-02 09:50:52,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:52,595 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2018-02-02 09:50:52,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:50:52,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-02-02 09:50:52,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:52,595 INFO L225 Difference]: With dead ends: 102 [2018-02-02 09:50:52,595 INFO L226 Difference]: Without dead ends: 102 [2018-02-02 09:50:52,596 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:50:52,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-02 09:50:52,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2018-02-02 09:50:52,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 09:50:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2018-02-02 09:50:52,597 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 47 [2018-02-02 09:50:52,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:52,598 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2018-02-02 09:50:52,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:50:52,598 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2018-02-02 09:50:52,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 09:50:52,598 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:52,598 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:52,599 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:52,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1381663923, now seen corresponding path program 1 times [2018-02-02 09:50:52,599 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:52,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:52,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:50:52,894 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:52,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 09:50:52,894 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:52,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:52,895 INFO L182 omatonBuilderFactory]: Interpolants [5538#true, 5539#false, 5540#(and (= 0 |main_#t~malloc20.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc20.base|)) (= (select |#valid| |main_#t~malloc20.base|) 1)), 5541#(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))), 5542#(and (= 0 main_~nondetString1~0.offset) (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 2)) (not (= main_~nondetString1~0.base |main_#t~malloc21.base|))) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 5543#(and (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 2)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (= 0 main_~nondetString1~0.offset) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 5544#(and (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) 1)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1)) (= 0 main_~nondetString1~0.offset)), 5545#(and (= 0 |cstrstr_#in~s.offset|) (or (= 0 (select (select |#memory_int| |cstrstr_#in~s.base|) 1)) (<= 3 (select |#length| |cstrstr_#in~s.base|)) (<= (select |#length| |cstrstr_#in~s.base|) 1))), 5546#(and (or (= 0 (select (select |#memory_int| cstrstr_~s.base) 1)) (<= 3 (select |#length| cstrstr_~s.base)) (<= (select |#length| cstrstr_~s.base) 1)) (= 0 cstrstr_~s.offset)), 5547#(and (or (and (or (<= (+ |cstrstr_#t~post15.offset| (select |#length| |cstrstr_#t~post15.base|)) cstrstr_~s.offset) (<= (+ cstrstr_~s.offset 2) (+ |cstrstr_#t~post15.offset| (select |#length| |cstrstr_#t~post15.base|)))) (<= (+ |cstrstr_#t~post15.offset| 1) cstrstr_~s.offset) (= |cstrstr_#t~post15.base| cstrstr_~s.base)) (and (<= (+ |cstrstr_#t~post15.offset| 1) cstrstr_~s.offset) (= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) 1)) (= |cstrstr_#t~post15.base| cstrstr_~s.base) (<= cstrstr_~s.offset (+ |cstrstr_#t~post15.offset| 1)))) (= |cstrstr_#t~post15.offset| 0)), 5548#(or (and (<= 1 cstrstr_~s.offset) (or (<= (+ cstrstr_~s.offset 2) (select |#length| cstrstr_~s.base)) (<= (select |#length| cstrstr_~s.base) cstrstr_~s.offset))) (and (= 0 (select (select |#memory_int| cstrstr_~s.base) 1)) (<= cstrstr_~s.offset 1) (<= 1 cstrstr_~s.offset))), 5549#(or (and (= 1 |cstrstr_#t~post15.offset|) (= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) |cstrstr_#t~post15.offset|))) (and (or (<= (select |#length| |cstrstr_#t~post15.base|) |cstrstr_#t~post15.offset|) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base))) (<= 2 cstrstr_~s.offset))), 5550#(or (and (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)) (<= 2 cstrstr_~s.offset)) (= 0 |cstrstr_#t~mem16|)), 5551#(or (= cstrstr_~sc~0 0) (and (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)) (<= 2 cstrstr_~s.offset))), 5552#(and (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)) (<= 2 cstrstr_~s.offset)), 5553#(and (<= (+ |cstrncmp_#in~s1.offset| 1) (select |#length| |cstrncmp_#in~s1.base|)) (<= 2 |cstrncmp_#in~s1.offset|)), 5554#(and (<= 2 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base)))] [2018-02-02 09:50:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:50:52,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 09:50:52,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 09:50:52,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:50:52,895 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 17 states. [2018-02-02 09:50:53,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:53,438 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2018-02-02 09:50:53,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:50:53,439 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2018-02-02 09:50:53,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:53,439 INFO L225 Difference]: With dead ends: 144 [2018-02-02 09:50:53,439 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 09:50:53,439 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2018-02-02 09:50:53,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 09:50:53,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2018-02-02 09:50:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 09:50:53,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 152 transitions. [2018-02-02 09:50:53,442 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 152 transitions. Word has length 48 [2018-02-02 09:50:53,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:53,442 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 152 transitions. [2018-02-02 09:50:53,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 09:50:53,442 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2018-02-02 09:50:53,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 09:50:53,442 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:53,442 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:50:53,442 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:53,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1474955739, now seen corresponding path program 1 times [2018-02-02 09:50:53,443 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:53,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:53,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 09:50:53,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:53,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 09:50:53,487 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:53,487 INFO L182 omatonBuilderFactory]: Interpolants [5856#(= 1 (select |#valid| cstrncmp_~s2.base)), 5857#(= 1 (select |#valid| |cstrncmp_#t~pre6.base|)), 5850#true, 5851#false, 5852#(= cstrlen_~s~0.base |cstrlen_#in~str.base|), 5853#(= 1 (select |#valid| |cstrlen_#in~str.base|)), 5854#(= 1 (select |#valid| cstrstr_~find.base)), 5855#(= 1 (select |#valid| |cstrncmp_#in~s2.base|))] [2018-02-02 09:50:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 09:50:53,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:50:53,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:50:53,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:50:53,488 INFO L87 Difference]: Start difference. First operand 127 states and 152 transitions. Second operand 8 states. [2018-02-02 09:50:53,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:53,551 INFO L93 Difference]: Finished difference Result 126 states and 149 transitions. [2018-02-02 09:50:53,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:50:53,551 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-02-02 09:50:53,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:53,553 INFO L225 Difference]: With dead ends: 126 [2018-02-02 09:50:53,553 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 09:50:53,553 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:50:53,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 09:50:53,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-02-02 09:50:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 09:50:53,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 149 transitions. [2018-02-02 09:50:53,556 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 149 transitions. Word has length 49 [2018-02-02 09:50:53,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:53,557 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 149 transitions. [2018-02-02 09:50:53,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:50:53,557 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 149 transitions. [2018-02-02 09:50:53,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 09:50:53,557 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:53,557 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:50:53,557 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:53,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1474955738, now seen corresponding path program 1 times [2018-02-02 09:50:53,558 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:53,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:53,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:53,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:53,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 09:50:53,683 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:53,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:53,683 INFO L182 omatonBuilderFactory]: Interpolants [6116#true, 6117#false, 6118#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 6119#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 6120#(= 0 main_~nondetString2~0.offset), 6121#(= 0 |cstrstr_#in~find.offset|), 6122#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0)), 6123#(<= 1 cstrstr_~find.offset), 6124#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 6125#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 1) (select |#length| cstrlen_~s~0.base))), 6126#(<= (+ |cstrlen_#in~str.offset| 1) (select |#length| |cstrlen_#in~str.base|)), 6127#(and (<= (+ cstrstr_~find.offset 1) (select |#length| cstrstr_~find.base)) (<= 1 cstrstr_~find.offset)), 6128#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= (+ |cstrncmp_#in~s2.offset| 1) (select |#length| |cstrncmp_#in~s2.base|))), 6129#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 6130#(and (<= 2 cstrncmp_~s2.offset) (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base))), 6131#(and (<= 1 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)))] [2018-02-02 09:50:53,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:53,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:50:53,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:50:53,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:50:53,684 INFO L87 Difference]: Start difference. First operand 126 states and 149 transitions. Second operand 16 states. [2018-02-02 09:50:53,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:53,929 INFO L93 Difference]: Finished difference Result 180 states and 213 transitions. [2018-02-02 09:50:53,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:50:53,946 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-02-02 09:50:53,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:53,947 INFO L225 Difference]: With dead ends: 180 [2018-02-02 09:50:53,947 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 09:50:53,947 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-02-02 09:50:53,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 09:50:53,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 138. [2018-02-02 09:50:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-02 09:50:53,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 164 transitions. [2018-02-02 09:50:53,949 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 164 transitions. Word has length 49 [2018-02-02 09:50:53,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:53,950 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 164 transitions. [2018-02-02 09:50:53,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:50:53,950 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 164 transitions. [2018-02-02 09:50:53,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 09:50:53,950 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:53,950 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:53,950 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:53,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1071735008, now seen corresponding path program 1 times [2018-02-02 09:50:53,951 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:53,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:54,047 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:54,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 09:50:54,048 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:54,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:54,048 INFO L182 omatonBuilderFactory]: Interpolants [6464#true, 6465#false, 6466#(= cstrlen_~s~0.offset cstrlen_~str.offset), 6467#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 6468#(and (<= 1 |cstrlen_#res|) (<= |cstrlen_#res| 1)), 6469#(and (<= 1 |cstrstr_#t~ret13|) (<= |cstrstr_#t~ret13| 1)), 6470#(and (<= 1 cstrstr_~len~0) (<= cstrstr_~len~0 1)), 6471#(and (<= |cstrncmp_#in~n| 1) (<= 1 |cstrncmp_#in~n|)), 6472#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 6473#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|))] [2018-02-02 09:50:54,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:54,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:50:54,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:50:54,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:50:54,049 INFO L87 Difference]: Start difference. First operand 138 states and 164 transitions. Second operand 10 states. [2018-02-02 09:50:54,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:54,131 INFO L93 Difference]: Finished difference Result 236 states and 272 transitions. [2018-02-02 09:50:54,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:50:54,131 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-02-02 09:50:54,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:54,132 INFO L225 Difference]: With dead ends: 236 [2018-02-02 09:50:54,132 INFO L226 Difference]: Without dead ends: 236 [2018-02-02 09:50:54,132 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:50:54,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-02 09:50:54,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 225. [2018-02-02 09:50:54,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-02 09:50:54,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 262 transitions. [2018-02-02 09:50:54,137 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 262 transitions. Word has length 52 [2018-02-02 09:50:54,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:54,138 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 262 transitions. [2018-02-02 09:50:54,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:50:54,138 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 262 transitions. [2018-02-02 09:50:54,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 09:50:54,138 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:54,138 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:54,139 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:54,139 INFO L82 PathProgramCache]: Analyzing trace with hash 515999267, now seen corresponding path program 2 times [2018-02-02 09:50:54,139 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:54,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:54,340 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 09:50:54,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:54,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 09:50:54,340 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:54,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:54,340 INFO L182 omatonBuilderFactory]: Interpolants [6944#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 6945#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base |main_#t~malloc21.base|)) (= main_~nondetString1~0.offset 0)), 6946#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 6947#(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)), 6948#(= 0 (select (select |#memory_int| |cstrstr_#in~s.base|) (+ (select |#length| |cstrstr_#in~s.base|) (- 1)))), 6949#(= 0 (select (select |#memory_int| cstrstr_~s.base) (+ (select |#length| cstrstr_~s.base) (- 1)))), 6950#(and (= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) (+ (select |#length| |cstrstr_#t~post15.base|) (- 1)))) (= |cstrstr_#t~post15.base| cstrstr_~s.base)), 6951#(and (<= (+ |cstrstr_#t~post15.offset| 1) cstrstr_~s.offset) (or (<= (select |#length| |cstrstr_#t~post15.base|) |cstrstr_#t~post15.offset|) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)) (= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) |cstrstr_#t~post15.offset|)))), 6952#(and (<= 1 cstrstr_~s.offset) (or (= 0 |cstrstr_#t~mem16|) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base)))), 6953#(and (or (= cstrstr_~sc~0 0) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base))) (<= 1 cstrstr_~s.offset)), 6954#(and (<= 1 cstrstr_~s.offset) (<= (+ cstrstr_~s.offset 1) (select |#length| cstrstr_~s.base))), 6955#(and (<= (+ |cstrncmp_#in~s1.offset| 1) (select |#length| |cstrncmp_#in~s1.base|)) (<= 1 |cstrncmp_#in~s1.offset|)), 6956#(and (<= 1 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base))), 6941#true, 6942#false, 6943#(and (= 0 |main_#t~malloc20.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc20.base|)) (= (select |#valid| |main_#t~malloc20.base|) 1))] [2018-02-02 09:50:54,341 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 09:50:54,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:50:54,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:50:54,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:50:54,341 INFO L87 Difference]: Start difference. First operand 225 states and 262 transitions. Second operand 16 states. [2018-02-02 09:50:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:54,636 INFO L93 Difference]: Finished difference Result 240 states and 275 transitions. [2018-02-02 09:50:54,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:50:54,636 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2018-02-02 09:50:54,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:54,637 INFO L225 Difference]: With dead ends: 240 [2018-02-02 09:50:54,637 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 09:50:54,637 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2018-02-02 09:50:54,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 09:50:54,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 74. [2018-02-02 09:50:54,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 09:50:54,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-02-02 09:50:54,639 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 53 [2018-02-02 09:50:54,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:54,639 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-02-02 09:50:54,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:50:54,639 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-02-02 09:50:54,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 09:50:54,639 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:54,639 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:54,639 INFO L371 AbstractCegarLoop]: === Iteration 31 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:54,639 INFO L82 PathProgramCache]: Analyzing trace with hash 931438653, now seen corresponding path program 2 times [2018-02-02 09:50:54,640 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:54,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:55,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:50:55,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:55,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 09:50:55,255 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:55,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:55,255 INFO L182 omatonBuilderFactory]: Interpolants [7296#(and (= 0 main_~nondetString2~0.offset) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (or (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (not (= 2 (+ main_~nondetString1~0.offset main_~length1~0)))) (= main_~nondetString1~0.offset 0)), 7297#(and (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) 1)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1)) (= 0 main_~nondetString2~0.offset) (= main_~nondetString1~0.offset 0)), 7298#(and (= 0 |cstrstr_#in~s.offset|) (or (= 0 (select (select |#memory_int| |cstrstr_#in~s.base|) 1)) (<= 3 (select |#length| |cstrstr_#in~s.base|)) (<= (select |#length| |cstrstr_#in~s.base|) 1)) (= 0 |cstrstr_#in~find.offset|)), 7299#(and (<= cstrstr_~find.offset (+ |cstrstr_#t~post11.offset| 1)) (or (= 0 (select (select |#memory_int| cstrstr_~s.base) 1)) (<= 3 (select |#length| cstrstr_~s.base)) (<= (select |#length| cstrstr_~s.base) 1)) (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0) (= 0 cstrstr_~s.offset)), 7300#(and (<= cstrstr_~find.offset 1) (or (= 0 (select (select |#memory_int| cstrstr_~s.base) 1)) (<= 3 (select |#length| cstrstr_~s.base)) (<= (select |#length| cstrstr_~s.base) 1)) (<= 1 cstrstr_~find.offset) (= 0 cstrstr_~s.offset)), 7301#(or (not (= 1 |cstrlen_#in~str.offset|)) (and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (= cstrlen_~s~0.offset 1))), 7302#(or (not (= 1 |cstrlen_#in~str.offset|)) (and (= |cstrlen_#t~mem1| (select (select |#memory_int| cstrlen_~s~0.base) 1)) (= cstrlen_~s~0.base |cstrlen_#in~str.base|))), 7303#(or (not (= 1 |cstrlen_#in~str.offset|)) (and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (not (= (select (select |#memory_int| cstrlen_~s~0.base) 1) 0)))), 7304#(or (not (= (select (select |#memory_int| |cstrlen_#in~str.base|) 1) 0)) (not (= 1 |cstrlen_#in~str.offset|))), 7305#(and (<= cstrstr_~find.offset 1) (or (<= 3 (select |#length| cstrstr_~s.base)) (<= (select |#length| cstrstr_~s.base) 1) (not (= (select (select |#memory_int| cstrstr_~find.base) 1) (select (select |#memory_int| cstrstr_~s.base) 1)))) (<= 1 cstrstr_~find.offset) (= 0 cstrstr_~s.offset)), 7306#(and (<= cstrstr_~find.offset 1) (<= (+ |cstrstr_#t~post15.offset| 1) cstrstr_~s.offset) (= |cstrstr_#t~post15.offset| 0) (<= 1 cstrstr_~find.offset) (or (and (not (= (select (select |#memory_int| cstrstr_~find.base) 1) (select (select |#memory_int| |cstrstr_#t~post15.base|) 1))) (= |cstrstr_#t~post15.base| cstrstr_~s.base)) (and (<= (+ |cstrstr_#t~post15.offset| (select |#length| |cstrstr_#t~post15.base|)) cstrstr_~s.offset) (= |cstrstr_#t~post15.base| cstrstr_~s.base)) (and (<= (+ cstrstr_~s.offset 2) (+ |cstrstr_#t~post15.offset| (select |#length| |cstrstr_#t~post15.base|))) (= |cstrstr_#t~post15.base| cstrstr_~s.base))) (<= cstrstr_~s.offset (+ |cstrstr_#t~post15.offset| 1))), 7307#(and (<= cstrstr_~find.offset 1) (<= cstrstr_~s.offset 1) (<= 1 cstrstr_~s.offset) (or (<= (+ cstrstr_~s.offset 2) (select |#length| cstrstr_~s.base)) (not (= (select (select |#memory_int| cstrstr_~find.base) 1) (select (select |#memory_int| cstrstr_~s.base) 1))) (<= (select |#length| cstrstr_~s.base) cstrstr_~s.offset)) (<= 1 cstrstr_~find.offset)), 7308#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= 1 |cstrncmp_#in~s1.offset|) (<= |cstrncmp_#in~s2.offset| 1) (<= |cstrncmp_#in~s1.offset| 1) (or (<= (select |#length| |cstrncmp_#in~s1.base|) |cstrncmp_#in~s1.offset|) (<= (+ |cstrncmp_#in~s1.offset| 2) (select |#length| |cstrncmp_#in~s1.base|)) (not (= (select (select |#memory_int| |cstrncmp_#in~s2.base|) 1) (select (select |#memory_int| |cstrncmp_#in~s1.base|) 1))))), 7309#(and (= cstrncmp_~s1.offset 1) (<= cstrncmp_~s2.offset 1) (or (<= (+ cstrncmp_~s1.offset 2) (select |#length| cstrncmp_~s1.base)) (not (= (select (select |#memory_int| cstrncmp_~s2.base) 1) (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset))) (<= (select |#length| cstrncmp_~s1.base) cstrncmp_~s1.offset)) (<= 1 cstrncmp_~s2.offset)), 7310#(and (= cstrncmp_~s1.offset 1) (or (<= (+ cstrncmp_~s1.offset 2) (select |#length| cstrncmp_~s1.base)) (not (= (select (select |#memory_int| cstrncmp_~s2.base) 1) |cstrncmp_#t~mem4|))) (<= cstrncmp_~s2.offset 1) (<= 1 cstrncmp_~s2.offset)), 7311#(and (= cstrncmp_~s1.offset 1) (or (<= (+ cstrncmp_~s1.offset 2) (select |#length| cstrncmp_~s1.base)) (not (= (select (select |#memory_int| |cstrncmp_#t~post3.base|) |cstrncmp_#t~post3.offset|) |cstrncmp_#t~mem4|))) (= 1 |cstrncmp_#t~post3.offset|)), 7312#(and (= cstrncmp_~s1.offset 1) (or (not (= |cstrncmp_#t~mem5| |cstrncmp_#t~mem4|)) (<= (+ cstrncmp_~s1.offset 2) (select |#length| cstrncmp_~s1.base)))), 7313#(and (<= (+ |cstrncmp_#t~post9.offset| 1) cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base))), 7314#(and (<= 1 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base))), 7291#true, 7292#false, 7293#(and (= 0 |main_#t~malloc20.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc20.base|)) (= (select |#valid| |main_#t~malloc20.base|) 1)), 7294#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 7295#(and (= 0 |main_#t~malloc21.offset|) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (or (not (= main_~nondetString1~0.base |main_#t~malloc21.base|)) (not (= 2 (+ main_~nondetString1~0.offset main_~length1~0)))) (= main_~nondetString1~0.offset 0))] [2018-02-02 09:50:55,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:50:55,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 09:50:55,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 09:50:55,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=504, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:50:55,256 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 24 states. [2018-02-02 09:50:56,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:56,160 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2018-02-02 09:50:56,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 09:50:56,161 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2018-02-02 09:50:56,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:56,161 INFO L225 Difference]: With dead ends: 134 [2018-02-02 09:50:56,161 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 09:50:56,162 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=147, Invalid=1493, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 09:50:56,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 09:50:56,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 113. [2018-02-02 09:50:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 09:50:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2018-02-02 09:50:56,165 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 56 [2018-02-02 09:50:56,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:56,166 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2018-02-02 09:50:56,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 09:50:56,166 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2018-02-02 09:50:56,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 09:50:56,166 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:56,167 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:56,167 INFO L371 AbstractCegarLoop]: === Iteration 32 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:56,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1759348222, now seen corresponding path program 1 times [2018-02-02 09:50:56,167 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:56,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:56,323 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:56,323 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:56,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 09:50:56,324 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:56,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:56,324 INFO L182 omatonBuilderFactory]: Interpolants [7596#true, 7597#false, 7598#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 7599#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 7600#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 7601#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 7602#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 7603#(<= (+ |cstrlen_#in~str.offset| 3) (select |#length| |cstrlen_#in~str.base|)), 7604#(<= (+ cstrstr_~find.offset 3) (select |#length| cstrstr_~find.base)), 7605#(<= (+ |cstrncmp_#in~s2.offset| 3) (select |#length| |cstrncmp_#in~s2.base|)), 7606#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 7607#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 7608#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 7609#(and (<= (+ |cstrncmp_#t~post3.offset| 2) (select |#length| |cstrncmp_#t~post3.base|)) (<= 1 |cstrncmp_#t~post3.offset|))] [2018-02-02 09:50:56,324 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:56,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:50:56,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:50:56,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:50:56,325 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 14 states. [2018-02-02 09:50:56,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:56,516 INFO L93 Difference]: Finished difference Result 141 states and 163 transitions. [2018-02-02 09:50:56,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:50:56,516 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-02-02 09:50:56,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:56,517 INFO L225 Difference]: With dead ends: 141 [2018-02-02 09:50:56,517 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 09:50:56,517 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:50:56,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 09:50:56,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2018-02-02 09:50:56,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 09:50:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2018-02-02 09:50:56,520 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 58 [2018-02-02 09:50:56,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:56,520 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2018-02-02 09:50:56,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:50:56,520 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2018-02-02 09:50:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 09:50:56,520 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:56,520 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:56,521 INFO L371 AbstractCegarLoop]: === Iteration 33 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:56,521 INFO L82 PathProgramCache]: Analyzing trace with hash 189332755, now seen corresponding path program 1 times [2018-02-02 09:50:56,521 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:56,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:56,850 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 09:50:56,850 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:56,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 09:50:56,851 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:56,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:56,851 INFO L182 omatonBuilderFactory]: Interpolants [7904#(and (<= 1 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base))), 7889#true, 7890#false, 7891#(and (= 0 |main_#t~malloc20.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc20.base|)) (= (select |#valid| |main_#t~malloc20.base|) 1)), 7892#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 7893#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base |main_#t~malloc21.base|)) (= main_~nondetString1~0.offset 0)), 7894#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 7895#(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)), 7896#(= 0 (select (select |#memory_int| |cstrstr_#in~s.base|) (+ (select |#length| |cstrstr_#in~s.base|) (- 1)))), 7897#(= 0 (select (select |#memory_int| cstrstr_~s.base) (+ (select |#length| cstrstr_~s.base) (- 1)))), 7898#(and (= 0 (select (select |#memory_int| |cstrstr_#t~post15.base|) (+ (select |#length| |cstrstr_#t~post15.base|) (- 1)))) (= |cstrstr_#t~post15.base| cstrstr_~s.base)), 7899#(= 0 (select (select |#memory_int| |cstrncmp_#in~s1.base|) (+ (select |#length| |cstrncmp_#in~s1.base|) (- 1)))), 7900#(= 0 (select (select |#memory_int| cstrncmp_~s1.base) (+ (select |#length| cstrncmp_~s1.base) (- 1)))), 7901#(and (or (<= (+ cstrncmp_~s1.offset 2) (select |#length| cstrncmp_~s1.base)) (= 0 (select (select |#memory_int| cstrncmp_~s1.base) (+ (+ cstrncmp_~s1.offset 1) (- 1))))) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base))), 7902#(or (and (<= (+ |cstrncmp_#t~post9.offset| 1) cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| |cstrncmp_#t~post9.base|)) (= (select |#length| |cstrncmp_#t~post9.base|) (select |#length| cstrncmp_~s1.base))) (= 0 (select (select |#memory_int| |cstrncmp_#t~post9.base|) |cstrncmp_#t~post9.offset|))), 7903#(or (= |cstrncmp_#t~mem10| 0) (and (<= 1 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base))))] [2018-02-02 09:50:56,851 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 09:50:56,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:50:56,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:50:56,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:50:56,852 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand 16 states. [2018-02-02 09:50:57,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:57,206 INFO L93 Difference]: Finished difference Result 134 states and 153 transitions. [2018-02-02 09:50:57,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:50:57,206 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2018-02-02 09:50:57,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:57,207 INFO L225 Difference]: With dead ends: 134 [2018-02-02 09:50:57,207 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 09:50:57,207 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2018-02-02 09:50:57,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 09:50:57,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 81. [2018-02-02 09:50:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 09:50:57,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2018-02-02 09:50:57,210 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 61 [2018-02-02 09:50:57,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:57,210 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2018-02-02 09:50:57,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:50:57,210 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-02-02 09:50:57,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 09:50:57,211 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:57,211 INFO L351 BasicCegarLoop]: trace histogram [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, 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-02 09:50:57,211 INFO L371 AbstractCegarLoop]: === Iteration 34 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:57,211 INFO L82 PathProgramCache]: Analyzing trace with hash 311750336, now seen corresponding path program 1 times [2018-02-02 09:50:57,212 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:57,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:57,420 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:57,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 09:50:57,421 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:57,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:57,421 INFO L182 omatonBuilderFactory]: Interpolants [8142#true, 8143#false, 8144#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 8145#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 8146#(= 0 main_~nondetString2~0.offset), 8147#(= 0 |cstrstr_#in~find.offset|), 8148#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0)), 8149#(<= 1 cstrstr_~find.offset), 8150#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 8151#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 8152#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 8153#(<= (+ |cstrlen_#in~str.offset| 3) (select |#length| |cstrlen_#in~str.base|)), 8154#(and (<= (+ cstrstr_~find.offset 3) (select |#length| cstrstr_~find.base)) (<= 1 cstrstr_~find.offset)), 8155#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= (+ |cstrncmp_#in~s2.offset| 3) (select |#length| |cstrncmp_#in~s2.base|))), 8156#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 8157#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 2 cstrncmp_~s2.offset)), 8158#(and (<= 3 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 8159#(and (<= (+ |cstrncmp_#t~pre6.offset| 2) (select |#length| |cstrncmp_#t~pre6.base|)) (<= 2 |cstrncmp_#t~pre6.offset|))] [2018-02-02 09:50:57,421 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:57,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:50:57,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:50:57,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:50:57,421 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 18 states. [2018-02-02 09:50:57,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:57,742 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2018-02-02 09:50:57,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:50:57,742 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 62 [2018-02-02 09:50:57,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:57,742 INFO L225 Difference]: With dead ends: 105 [2018-02-02 09:50:57,743 INFO L226 Difference]: Without dead ends: 105 [2018-02-02 09:50:57,743 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2018-02-02 09:50:57,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-02 09:50:57,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 82. [2018-02-02 09:50:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 09:50:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-02-02 09:50:57,744 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 62 [2018-02-02 09:50:57,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:57,745 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-02-02 09:50:57,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:50:57,745 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-02-02 09:50:57,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 09:50:57,745 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:57,745 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:57,745 INFO L371 AbstractCegarLoop]: === Iteration 35 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:57,745 INFO L82 PathProgramCache]: Analyzing trace with hash 2045968775, now seen corresponding path program 2 times [2018-02-02 09:50:57,746 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:57,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:57,905 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:57,905 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:57,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 09:50:57,905 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:57,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:57,906 INFO L182 omatonBuilderFactory]: Interpolants [8365#true, 8366#false, 8367#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 8368#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 8369#(= 0 main_~nondetString2~0.offset), 8370#(= 0 |cstrstr_#in~find.offset|), 8371#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0)), 8372#(<= 1 cstrstr_~find.offset), 8373#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 8374#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 8375#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 8376#(<= (+ |cstrlen_#in~str.offset| 3) (select |#length| |cstrlen_#in~str.base|)), 8377#(and (<= (+ cstrstr_~find.offset 3) (select |#length| cstrstr_~find.base)) (<= 1 cstrstr_~find.offset)), 8378#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= (+ |cstrncmp_#in~s2.offset| 3) (select |#length| |cstrncmp_#in~s2.base|))), 8379#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 8380#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 2 cstrncmp_~s2.offset)), 8381#(and (<= 3 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 8382#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 3 |cstrncmp_#t~post3.offset|))] [2018-02-02 09:50:57,906 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:57,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:50:57,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:50:57,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:50:57,907 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 18 states. [2018-02-02 09:50:58,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:58,163 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2018-02-02 09:50:58,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:50:58,164 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2018-02-02 09:50:58,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:58,164 INFO L225 Difference]: With dead ends: 107 [2018-02-02 09:50:58,164 INFO L226 Difference]: Without dead ends: 107 [2018-02-02 09:50:58,164 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2018-02-02 09:50:58,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-02 09:50:58,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 90. [2018-02-02 09:50:58,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-02 09:50:58,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2018-02-02 09:50:58,166 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 67 [2018-02-02 09:50:58,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:58,166 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2018-02-02 09:50:58,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:50:58,166 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2018-02-02 09:50:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 09:50:58,166 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:58,166 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:58,166 INFO L371 AbstractCegarLoop]: === Iteration 36 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:58,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1577024969, now seen corresponding path program 2 times [2018-02-02 09:50:58,167 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:58,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:58,416 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:58,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:58,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 09:50:58,417 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:58,417 INFO L182 omatonBuilderFactory]: Interpolants [8608#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 8609#(<= (+ |cstrlen_#in~str.offset| 3) (select |#length| |cstrlen_#in~str.base|)), 8610#(and (<= (+ cstrstr_~find.offset 3) (select |#length| cstrstr_~find.base)) (<= 1 cstrstr_~find.offset)), 8611#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= (+ |cstrncmp_#in~s2.offset| 3) (select |#length| |cstrncmp_#in~s2.base|))), 8612#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 8613#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 2 cstrncmp_~s2.offset)), 8614#(and (<= 3 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 8615#(and (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 8616#(and (<= 3 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|))), 8598#true, 8599#false, 8600#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 8601#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 8602#(= 0 main_~nondetString2~0.offset), 8603#(= 0 |cstrstr_#in~find.offset|), 8604#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0)), 8605#(<= 1 cstrstr_~find.offset), 8606#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 8607#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset))] [2018-02-02 09:50:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:58,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 09:50:58,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 09:50:58,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:50:58,418 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 19 states. [2018-02-02 09:50:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:58,773 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2018-02-02 09:50:58,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 09:50:58,774 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 71 [2018-02-02 09:50:58,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:58,775 INFO L225 Difference]: With dead ends: 121 [2018-02-02 09:50:58,775 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 09:50:58,775 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2018-02-02 09:50:58,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 09:50:58,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 91. [2018-02-02 09:50:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-02 09:50:58,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2018-02-02 09:50:58,787 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 71 [2018-02-02 09:50:58,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:58,787 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2018-02-02 09:50:58,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 09:50:58,787 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2018-02-02 09:50:58,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 09:50:58,788 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:58,788 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:58,788 INFO L371 AbstractCegarLoop]: === Iteration 37 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:58,788 INFO L82 PathProgramCache]: Analyzing trace with hash -718966754, now seen corresponding path program 3 times [2018-02-02 09:50:58,788 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:58,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:50:58,921 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:58,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 09:50:58,922 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:58,922 INFO L182 omatonBuilderFactory]: Interpolants [8849#true, 8850#false, 8851#(= cstrlen_~s~0.offset cstrlen_~str.offset), 8852#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 8853#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 8854#(and (<= |cstrlen_#res| 2) (<= 2 |cstrlen_#res|)), 8855#(and (<= 2 |cstrstr_#t~ret13|) (<= |cstrstr_#t~ret13| 2)), 8856#(and (<= 2 cstrstr_~len~0) (<= cstrstr_~len~0 2)), 8857#(and (<= 2 |cstrncmp_#in~n|) (<= |cstrncmp_#in~n| 2)), 8858#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 8859#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 8860#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|))] [2018-02-02 09:50:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:50:58,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:50:58,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:50:58,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:50:58,923 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 12 states. [2018-02-02 09:50:59,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:59,016 INFO L93 Difference]: Finished difference Result 146 states and 166 transitions. [2018-02-02 09:50:59,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:50:59,016 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2018-02-02 09:50:59,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:59,017 INFO L225 Difference]: With dead ends: 146 [2018-02-02 09:50:59,017 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 09:50:59,017 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:50:59,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 09:50:59,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-02-02 09:50:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 09:50:59,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2018-02-02 09:50:59,018 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 76 [2018-02-02 09:50:59,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:59,018 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2018-02-02 09:50:59,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:50:59,018 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2018-02-02 09:50:59,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 09:50:59,019 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:59,019 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:59,019 INFO L371 AbstractCegarLoop]: === Iteration 38 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:59,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1136154501, now seen corresponding path program 4 times [2018-02-02 09:50:59,019 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:59,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:59,216 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:59,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 09:50:59,217 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:59,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:59,217 INFO L182 omatonBuilderFactory]: Interpolants [9120#(<= (+ |cstrncmp_#in~s2.offset| 4) (select |#length| |cstrncmp_#in~s2.base|)), 9121#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 9122#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 9123#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 9124#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 9125#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 9126#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 1 |cstrncmp_#t~post3.offset|)), 9110#true, 9111#false, 9112#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 9113#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 9114#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 9115#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 9116#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 9117#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 9118#(<= (+ |cstrlen_#in~str.offset| 4) (select |#length| |cstrlen_#in~str.base|)), 9119#(<= (+ cstrstr_~find.offset 4) (select |#length| cstrstr_~find.base))] [2018-02-02 09:50:59,217 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:59,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 09:50:59,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 09:50:59,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:50:59,218 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand 17 states. [2018-02-02 09:50:59,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:59,481 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2018-02-02 09:50:59,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 09:50:59,481 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 80 [2018-02-02 09:50:59,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:59,482 INFO L225 Difference]: With dead ends: 131 [2018-02-02 09:50:59,482 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 09:50:59,482 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:50:59,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 09:50:59,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 103. [2018-02-02 09:50:59,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 09:50:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2018-02-02 09:50:59,484 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 80 [2018-02-02 09:50:59,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:59,484 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2018-02-02 09:50:59,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 09:50:59,484 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2018-02-02 09:50:59,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 09:50:59,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:59,484 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:59,484 INFO L371 AbstractCegarLoop]: === Iteration 39 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:50:59,485 INFO L82 PathProgramCache]: Analyzing trace with hash -2030073155, now seen corresponding path program 3 times [2018-02-02 09:50:59,485 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:59,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:59,717 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 8 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:59,718 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:59,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 09:50:59,718 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:59,718 INFO L182 omatonBuilderFactory]: Interpolants [9388#true, 9389#false, 9390#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 9391#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 9392#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 9393#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 9394#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 9395#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 9396#(<= (+ |cstrlen_#in~str.offset| 4) (select |#length| |cstrlen_#in~str.base|)), 9397#(<= (+ cstrstr_~find.offset 4) (select |#length| cstrstr_~find.base)), 9398#(<= (+ |cstrncmp_#in~s2.offset| 4) (select |#length| |cstrncmp_#in~s2.base|)), 9399#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 9400#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 9401#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 9402#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 9403#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 9404#(and (<= 2 cstrncmp_~s2.offset) (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base))), 9405#(and (<= 1 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)))] [2018-02-02 09:50:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 8 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:59,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:50:59,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:50:59,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:50:59,719 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand 18 states. [2018-02-02 09:51:00,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:00,088 INFO L93 Difference]: Finished difference Result 145 states and 163 transitions. [2018-02-02 09:51:00,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 09:51:00,088 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 84 [2018-02-02 09:51:00,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:00,088 INFO L225 Difference]: With dead ends: 145 [2018-02-02 09:51:00,088 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 09:51:00,089 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=962, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 09:51:00,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 09:51:00,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 104. [2018-02-02 09:51:00,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-02 09:51:00,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2018-02-02 09:51:00,091 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 84 [2018-02-02 09:51:00,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:00,091 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2018-02-02 09:51:00,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:51:00,091 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2018-02-02 09:51:00,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 09:51:00,092 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:00,092 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:00,092 INFO L371 AbstractCegarLoop]: === Iteration 40 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:00,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1722506154, now seen corresponding path program 5 times [2018-02-02 09:51:00,093 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:00,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:00,231 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 39 proven. 48 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:51:00,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:00,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 09:51:00,231 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:00,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:00,232 INFO L182 omatonBuilderFactory]: Interpolants [9696#(and (<= 3 cstrstr_~len~0) (<= cstrstr_~len~0 3)), 9697#(and (<= |cstrncmp_#in~n| 3) (<= 3 |cstrncmp_#in~n|)), 9698#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 9699#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 9700#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 9701#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|)), 9688#true, 9689#false, 9690#(= cstrlen_~s~0.offset cstrlen_~str.offset), 9691#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 9692#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 9693#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 9694#(and (<= |cstrlen_#res| 3) (<= 3 |cstrlen_#res|)), 9695#(and (<= 3 |cstrstr_#t~ret13|) (<= |cstrstr_#t~ret13| 3))] [2018-02-02 09:51:00,232 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 39 proven. 48 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:51:00,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:51:00,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:51:00,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:51:00,232 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand 14 states. [2018-02-02 09:51:00,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:00,342 INFO L93 Difference]: Finished difference Result 175 states and 201 transitions. [2018-02-02 09:51:00,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:51:00,342 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2018-02-02 09:51:00,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:00,343 INFO L225 Difference]: With dead ends: 175 [2018-02-02 09:51:00,343 INFO L226 Difference]: Without dead ends: 109 [2018-02-02 09:51:00,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:51:00,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-02 09:51:00,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-02-02 09:51:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 09:51:00,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-02-02 09:51:00,344 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 89 [2018-02-02 09:51:00,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:00,344 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-02-02 09:51:00,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:51:00,344 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-02-02 09:51:00,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 09:51:00,344 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:00,345 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:00,345 INFO L371 AbstractCegarLoop]: === Iteration 41 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:00,345 INFO L82 PathProgramCache]: Analyzing trace with hash 947282541, now seen corresponding path program 6 times [2018-02-02 09:51:00,345 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:00,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:00,593 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 18 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:00,593 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:00,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 09:51:00,593 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:00,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:00,594 INFO L182 omatonBuilderFactory]: Interpolants [9995#true, 9996#false, 9997#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 9998#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 9999#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 10000#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 10001#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 10002#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 10003#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 10004#(<= (+ |cstrlen_#in~str.offset| 5) (select |#length| |cstrlen_#in~str.base|)), 10005#(<= (+ cstrstr_~find.offset 5) (select |#length| cstrstr_~find.base)), 10006#(<= (+ |cstrncmp_#in~s2.offset| 5) (select |#length| |cstrncmp_#in~s2.base|)), 10007#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 10008#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 10009#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 10010#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 10011#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 10012#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 10013#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 2 |cstrncmp_#t~post3.offset|))] [2018-02-02 09:51:00,594 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 18 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:00,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 09:51:00,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 09:51:00,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:51:00,594 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 19 states. [2018-02-02 09:51:01,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:01,053 INFO L93 Difference]: Finished difference Result 151 states and 170 transitions. [2018-02-02 09:51:01,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 09:51:01,053 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 93 [2018-02-02 09:51:01,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:01,054 INFO L225 Difference]: With dead ends: 151 [2018-02-02 09:51:01,054 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 09:51:01,054 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 09:51:01,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 09:51:01,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 116. [2018-02-02 09:51:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 09:51:01,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2018-02-02 09:51:01,056 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 93 [2018-02-02 09:51:01,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:01,057 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2018-02-02 09:51:01,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 09:51:01,057 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2018-02-02 09:51:01,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 09:51:01,057 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:01,057 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:01,057 INFO L371 AbstractCegarLoop]: === Iteration 42 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:01,058 INFO L82 PathProgramCache]: Analyzing trace with hash 2021391279, now seen corresponding path program 4 times [2018-02-02 09:51:01,058 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:01,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:01,351 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 18 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:01,352 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:01,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 09:51:01,352 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:01,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:01,352 INFO L182 omatonBuilderFactory]: Interpolants [10312#true, 10313#false, 10314#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 10315#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 10316#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 10317#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 10318#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 10319#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 10320#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 10321#(<= (+ |cstrlen_#in~str.offset| 5) (select |#length| |cstrlen_#in~str.base|)), 10322#(<= (+ cstrstr_~find.offset 5) (select |#length| cstrstr_~find.base)), 10323#(<= (+ |cstrncmp_#in~s2.offset| 5) (select |#length| |cstrncmp_#in~s2.base|)), 10324#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 10325#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 10326#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 10327#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 10328#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 10329#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 10330#(and (<= 3 cstrncmp_~s2.offset) (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base))), 10331#(and (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)) (<= 2 |cstrncmp_#t~pre6.offset|))] [2018-02-02 09:51:01,352 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 18 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:01,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 09:51:01,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 09:51:01,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:51:01,353 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand 20 states. [2018-02-02 09:51:01,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:01,975 INFO L93 Difference]: Finished difference Result 165 states and 186 transitions. [2018-02-02 09:51:01,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 09:51:01,976 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2018-02-02 09:51:01,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:01,976 INFO L225 Difference]: With dead ends: 165 [2018-02-02 09:51:01,976 INFO L226 Difference]: Without dead ends: 165 [2018-02-02 09:51:01,977 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=1160, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 09:51:01,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-02 09:51:01,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 117. [2018-02-02 09:51:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 09:51:01,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2018-02-02 09:51:01,978 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 97 [2018-02-02 09:51:01,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:01,978 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2018-02-02 09:51:01,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 09:51:01,979 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2018-02-02 09:51:01,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 09:51:01,979 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:01,979 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:01,979 INFO L371 AbstractCegarLoop]: === Iteration 43 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:01,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1100369416, now seen corresponding path program 7 times [2018-02-02 09:51:01,980 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:01,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:02,216 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 52 proven. 90 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:51:02,216 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:02,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 09:51:02,217 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:02,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:02,217 INFO L182 omatonBuilderFactory]: Interpolants [10656#(and (<= 4 |cstrlen_#res|) (<= |cstrlen_#res| 4)), 10657#(and (<= |cstrstr_#t~ret13| 4) (<= 4 |cstrstr_#t~ret13|)), 10658#(and (<= cstrstr_~len~0 4) (<= 4 cstrstr_~len~0)), 10659#(and (<= |cstrncmp_#in~n| 4) (<= 4 |cstrncmp_#in~n|)), 10660#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 10661#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 10662#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 10663#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 10664#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|)), 10649#true, 10650#false, 10651#(= cstrlen_~s~0.offset cstrlen_~str.offset), 10652#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 10653#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 10654#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 10655#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4)))] [2018-02-02 09:51:02,217 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 52 proven. 90 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:51:02,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:51:02,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:51:02,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:51:02,218 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand 16 states. [2018-02-02 09:51:02,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:02,400 INFO L93 Difference]: Finished difference Result 204 states and 236 transitions. [2018-02-02 09:51:02,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:51:02,400 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 102 [2018-02-02 09:51:02,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:02,401 INFO L225 Difference]: With dead ends: 204 [2018-02-02 09:51:02,401 INFO L226 Difference]: Without dead ends: 122 [2018-02-02 09:51:02,401 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:51:02,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-02 09:51:02,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-02-02 09:51:02,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-02 09:51:02,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2018-02-02 09:51:02,403 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 102 [2018-02-02 09:51:02,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:02,403 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2018-02-02 09:51:02,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:51:02,403 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2018-02-02 09:51:02,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-02 09:51:02,404 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:02,404 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:02,404 INFO L371 AbstractCegarLoop]: === Iteration 44 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:02,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1389821931, now seen corresponding path program 8 times [2018-02-02 09:51:02,404 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:02,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 32 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:02,963 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:02,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 09:51:02,963 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:02,963 INFO L182 omatonBuilderFactory]: Interpolants [11008#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 11009#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 11010#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 11011#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 11012#(<= (+ |cstrlen_#in~str.offset| 6) (select |#length| |cstrlen_#in~str.base|)), 11013#(<= (+ cstrstr_~find.offset 6) (select |#length| cstrstr_~find.base)), 11014#(<= (+ |cstrncmp_#in~s2.offset| 6) (select |#length| |cstrncmp_#in~s2.base|)), 11015#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 11016#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 11017#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 11018#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 11019#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 11020#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 11021#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 11022#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 1 |cstrncmp_#t~post3.offset|)), 11002#true, 11003#false, 11004#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 11005#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 11006#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 11007#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset))] [2018-02-02 09:51:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 32 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:02,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 09:51:02,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 09:51:02,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:51:02,964 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 21 states. [2018-02-02 09:51:03,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:03,484 INFO L93 Difference]: Finished difference Result 175 states and 197 transitions. [2018-02-02 09:51:03,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 09:51:03,484 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 106 [2018-02-02 09:51:03,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:03,485 INFO L225 Difference]: With dead ends: 175 [2018-02-02 09:51:03,485 INFO L226 Difference]: Without dead ends: 175 [2018-02-02 09:51:03,485 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=252, Invalid=1308, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 09:51:03,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-02 09:51:03,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 129. [2018-02-02 09:51:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 09:51:03,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2018-02-02 09:51:03,487 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 106 [2018-02-02 09:51:03,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:03,487 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2018-02-02 09:51:03,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 09:51:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2018-02-02 09:51:03,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-02 09:51:03,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:03,488 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:03,488 INFO L371 AbstractCegarLoop]: === Iteration 45 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:03,488 INFO L82 PathProgramCache]: Analyzing trace with hash -237533865, now seen corresponding path program 5 times [2018-02-02 09:51:03,488 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:03,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 32 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:03,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:03,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 09:51:03,881 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:03,882 INFO L182 omatonBuilderFactory]: Interpolants [11366#true, 11367#false, 11368#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 11369#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 11370#(= 0 main_~nondetString2~0.offset), 11371#(= 0 |cstrstr_#in~find.offset|), 11372#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0)), 11373#(<= 1 cstrstr_~find.offset), 11374#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 11375#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 11376#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 11377#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 11378#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 11379#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 11380#(<= (+ |cstrlen_#in~str.offset| 6) (select |#length| |cstrlen_#in~str.base|)), 11381#(and (<= (+ cstrstr_~find.offset 6) (select |#length| cstrstr_~find.base)) (<= 1 cstrstr_~find.offset)), 11382#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= (+ |cstrncmp_#in~s2.offset| 6) (select |#length| |cstrncmp_#in~s2.base|))), 11383#(and (<= 1 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base))), 11384#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base))), 11385#(and (<= 3 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base))), 11386#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 11387#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 5 cstrncmp_~s2.offset)), 11388#(and (<= 6 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 11389#(and (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base)) (<= 7 cstrncmp_~s2.offset)), 11390#(and (<= 6 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)))] [2018-02-02 09:51:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 32 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:03,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 09:51:03,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 09:51:03,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:51:03,883 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 25 states. [2018-02-02 09:51:04,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:04,625 INFO L93 Difference]: Finished difference Result 181 states and 205 transitions. [2018-02-02 09:51:04,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 09:51:04,625 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 110 [2018-02-02 09:51:04,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:04,626 INFO L225 Difference]: With dead ends: 181 [2018-02-02 09:51:04,626 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 09:51:04,626 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 09:51:04,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 09:51:04,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 130. [2018-02-02 09:51:04,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 09:51:04,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2018-02-02 09:51:04,627 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 110 [2018-02-02 09:51:04,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:04,628 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2018-02-02 09:51:04,628 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 09:51:04,628 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2018-02-02 09:51:04,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-02-02 09:51:04,628 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:04,628 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:04,628 INFO L371 AbstractCegarLoop]: === Iteration 46 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:04,628 INFO L82 PathProgramCache]: Analyzing trace with hash -863375024, now seen corresponding path program 9 times [2018-02-02 09:51:04,629 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:04,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 65 proven. 145 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:51:04,859 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:04,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 09:51:04,860 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:04,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:04,860 INFO L182 omatonBuilderFactory]: Interpolants [11744#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 11745#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|)), 11728#true, 11729#false, 11730#(= cstrlen_~s~0.offset cstrlen_~str.offset), 11731#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 11732#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 11733#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 11734#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 11735#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 11736#(and (<= |cstrlen_#res| 5) (<= 5 |cstrlen_#res|)), 11737#(and (<= |cstrstr_#t~ret13| 5) (<= 5 |cstrstr_#t~ret13|)), 11738#(and (<= cstrstr_~len~0 5) (<= 5 cstrstr_~len~0)), 11739#(and (<= |cstrncmp_#in~n| 5) (<= 5 |cstrncmp_#in~n|)), 11740#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 11741#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 11742#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 11743#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2))] [2018-02-02 09:51:04,860 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 65 proven. 145 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:51:04,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:51:04,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:51:04,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:51:04,861 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand 18 states. [2018-02-02 09:51:05,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:05,160 INFO L93 Difference]: Finished difference Result 233 states and 271 transitions. [2018-02-02 09:51:05,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 09:51:05,160 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 115 [2018-02-02 09:51:05,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:05,161 INFO L225 Difference]: With dead ends: 233 [2018-02-02 09:51:05,161 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 09:51:05,161 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:51:05,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 09:51:05,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-02-02 09:51:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 09:51:05,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2018-02-02 09:51:05,164 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 115 [2018-02-02 09:51:05,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:05,164 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2018-02-02 09:51:05,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:51:05,164 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2018-02-02 09:51:05,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-02-02 09:51:05,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:05,165 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:05,165 INFO L371 AbstractCegarLoop]: === Iteration 47 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:05,165 INFO L82 PathProgramCache]: Analyzing trace with hash 901331539, now seen corresponding path program 10 times [2018-02-02 09:51:05,166 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:05,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:05,586 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 50 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:05,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:05,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 09:51:05,587 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:05,587 INFO L182 omatonBuilderFactory]: Interpolants [12127#true, 12128#false, 12129#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 12130#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 12131#(= 0 main_~nondetString2~0.offset), 12132#(= 0 |cstrstr_#in~find.offset|), 12133#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0)), 12134#(<= 1 cstrstr_~find.offset), 12135#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 12136#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 12137#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 12138#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 12139#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 12140#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 12141#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 12142#(<= (+ |cstrlen_#in~str.offset| 7) (select |#length| |cstrlen_#in~str.base|)), 12143#(and (<= (+ cstrstr_~find.offset 7) (select |#length| cstrstr_~find.base)) (<= 1 cstrstr_~find.offset)), 12144#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= (+ |cstrncmp_#in~s2.offset| 7) (select |#length| |cstrncmp_#in~s2.base|))), 12145#(and (<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 12146#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base))), 12147#(and (<= 3 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base))), 12148#(and (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 12149#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 5 cstrncmp_~s2.offset)), 12150#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 6 cstrncmp_~s2.offset)), 12151#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 7 cstrncmp_~s2.offset)), 12152#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 7 |cstrncmp_#t~post3.offset|))] [2018-02-02 09:51:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 50 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:05,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 09:51:05,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 09:51:05,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2018-02-02 09:51:05,588 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand 26 states. [2018-02-02 09:51:06,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:06,226 INFO L93 Difference]: Finished difference Result 187 states and 212 transitions. [2018-02-02 09:51:06,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 09:51:06,226 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 119 [2018-02-02 09:51:06,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:06,227 INFO L225 Difference]: With dead ends: 187 [2018-02-02 09:51:06,227 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 09:51:06,228 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=1353, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 09:51:06,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 09:51:06,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 142. [2018-02-02 09:51:06,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 09:51:06,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2018-02-02 09:51:06,230 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 166 transitions. Word has length 119 [2018-02-02 09:51:06,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:06,231 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 166 transitions. [2018-02-02 09:51:06,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 09:51:06,231 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 166 transitions. [2018-02-02 09:51:06,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-02-02 09:51:06,232 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:06,232 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:06,232 INFO L371 AbstractCegarLoop]: === Iteration 48 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:06,232 INFO L82 PathProgramCache]: Analyzing trace with hash -417042283, now seen corresponding path program 6 times [2018-02-02 09:51:06,232 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:06,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:06,595 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 50 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:06,596 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:06,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 09:51:06,596 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:06,596 INFO L182 omatonBuilderFactory]: Interpolants [12508#true, 12509#false, 12510#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 12511#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 12512#(= 0 main_~nondetString2~0.offset), 12513#(= 0 |cstrstr_#in~find.offset|), 12514#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0)), 12515#(<= 1 cstrstr_~find.offset), 12516#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 12517#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 12518#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 12519#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 12520#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 12521#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 12522#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 12523#(<= (+ |cstrlen_#in~str.offset| 7) (select |#length| |cstrlen_#in~str.base|)), 12524#(and (<= (+ cstrstr_~find.offset 7) (select |#length| cstrstr_~find.base)) (<= 1 cstrstr_~find.offset)), 12525#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= (+ |cstrncmp_#in~s2.offset| 7) (select |#length| |cstrncmp_#in~s2.base|))), 12526#(and (<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 12527#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base))), 12528#(and (<= 3 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base))), 12529#(and (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 12530#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 5 cstrncmp_~s2.offset)), 12531#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 6 cstrncmp_~s2.offset)), 12532#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 7 cstrncmp_~s2.offset)), 12533#(and (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base)) (<= 8 cstrncmp_~s2.offset)), 12534#(and (<= 7 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)))] [2018-02-02 09:51:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 50 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:06,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 09:51:06,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 09:51:06,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2018-02-02 09:51:06,597 INFO L87 Difference]: Start difference. First operand 142 states and 166 transitions. Second operand 27 states. [2018-02-02 09:51:07,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:07,366 INFO L93 Difference]: Finished difference Result 201 states and 228 transitions. [2018-02-02 09:51:07,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 09:51:07,366 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 123 [2018-02-02 09:51:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:07,367 INFO L225 Difference]: With dead ends: 201 [2018-02-02 09:51:07,367 INFO L226 Difference]: Without dead ends: 201 [2018-02-02 09:51:07,368 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=1503, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 09:51:07,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-02 09:51:07,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 143. [2018-02-02 09:51:07,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 09:51:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 168 transitions. [2018-02-02 09:51:07,370 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 168 transitions. Word has length 123 [2018-02-02 09:51:07,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:07,370 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 168 transitions. [2018-02-02 09:51:07,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 09:51:07,371 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 168 transitions. [2018-02-02 09:51:07,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-02-02 09:51:07,371 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:07,371 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:07,371 INFO L371 AbstractCegarLoop]: === Iteration 49 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:07,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1285268270, now seen corresponding path program 11 times [2018-02-02 09:51:07,372 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:07,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 78 proven. 213 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:51:07,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:07,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 09:51:07,634 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:07,635 INFO L182 omatonBuilderFactory]: Interpolants [12907#true, 12908#false, 12909#(= cstrlen_~s~0.offset cstrlen_~str.offset), 12910#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 12911#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 12912#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 12913#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 12914#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 12915#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 12916#(and (<= |cstrlen_#res| 6) (<= 6 |cstrlen_#res|)), 12917#(and (<= |cstrstr_#t~ret13| 6) (<= 6 |cstrstr_#t~ret13|)), 12918#(and (<= 6 cstrstr_~len~0) (<= cstrstr_~len~0 6)), 12919#(and (<= |cstrncmp_#in~n| 6) (<= 6 |cstrncmp_#in~n|)), 12920#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 12921#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 12922#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 12923#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 12924#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 12925#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 12926#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|))] [2018-02-02 09:51:07,635 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 78 proven. 213 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:51:07,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 09:51:07,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 09:51:07,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:51:07,635 INFO L87 Difference]: Start difference. First operand 143 states and 168 transitions. Second operand 20 states. [2018-02-02 09:51:07,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:07,889 INFO L93 Difference]: Finished difference Result 262 states and 306 transitions. [2018-02-02 09:51:07,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 09:51:07,890 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 128 [2018-02-02 09:51:07,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:07,890 INFO L225 Difference]: With dead ends: 262 [2018-02-02 09:51:07,890 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 09:51:07,891 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-02-02 09:51:07,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 09:51:07,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-02-02 09:51:07,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 09:51:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2018-02-02 09:51:07,893 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 128 [2018-02-02 09:51:07,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:07,893 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2018-02-02 09:51:07,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 09:51:07,893 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2018-02-02 09:51:07,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-02 09:51:07,894 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:07,894 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:07,894 INFO L371 AbstractCegarLoop]: === Iteration 50 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:07,895 INFO L82 PathProgramCache]: Analyzing trace with hash -760409937, now seen corresponding path program 12 times [2018-02-02 09:51:07,895 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:07,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:08,299 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 72 proven. 250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:08,300 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:08,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 09:51:08,300 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:08,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:08,300 INFO L182 omatonBuilderFactory]: Interpolants [13376#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 1 |cstrncmp_#t~post3.offset|)), 13352#true, 13353#false, 13354#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 13355#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 13356#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 13357#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 13358#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 13359#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 13360#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 13361#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 13362#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 13363#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 13364#(<= (+ |cstrlen_#in~str.offset| 8) (select |#length| |cstrlen_#in~str.base|)), 13365#(<= (+ cstrstr_~find.offset 8) (select |#length| cstrstr_~find.base)), 13366#(<= (+ |cstrncmp_#in~s2.offset| 8) (select |#length| |cstrncmp_#in~s2.base|)), 13367#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 13368#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 13369#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 13370#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 13371#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 13372#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 13373#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 13374#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 13375#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset))] [2018-02-02 09:51:08,300 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 72 proven. 250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:08,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 09:51:08,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 09:51:08,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:51:08,301 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand 25 states. [2018-02-02 09:51:08,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:08,855 INFO L93 Difference]: Finished difference Result 219 states and 247 transitions. [2018-02-02 09:51:08,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 09:51:08,856 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 132 [2018-02-02 09:51:08,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:08,856 INFO L225 Difference]: With dead ends: 219 [2018-02-02 09:51:08,856 INFO L226 Difference]: Without dead ends: 219 [2018-02-02 09:51:08,857 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=417, Invalid=2033, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 09:51:08,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-02 09:51:08,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 155. [2018-02-02 09:51:08,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 09:51:08,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 182 transitions. [2018-02-02 09:51:08,859 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 182 transitions. Word has length 132 [2018-02-02 09:51:08,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:08,859 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 182 transitions. [2018-02-02 09:51:08,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 09:51:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2018-02-02 09:51:08,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-02-02 09:51:08,859 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:08,860 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:08,860 INFO L371 AbstractCegarLoop]: === Iteration 51 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:08,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1622296335, now seen corresponding path program 7 times [2018-02-02 09:51:08,860 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:08,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 72 proven. 257 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:09,221 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:09,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 09:51:09,222 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:09,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:09,222 INFO L182 omatonBuilderFactory]: Interpolants [13824#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 13825#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 13826#(and (<= 2 cstrncmp_~s2.offset) (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base))), 13827#(and (<= 1 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|))), 13802#true, 13803#false, 13804#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 13805#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 13806#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 13807#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 13808#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 13809#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 13810#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 13811#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 13812#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 13813#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 13814#(<= (+ |cstrlen_#in~str.offset| 8) (select |#length| |cstrlen_#in~str.base|)), 13815#(<= (+ cstrstr_~find.offset 8) (select |#length| cstrstr_~find.base)), 13816#(<= (+ |cstrncmp_#in~s2.offset| 8) (select |#length| |cstrncmp_#in~s2.base|)), 13817#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 13818#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 13819#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 13820#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 13821#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 13822#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 13823#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base))] [2018-02-02 09:51:09,222 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 72 proven. 257 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:09,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 09:51:09,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 09:51:09,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2018-02-02 09:51:09,223 INFO L87 Difference]: Start difference. First operand 155 states and 182 transitions. Second operand 26 states. [2018-02-02 09:51:09,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:09,979 INFO L93 Difference]: Finished difference Result 233 states and 263 transitions. [2018-02-02 09:51:09,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 09:51:09,979 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 136 [2018-02-02 09:51:09,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:09,980 INFO L225 Difference]: With dead ends: 233 [2018-02-02 09:51:09,980 INFO L226 Difference]: Without dead ends: 233 [2018-02-02 09:51:09,981 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=524, Invalid=2782, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 09:51:09,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-02 09:51:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 156. [2018-02-02 09:51:09,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 09:51:09,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 184 transitions. [2018-02-02 09:51:09,983 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 184 transitions. Word has length 136 [2018-02-02 09:51:09,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:09,983 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 184 transitions. [2018-02-02 09:51:09,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 09:51:09,983 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 184 transitions. [2018-02-02 09:51:09,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-02-02 09:51:09,983 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:09,983 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:09,983 INFO L371 AbstractCegarLoop]: === Iteration 52 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:09,984 INFO L82 PathProgramCache]: Analyzing trace with hash 650505718, now seen corresponding path program 13 times [2018-02-02 09:51:09,984 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:09,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 91 proven. 294 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:51:10,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:10,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 09:51:10,251 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:10,251 INFO L182 omatonBuilderFactory]: Interpolants [14282#true, 14283#false, 14284#(= cstrlen_~s~0.offset cstrlen_~str.offset), 14285#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 14286#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 14287#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 14288#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 14289#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 14290#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 14291#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 14292#(and (<= 7 |cstrlen_#res|) (<= |cstrlen_#res| 7)), 14293#(and (<= 7 |cstrstr_#t~ret13|) (<= |cstrstr_#t~ret13| 7)), 14294#(and (<= 7 cstrstr_~len~0) (<= cstrstr_~len~0 7)), 14295#(and (<= 7 |cstrncmp_#in~n|) (<= |cstrncmp_#in~n| 7)), 14296#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 14297#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 14298#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 14299#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 14300#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 14301#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 14302#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 14303#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|))] [2018-02-02 09:51:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 91 proven. 294 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:51:10,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 09:51:10,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 09:51:10,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:51:10,252 INFO L87 Difference]: Start difference. First operand 156 states and 184 transitions. Second operand 22 states. [2018-02-02 09:51:10,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:10,587 INFO L93 Difference]: Finished difference Result 291 states and 341 transitions. [2018-02-02 09:51:10,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 09:51:10,587 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 141 [2018-02-02 09:51:10,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:10,588 INFO L225 Difference]: With dead ends: 291 [2018-02-02 09:51:10,588 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 09:51:10,588 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2018-02-02 09:51:10,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 09:51:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-02-02 09:51:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 09:51:10,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 188 transitions. [2018-02-02 09:51:10,590 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 188 transitions. Word has length 141 [2018-02-02 09:51:10,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:10,590 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 188 transitions. [2018-02-02 09:51:10,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 09:51:10,591 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 188 transitions. [2018-02-02 09:51:10,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-02-02 09:51:10,591 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:10,591 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:10,591 INFO L371 AbstractCegarLoop]: === Iteration 53 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:10,592 INFO L82 PathProgramCache]: Analyzing trace with hash 753871161, now seen corresponding path program 14 times [2018-02-02 09:51:10,592 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:10,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:10,980 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 98 proven. 322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:10,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:10,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 09:51:10,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:10,981 INFO L182 omatonBuilderFactory]: Interpolants [14784#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 14785#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 14786#(<= (+ |cstrlen_#in~str.offset| 9) (select |#length| |cstrlen_#in~str.base|)), 14787#(<= (+ cstrstr_~find.offset 9) (select |#length| cstrstr_~find.base)), 14788#(<= (+ |cstrncmp_#in~s2.offset| 9) (select |#length| |cstrncmp_#in~s2.base|)), 14789#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 14790#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 14791#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 14792#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 14793#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 14794#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 14795#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 14796#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 14797#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 14798#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 14799#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 2 |cstrncmp_#t~post3.offset|)), 14773#true, 14774#false, 14775#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 14776#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 14777#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 14778#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 14779#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 14780#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 14781#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 14782#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 14783#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset))] [2018-02-02 09:51:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 98 proven. 322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:10,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 09:51:10,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 09:51:10,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2018-02-02 09:51:10,982 INFO L87 Difference]: Start difference. First operand 160 states and 188 transitions. Second operand 27 states. [2018-02-02 09:51:11,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:11,676 INFO L93 Difference]: Finished difference Result 239 states and 270 transitions. [2018-02-02 09:51:11,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 09:51:11,692 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 145 [2018-02-02 09:51:11,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:11,693 INFO L225 Difference]: With dead ends: 239 [2018-02-02 09:51:11,693 INFO L226 Difference]: Without dead ends: 239 [2018-02-02 09:51:11,693 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=450, Invalid=2412, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 09:51:11,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-02 09:51:11,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 168. [2018-02-02 09:51:11,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 09:51:11,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 198 transitions. [2018-02-02 09:51:11,696 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 198 transitions. Word has length 145 [2018-02-02 09:51:11,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:11,696 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 198 transitions. [2018-02-02 09:51:11,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 09:51:11,696 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 198 transitions. [2018-02-02 09:51:11,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-02-02 09:51:11,697 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:11,697 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:11,697 INFO L371 AbstractCegarLoop]: === Iteration 54 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:11,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1650228347, now seen corresponding path program 8 times [2018-02-02 09:51:11,698 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:11,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:12,327 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 98 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:12,327 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:12,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 09:51:12,327 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:12,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:12,328 INFO L182 omatonBuilderFactory]: Interpolants [15262#true, 15263#false, 15264#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 15265#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 15266#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 15267#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 15268#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 15269#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 15270#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 15271#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 15272#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 15273#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 15274#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 15275#(<= (+ |cstrlen_#in~str.offset| 9) (select |#length| |cstrlen_#in~str.base|)), 15276#(<= (+ cstrstr_~find.offset 9) (select |#length| cstrstr_~find.base)), 15277#(<= (+ |cstrncmp_#in~s2.offset| 9) (select |#length| |cstrncmp_#in~s2.base|)), 15278#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 15279#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 15280#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 15281#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 15282#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 15283#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 15284#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 15285#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 15286#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 15287#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 15288#(and (<= 3 cstrncmp_~s2.offset) (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base))), 15289#(and (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)) (<= 2 |cstrncmp_#t~pre6.offset|))] [2018-02-02 09:51:12,328 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 98 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:12,328 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 09:51:12,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 09:51:12,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-02-02 09:51:12,328 INFO L87 Difference]: Start difference. First operand 168 states and 198 transitions. Second operand 28 states. [2018-02-02 09:51:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:13,245 INFO L93 Difference]: Finished difference Result 253 states and 286 transitions. [2018-02-02 09:51:13,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 09:51:13,245 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 149 [2018-02-02 09:51:13,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:13,246 INFO L225 Difference]: With dead ends: 253 [2018-02-02 09:51:13,246 INFO L226 Difference]: Without dead ends: 253 [2018-02-02 09:51:13,247 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=544, Invalid=3116, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 09:51:13,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-02 09:51:13,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 169. [2018-02-02 09:51:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-02 09:51:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 200 transitions. [2018-02-02 09:51:13,250 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 200 transitions. Word has length 149 [2018-02-02 09:51:13,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:13,250 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 200 transitions. [2018-02-02 09:51:13,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 09:51:13,250 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 200 transitions. [2018-02-02 09:51:13,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-02 09:51:13,251 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:13,251 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:13,251 INFO L371 AbstractCegarLoop]: === Iteration 55 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:13,251 INFO L82 PathProgramCache]: Analyzing trace with hash -923414356, now seen corresponding path program 15 times [2018-02-02 09:51:13,252 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:13,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 104 proven. 388 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:51:13,587 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:13,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 09:51:13,588 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:13,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:13,588 INFO L182 omatonBuilderFactory]: Interpolants [15779#true, 15780#false, 15781#(= cstrlen_~s~0.offset cstrlen_~str.offset), 15782#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 15783#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 15784#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 15785#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 15786#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 15787#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 15788#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 15789#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 15790#(and (<= 8 |cstrlen_#res|) (<= |cstrlen_#res| 8)), 15791#(and (<= |cstrstr_#t~ret13| 8) (<= 8 |cstrstr_#t~ret13|)), 15792#(and (<= 8 cstrstr_~len~0) (<= cstrstr_~len~0 8)), 15793#(and (<= |cstrncmp_#in~n| 8) (<= 8 |cstrncmp_#in~n|)), 15794#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 15795#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 15796#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 15797#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 15798#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 15799#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 15800#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 15801#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 15802#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|))] [2018-02-02 09:51:13,588 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 104 proven. 388 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:51:13,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 09:51:13,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 09:51:13,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:51:13,589 INFO L87 Difference]: Start difference. First operand 169 states and 200 transitions. Second operand 24 states. [2018-02-02 09:51:14,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:14,045 INFO L93 Difference]: Finished difference Result 320 states and 376 transitions. [2018-02-02 09:51:14,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 09:51:14,045 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 154 [2018-02-02 09:51:14,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:14,046 INFO L225 Difference]: With dead ends: 320 [2018-02-02 09:51:14,046 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 09:51:14,046 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 09:51:14,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 09:51:14,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-02-02 09:51:14,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-02 09:51:14,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 204 transitions. [2018-02-02 09:51:14,048 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 204 transitions. Word has length 154 [2018-02-02 09:51:14,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:14,048 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 204 transitions. [2018-02-02 09:51:14,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 09:51:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 204 transitions. [2018-02-02 09:51:14,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-02-02 09:51:14,049 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:14,049 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:14,049 INFO L371 AbstractCegarLoop]: === Iteration 56 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:14,049 INFO L82 PathProgramCache]: Analyzing trace with hash 133184073, now seen corresponding path program 16 times [2018-02-02 09:51:14,049 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:14,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:14,555 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 128 proven. 403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:14,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:14,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 09:51:14,555 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:14,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:14,555 INFO L182 omatonBuilderFactory]: Interpolants [16320#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 16321#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 16322#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 16323#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 16324#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 16325#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 16326#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 16327#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 16328#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 16329#(and (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset) (= cstrlen_~s~0.base |cstrlen_#in~str.base|)), 16330#(<= (+ |cstrlen_#in~str.offset| 10) (select |#length| |cstrlen_#in~str.base|)), 16331#(<= (+ cstrstr_~find.offset 10) (select |#length| cstrstr_~find.base)), 16332#(<= (+ |cstrncmp_#in~s2.offset| 10) (select |#length| |cstrncmp_#in~s2.base|)), 16333#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 16334#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 16335#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 16336#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 16337#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 16338#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 16339#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 16340#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 16341#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 16342#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 16343#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 16344#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 1 |cstrncmp_#t~post3.offset|)), 16316#true, 16317#false, 16318#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 16319#(= main_~length2~0 (select |#length| main_~nondetString2~0.base))] [2018-02-02 09:51:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 128 proven. 403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:14,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 09:51:14,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 09:51:14,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2018-02-02 09:51:14,556 INFO L87 Difference]: Start difference. First operand 173 states and 204 transitions. Second operand 29 states. [2018-02-02 09:51:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:15,317 INFO L93 Difference]: Finished difference Result 263 states and 297 transitions. [2018-02-02 09:51:15,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-02 09:51:15,318 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 158 [2018-02-02 09:51:15,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:15,318 INFO L225 Difference]: With dead ends: 263 [2018-02-02 09:51:15,319 INFO L226 Difference]: Without dead ends: 263 [2018-02-02 09:51:15,319 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=626, Invalid=2914, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 09:51:15,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-02 09:51:15,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 181. [2018-02-02 09:51:15,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-02 09:51:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 214 transitions. [2018-02-02 09:51:15,321 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 214 transitions. Word has length 158 [2018-02-02 09:51:15,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:15,321 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 214 transitions. [2018-02-02 09:51:15,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 09:51:15,321 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 214 transitions. [2018-02-02 09:51:15,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-02 09:51:15,322 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:15,322 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:15,322 INFO L371 AbstractCegarLoop]: === Iteration 57 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:15,322 INFO L82 PathProgramCache]: Analyzing trace with hash -984709749, now seen corresponding path program 9 times [2018-02-02 09:51:15,322 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:15,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 128 proven. 412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:15,816 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:15,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 09:51:15,817 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:15,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:15,817 INFO L182 omatonBuilderFactory]: Interpolants [16852#true, 16853#false, 16854#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 16855#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 16856#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 16857#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 16858#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 16859#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 16860#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 16861#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 16862#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 16863#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 16864#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 16865#(and (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset) (= cstrlen_~s~0.base |cstrlen_#in~str.base|)), 16866#(<= (+ |cstrlen_#in~str.offset| 10) (select |#length| |cstrlen_#in~str.base|)), 16867#(<= (+ cstrstr_~find.offset 10) (select |#length| cstrstr_~find.base)), 16868#(<= (+ |cstrncmp_#in~s2.offset| 10) (select |#length| |cstrncmp_#in~s2.base|)), 16869#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 16870#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 16871#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 16872#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 16873#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 16874#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 16875#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 16876#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 16877#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 16878#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 2 cstrncmp_~s2.offset)), 16879#(and (<= 3 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 16880#(and (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 16881#(and (<= 3 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)))] [2018-02-02 09:51:15,817 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 128 proven. 412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:15,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 09:51:15,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 09:51:15,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:51:15,818 INFO L87 Difference]: Start difference. First operand 181 states and 214 transitions. Second operand 30 states. [2018-02-02 09:51:16,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:16,763 INFO L93 Difference]: Finished difference Result 273 states and 309 transitions. [2018-02-02 09:51:16,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-02 09:51:16,763 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 162 [2018-02-02 09:51:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:16,764 INFO L225 Difference]: With dead ends: 273 [2018-02-02 09:51:16,764 INFO L226 Difference]: Without dead ends: 273 [2018-02-02 09:51:16,764 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=563, Invalid=3469, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 09:51:16,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-02 09:51:16,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 182. [2018-02-02 09:51:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 09:51:16,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 216 transitions. [2018-02-02 09:51:16,766 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 216 transitions. Word has length 162 [2018-02-02 09:51:16,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:16,766 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 216 transitions. [2018-02-02 09:51:16,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 09:51:16,766 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2018-02-02 09:51:16,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-02-02 09:51:16,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:16,767 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:16,767 INFO L371 AbstractCegarLoop]: === Iteration 58 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:16,767 INFO L82 PathProgramCache]: Analyzing trace with hash -466685540, now seen corresponding path program 17 times [2018-02-02 09:51:16,767 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:16,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 117 proven. 495 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:51:17,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:17,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 09:51:17,112 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:17,112 INFO L182 omatonBuilderFactory]: Interpolants [17408#(= cstrlen_~s~0.offset cstrlen_~str.offset), 17409#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 17410#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 17411#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 17412#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 17413#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 17414#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 17415#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 17416#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 17417#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 17418#(and (<= |cstrlen_#res| 9) (<= 9 |cstrlen_#res|)), 17419#(and (<= |cstrstr_#t~ret13| 9) (<= 9 |cstrstr_#t~ret13|)), 17420#(and (<= cstrstr_~len~0 9) (<= 9 cstrstr_~len~0)), 17421#(and (<= 9 |cstrncmp_#in~n|) (<= |cstrncmp_#in~n| 9)), 17422#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 17423#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 17424#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 17425#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 17426#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 17427#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 17428#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 17429#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 17430#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 17431#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|)), 17406#true, 17407#false] [2018-02-02 09:51:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 117 proven. 495 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:51:17,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 09:51:17,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 09:51:17,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-02-02 09:51:17,113 INFO L87 Difference]: Start difference. First operand 182 states and 216 transitions. Second operand 26 states. [2018-02-02 09:51:17,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:17,539 INFO L93 Difference]: Finished difference Result 349 states and 411 transitions. [2018-02-02 09:51:17,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 09:51:17,539 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 167 [2018-02-02 09:51:17,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:17,540 INFO L225 Difference]: With dead ends: 349 [2018-02-02 09:51:17,540 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 09:51:17,540 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 09:51:17,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 09:51:17,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2018-02-02 09:51:17,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-02 09:51:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 220 transitions. [2018-02-02 09:51:17,542 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 220 transitions. Word has length 167 [2018-02-02 09:51:17,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:17,542 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 220 transitions. [2018-02-02 09:51:17,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 09:51:17,542 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 220 transitions. [2018-02-02 09:51:17,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-02-02 09:51:17,543 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:17,543 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:17,543 INFO L371 AbstractCegarLoop]: === Iteration 59 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:17,543 INFO L82 PathProgramCache]: Analyzing trace with hash -936653025, now seen corresponding path program 18 times [2018-02-02 09:51:17,544 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:17,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 162 proven. 493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:18,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:18,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 09:51:18,016 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:18,017 INFO L182 omatonBuilderFactory]: Interpolants [17989#true, 17990#false, 17991#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 17992#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 17993#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 17994#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 17995#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 17996#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 17997#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 17998#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 17999#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 18000#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 18001#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 18002#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 18003#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 18004#(<= (+ |cstrlen_#in~str.offset| 11) (select |#length| |cstrlen_#in~str.base|)), 18005#(<= (+ cstrstr_~find.offset 11) (select |#length| cstrstr_~find.base)), 18006#(<= (+ |cstrncmp_#in~s2.offset| 11) (select |#length| |cstrncmp_#in~s2.base|)), 18007#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 18008#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 18009#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 18010#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 18011#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 18012#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 18013#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 18014#(and (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 18015#(and (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 18016#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 2 cstrncmp_~s2.offset)), 18017#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 3 cstrncmp_~s2.offset)), 18018#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 18019#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 4 |cstrncmp_#t~post3.offset|))] [2018-02-02 09:51:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 162 proven. 493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:18,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 09:51:18,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 09:51:18,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2018-02-02 09:51:18,017 INFO L87 Difference]: Start difference. First operand 186 states and 220 transitions. Second operand 31 states. [2018-02-02 09:51:18,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:18,909 INFO L93 Difference]: Finished difference Result 279 states and 316 transitions. [2018-02-02 09:51:18,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 09:51:18,909 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 171 [2018-02-02 09:51:18,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:18,910 INFO L225 Difference]: With dead ends: 279 [2018-02-02 09:51:18,910 INFO L226 Difference]: Without dead ends: 279 [2018-02-02 09:51:18,910 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=519, Invalid=3263, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 09:51:18,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-02-02 09:51:18,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 194. [2018-02-02 09:51:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 09:51:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 230 transitions. [2018-02-02 09:51:18,913 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 230 transitions. Word has length 171 [2018-02-02 09:51:18,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:18,913 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 230 transitions. [2018-02-02 09:51:18,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 09:51:18,913 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 230 transitions. [2018-02-02 09:51:18,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-02-02 09:51:18,914 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:18,914 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:18,915 INFO L371 AbstractCegarLoop]: === Iteration 60 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:18,915 INFO L82 PathProgramCache]: Analyzing trace with hash 560447329, now seen corresponding path program 10 times [2018-02-02 09:51:18,915 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:18,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:19,400 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 162 proven. 503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:19,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:19,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 09:51:19,401 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:19,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:19,401 INFO L182 omatonBuilderFactory]: Interpolants [18560#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 18561#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 18562#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 18563#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 18564#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 18565#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 18566#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 18567#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 18568#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 18569#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 18570#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 18571#(<= (+ |cstrlen_#in~str.offset| 11) (select |#length| |cstrlen_#in~str.base|)), 18572#(<= (+ cstrstr_~find.offset 11) (select |#length| cstrstr_~find.base)), 18573#(<= (+ |cstrncmp_#in~s2.offset| 11) (select |#length| |cstrncmp_#in~s2.base|)), 18574#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 18575#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 18576#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 18577#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 18578#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 18579#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 18580#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 18581#(and (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 18582#(and (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 18583#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 2 cstrncmp_~s2.offset)), 18584#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 3 cstrncmp_~s2.offset)), 18585#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 18586#(and (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base)) (<= 5 cstrncmp_~s2.offset)), 18587#(and (<= 4 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|))), 18556#true, 18557#false, 18558#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 18559#(= main_~length2~0 (select |#length| main_~nondetString2~0.base))] [2018-02-02 09:51:19,401 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 162 proven. 503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:19,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 09:51:19,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 09:51:19,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2018-02-02 09:51:19,402 INFO L87 Difference]: Start difference. First operand 194 states and 230 transitions. Second operand 32 states. [2018-02-02 09:51:20,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:20,483 INFO L93 Difference]: Finished difference Result 293 states and 332 transitions. [2018-02-02 09:51:20,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-02 09:51:20,483 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 175 [2018-02-02 09:51:20,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:20,484 INFO L225 Difference]: With dead ends: 293 [2018-02-02 09:51:20,484 INFO L226 Difference]: Without dead ends: 293 [2018-02-02 09:51:20,485 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=581, Invalid=3841, Unknown=0, NotChecked=0, Total=4422 [2018-02-02 09:51:20,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-02 09:51:20,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 195. [2018-02-02 09:51:20,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-02 09:51:20,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 232 transitions. [2018-02-02 09:51:20,487 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 232 transitions. Word has length 175 [2018-02-02 09:51:20,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:20,487 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 232 transitions. [2018-02-02 09:51:20,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 09:51:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 232 transitions. [2018-02-02 09:51:20,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-02-02 09:51:20,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:20,488 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:20,488 INFO L371 AbstractCegarLoop]: === Iteration 61 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:20,488 INFO L82 PathProgramCache]: Analyzing trace with hash -518099578, now seen corresponding path program 19 times [2018-02-02 09:51:20,489 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:20,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:20,875 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 130 proven. 615 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:51:20,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:20,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 09:51:20,876 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:20,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:20,876 INFO L182 omatonBuilderFactory]: Interpolants [19147#true, 19148#false, 19149#(= cstrlen_~s~0.offset cstrlen_~str.offset), 19150#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 19151#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 19152#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 19153#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 19154#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 19155#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 19156#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 19157#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 19158#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 19159#(and (<= (+ cstrlen_~str.offset 10) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 10))), 19160#(and (<= |cstrlen_#res| 10) (<= 10 |cstrlen_#res|)), 19161#(and (<= 10 |cstrstr_#t~ret13|) (<= |cstrstr_#t~ret13| 10)), 19162#(and (<= cstrstr_~len~0 10) (<= 10 cstrstr_~len~0)), 19163#(and (<= |cstrncmp_#in~n| 10) (<= 10 |cstrncmp_#in~n|)), 19164#(and (<= 10 cstrncmp_~n) (<= cstrncmp_~n 10)), 19165#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 19166#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 19167#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 19168#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 19169#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 19170#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 19171#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 19172#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 19173#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 19174#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|))] [2018-02-02 09:51:20,876 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 130 proven. 615 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:51:20,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 09:51:20,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 09:51:20,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-02-02 09:51:20,876 INFO L87 Difference]: Start difference. First operand 195 states and 232 transitions. Second operand 28 states. [2018-02-02 09:51:21,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:21,385 INFO L93 Difference]: Finished difference Result 378 states and 446 transitions. [2018-02-02 09:51:21,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 09:51:21,385 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 180 [2018-02-02 09:51:21,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:21,386 INFO L225 Difference]: With dead ends: 378 [2018-02-02 09:51:21,386 INFO L226 Difference]: Without dead ends: 200 [2018-02-02 09:51:21,386 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=1459, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 09:51:21,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-02 09:51:21,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2018-02-02 09:51:21,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 09:51:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 236 transitions. [2018-02-02 09:51:21,391 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 236 transitions. Word has length 180 [2018-02-02 09:51:21,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:21,391 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 236 transitions. [2018-02-02 09:51:21,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 09:51:21,391 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 236 transitions. [2018-02-02 09:51:21,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-02-02 09:51:21,392 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:21,393 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:21,393 INFO L371 AbstractCegarLoop]: === Iteration 62 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:21,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1647238371, now seen corresponding path program 20 times [2018-02-02 09:51:21,394 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:21,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:22,015 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 200 proven. 592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:22,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:22,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 09:51:22,016 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:22,016 INFO L182 omatonBuilderFactory]: Interpolants [19776#true, 19777#false, 19778#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 19779#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 19780#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 19781#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 19782#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 19783#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 19784#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 19785#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 19786#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 19787#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 19788#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 19789#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 19790#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 19791#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 19792#(<= (+ |cstrlen_#in~str.offset| 12) (select |#length| |cstrlen_#in~str.base|)), 19793#(<= (+ cstrstr_~find.offset 12) (select |#length| cstrstr_~find.base)), 19794#(<= (+ |cstrncmp_#in~s2.offset| 12) (select |#length| |cstrncmp_#in~s2.base|)), 19795#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 19796#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 19797#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 19798#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 19799#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 19800#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 19801#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 19802#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 19803#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 19804#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 19805#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 19806#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 19807#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 19808#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 1 |cstrncmp_#t~post3.offset|))] [2018-02-02 09:51:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 200 proven. 592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:22,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 09:51:22,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 09:51:22,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=883, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 09:51:22,017 INFO L87 Difference]: Start difference. First operand 199 states and 236 transitions. Second operand 33 states. [2018-02-02 09:51:22,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:22,917 INFO L93 Difference]: Finished difference Result 307 states and 347 transitions. [2018-02-02 09:51:22,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-02 09:51:22,917 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 184 [2018-02-02 09:51:22,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:22,918 INFO L225 Difference]: With dead ends: 307 [2018-02-02 09:51:22,918 INFO L226 Difference]: Without dead ends: 307 [2018-02-02 09:51:22,919 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=879, Invalid=3951, Unknown=0, NotChecked=0, Total=4830 [2018-02-02 09:51:22,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-02-02 09:51:22,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 207. [2018-02-02 09:51:22,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-02 09:51:22,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 246 transitions. [2018-02-02 09:51:22,921 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 246 transitions. Word has length 184 [2018-02-02 09:51:22,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:22,922 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 246 transitions. [2018-02-02 09:51:22,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 09:51:22,922 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 246 transitions. [2018-02-02 09:51:22,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-02-02 09:51:22,922 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:22,922 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:22,923 INFO L371 AbstractCegarLoop]: === Iteration 63 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:22,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1008317659, now seen corresponding path program 11 times [2018-02-02 09:51:22,923 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:22,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:23,460 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 200 proven. 603 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:23,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:23,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 09:51:23,461 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:23,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:23,461 INFO L182 omatonBuilderFactory]: Interpolants [20416#(<= (+ |cstrncmp_#in~s2.offset| 12) (select |#length| |cstrncmp_#in~s2.base|)), 20417#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 20418#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 20419#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 20420#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 20421#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 20422#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 20423#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 20424#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 20425#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 20426#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 20427#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 20428#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 20429#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 20430#(and (<= 2 cstrncmp_~s2.offset) (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base))), 20431#(and (<= 1 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|))), 20398#true, 20399#false, 20400#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 20401#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 20402#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 20403#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 20404#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 20405#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 20406#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 20407#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 20408#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 20409#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 20410#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 20411#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 20412#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 20413#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 20414#(<= (+ |cstrlen_#in~str.offset| 12) (select |#length| |cstrlen_#in~str.base|)), 20415#(<= (+ cstrstr_~find.offset 12) (select |#length| cstrstr_~find.base))] [2018-02-02 09:51:23,461 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 200 proven. 603 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:23,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 09:51:23,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 09:51:23,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 09:51:23,462 INFO L87 Difference]: Start difference. First operand 207 states and 246 transitions. Second operand 34 states. [2018-02-02 09:51:24,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:24,640 INFO L93 Difference]: Finished difference Result 321 states and 363 transitions. [2018-02-02 09:51:24,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-02 09:51:24,640 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 188 [2018-02-02 09:51:24,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:24,641 INFO L225 Difference]: With dead ends: 321 [2018-02-02 09:51:24,641 INFO L226 Difference]: Without dead ends: 321 [2018-02-02 09:51:24,642 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1826 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1112, Invalid=5530, Unknown=0, NotChecked=0, Total=6642 [2018-02-02 09:51:24,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-02-02 09:51:24,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 208. [2018-02-02 09:51:24,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 09:51:24,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 248 transitions. [2018-02-02 09:51:24,646 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 248 transitions. Word has length 188 [2018-02-02 09:51:24,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:24,646 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 248 transitions. [2018-02-02 09:51:24,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 09:51:24,647 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 248 transitions. [2018-02-02 09:51:24,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-02-02 09:51:24,647 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:24,647 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:24,648 INFO L371 AbstractCegarLoop]: === Iteration 64 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:24,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1653302206, now seen corresponding path program 21 times [2018-02-02 09:51:24,648 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:24,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:25,110 INFO L134 CoverageAnalysis]: Checked inductivity of 895 backedges. 143 proven. 748 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:51:25,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:25,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 09:51:25,110 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:25,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:25,111 INFO L182 omatonBuilderFactory]: Interpolants [21058#true, 21059#false, 21060#(= cstrlen_~s~0.offset cstrlen_~str.offset), 21061#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 21062#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 21063#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 21064#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 21065#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 21066#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 21067#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 21068#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 21069#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 21070#(and (<= (+ cstrlen_~str.offset 10) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 10))), 21071#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 11)) (<= (+ cstrlen_~str.offset 11) cstrlen_~s~0.offset)), 21072#(and (<= 11 |cstrlen_#res|) (<= |cstrlen_#res| 11)), 21073#(and (<= |cstrstr_#t~ret13| 11) (<= 11 |cstrstr_#t~ret13|)), 21074#(and (<= 11 cstrstr_~len~0) (<= cstrstr_~len~0 11)), 21075#(and (<= |cstrncmp_#in~n| 11) (<= 11 |cstrncmp_#in~n|)), 21076#(and (<= cstrncmp_~n 11) (<= 11 cstrncmp_~n)), 21077#(and (<= 10 cstrncmp_~n) (<= cstrncmp_~n 10)), 21078#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 21079#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 21080#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 21081#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 21082#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 21083#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 21084#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 21085#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 21086#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 21087#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|))] [2018-02-02 09:51:25,111 INFO L134 CoverageAnalysis]: Checked inductivity of 895 backedges. 143 proven. 748 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:51:25,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 09:51:25,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 09:51:25,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:51:25,111 INFO L87 Difference]: Start difference. First operand 208 states and 248 transitions. Second operand 30 states. [2018-02-02 09:51:25,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:25,716 INFO L93 Difference]: Finished difference Result 407 states and 481 transitions. [2018-02-02 09:51:25,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 09:51:25,716 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 193 [2018-02-02 09:51:25,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:25,716 INFO L225 Difference]: With dead ends: 407 [2018-02-02 09:51:25,717 INFO L226 Difference]: Without dead ends: 213 [2018-02-02 09:51:25,717 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=1697, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 09:51:25,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-02 09:51:25,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2018-02-02 09:51:25,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-02 09:51:25,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 252 transitions. [2018-02-02 09:51:25,718 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 252 transitions. Word has length 193 [2018-02-02 09:51:25,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:25,718 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 252 transitions. [2018-02-02 09:51:25,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 09:51:25,719 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 252 transitions. [2018-02-02 09:51:25,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-02 09:51:25,719 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:25,719 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:25,719 INFO L371 AbstractCegarLoop]: === Iteration 65 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:25,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1906127867, now seen corresponding path program 22 times [2018-02-02 09:51:25,720 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:25,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:26,338 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 242 proven. 700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:26,338 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:26,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 09:51:26,338 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:26,339 INFO L182 omatonBuilderFactory]: Interpolants [21760#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 21761#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 21762#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 21763#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 21764#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 21765#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 21766#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 21767#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 2 |cstrncmp_#t~post3.offset|)), 21733#true, 21734#false, 21735#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 21736#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 21737#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 21738#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 21739#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 21740#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 21741#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 21742#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 21743#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 21744#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 21745#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 21746#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 21747#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 21748#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 21749#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 21750#(<= (+ |cstrlen_#in~str.offset| 13) (select |#length| |cstrlen_#in~str.base|)), 21751#(<= (+ cstrstr_~find.offset 13) (select |#length| cstrstr_~find.base)), 21752#(<= (+ |cstrncmp_#in~s2.offset| 13) (select |#length| |cstrncmp_#in~s2.base|)), 21753#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 21754#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 21755#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 21756#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 21757#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 21758#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 21759#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base))] [2018-02-02 09:51:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 242 proven. 700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:26,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 09:51:26,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 09:51:26,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1002, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 09:51:26,339 INFO L87 Difference]: Start difference. First operand 212 states and 252 transitions. Second operand 35 states. [2018-02-02 09:51:27,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:27,264 INFO L93 Difference]: Finished difference Result 327 states and 370 transitions. [2018-02-02 09:51:27,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-02 09:51:27,264 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 197 [2018-02-02 09:51:27,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:27,265 INFO L225 Difference]: With dead ends: 327 [2018-02-02 09:51:27,265 INFO L226 Difference]: Without dead ends: 327 [2018-02-02 09:51:27,265 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=924, Invalid=4478, Unknown=0, NotChecked=0, Total=5402 [2018-02-02 09:51:27,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-02 09:51:27,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 220. [2018-02-02 09:51:27,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-02 09:51:27,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 262 transitions. [2018-02-02 09:51:27,267 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 262 transitions. Word has length 197 [2018-02-02 09:51:27,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:27,267 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 262 transitions. [2018-02-02 09:51:27,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 09:51:27,267 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 262 transitions. [2018-02-02 09:51:27,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-02-02 09:51:27,268 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:27,268 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:27,268 INFO L371 AbstractCegarLoop]: === Iteration 66 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:27,268 INFO L82 PathProgramCache]: Analyzing trace with hash -932587193, now seen corresponding path program 12 times [2018-02-02 09:51:27,269 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:27,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:27,920 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 242 proven. 712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:27,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:27,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 09:51:27,920 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:27,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:27,920 INFO L182 omatonBuilderFactory]: Interpolants [22400#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 22401#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 22402#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 22403#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 22404#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 22405#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 22406#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 22407#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 22408#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 22409#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 22410#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 22411#(<= (+ |cstrlen_#in~str.offset| 13) (select |#length| |cstrlen_#in~str.base|)), 22412#(<= (+ cstrstr_~find.offset 13) (select |#length| cstrstr_~find.base)), 22413#(<= (+ |cstrncmp_#in~s2.offset| 13) (select |#length| |cstrncmp_#in~s2.base|)), 22414#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 22415#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 22416#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 22417#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 22418#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 22419#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 22420#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 22421#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 22422#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 22423#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 22424#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 22425#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 22426#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 22427#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 22428#(and (<= 3 cstrncmp_~s2.offset) (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base))), 22429#(and (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)) (<= 2 |cstrncmp_#t~pre6.offset|)), 22394#true, 22395#false, 22396#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 22397#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 22398#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 22399#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset))] [2018-02-02 09:51:27,921 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 242 proven. 712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:27,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 09:51:27,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 09:51:27,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1070, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 09:51:27,921 INFO L87 Difference]: Start difference. First operand 220 states and 262 transitions. Second operand 36 states. [2018-02-02 09:51:29,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:29,297 INFO L93 Difference]: Finished difference Result 341 states and 386 transitions. [2018-02-02 09:51:29,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-02 09:51:29,297 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 201 [2018-02-02 09:51:29,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:29,298 INFO L225 Difference]: With dead ends: 341 [2018-02-02 09:51:29,298 INFO L226 Difference]: Without dead ends: 341 [2018-02-02 09:51:29,299 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1971 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1140, Invalid=6000, Unknown=0, NotChecked=0, Total=7140 [2018-02-02 09:51:29,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-02 09:51:29,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 221. [2018-02-02 09:51:29,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-02 09:51:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 264 transitions. [2018-02-02 09:51:29,302 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 264 transitions. Word has length 201 [2018-02-02 09:51:29,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:29,302 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 264 transitions. [2018-02-02 09:51:29,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 09:51:29,302 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 264 transitions. [2018-02-02 09:51:29,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-02-02 09:51:29,303 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:29,303 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:29,304 INFO L371 AbstractCegarLoop]: === Iteration 67 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:29,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2097058656, now seen corresponding path program 23 times [2018-02-02 09:51:29,304 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:29,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 156 proven. 894 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:51:29,764 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:29,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 09:51:29,764 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:29,764 INFO L182 omatonBuilderFactory]: Interpolants [23104#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 11)) (<= (+ cstrlen_~str.offset 11) cstrlen_~s~0.offset)), 23105#(and (<= (+ cstrlen_~str.offset 12) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 12))), 23106#(and (<= 12 |cstrlen_#res|) (<= |cstrlen_#res| 12)), 23107#(and (<= |cstrstr_#t~ret13| 12) (<= 12 |cstrstr_#t~ret13|)), 23108#(and (<= 12 cstrstr_~len~0) (<= cstrstr_~len~0 12)), 23109#(and (<= 12 |cstrncmp_#in~n|) (<= |cstrncmp_#in~n| 12)), 23110#(and (<= 12 cstrncmp_~n) (<= cstrncmp_~n 12)), 23111#(and (<= cstrncmp_~n 11) (<= 11 cstrncmp_~n)), 23112#(and (<= 10 cstrncmp_~n) (<= cstrncmp_~n 10)), 23113#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 23114#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 23115#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 23116#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 23117#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 23118#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 23119#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 23120#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 23121#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 23122#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|)), 23091#true, 23092#false, 23093#(= cstrlen_~s~0.offset cstrlen_~str.offset), 23094#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 23095#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 23096#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 23097#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 23098#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 23099#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 23100#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 23101#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 23102#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 23103#(and (<= (+ cstrlen_~str.offset 10) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 10)))] [2018-02-02 09:51:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 156 proven. 894 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:51:29,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 09:51:29,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 09:51:29,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-02-02 09:51:29,765 INFO L87 Difference]: Start difference. First operand 221 states and 264 transitions. Second operand 32 states. [2018-02-02 09:51:30,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:30,483 INFO L93 Difference]: Finished difference Result 436 states and 516 transitions. [2018-02-02 09:51:30,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 09:51:30,483 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 206 [2018-02-02 09:51:30,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:30,483 INFO L225 Difference]: With dead ends: 436 [2018-02-02 09:51:30,483 INFO L226 Difference]: Without dead ends: 226 [2018-02-02 09:51:30,484 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=1953, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 09:51:30,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-02 09:51:30,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-02-02 09:51:30,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-02 09:51:30,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 268 transitions. [2018-02-02 09:51:30,485 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 268 transitions. Word has length 206 [2018-02-02 09:51:30,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:30,485 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 268 transitions. [2018-02-02 09:51:30,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 09:51:30,485 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 268 transitions. [2018-02-02 09:51:30,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-02-02 09:51:30,486 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:30,486 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:30,486 INFO L371 AbstractCegarLoop]: === Iteration 68 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:30,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1027254147, now seen corresponding path program 24 times [2018-02-02 09:51:30,486 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:30,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 288 proven. 817 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:31,078 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:31,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 09:51:31,079 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:31,079 INFO L182 omatonBuilderFactory]: Interpolants [23812#true, 23813#false, 23814#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 23815#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 23816#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 23817#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 23818#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 23819#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 23820#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 23821#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 23822#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 23823#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 23824#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 23825#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 23826#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 23827#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 23828#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 23829#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= cstrlen_~s~0.base |cstrlen_#in~str.base|)), 23830#(<= (+ |cstrlen_#in~str.offset| 14) (select |#length| |cstrlen_#in~str.base|)), 23831#(<= (+ cstrstr_~find.offset 14) (select |#length| cstrstr_~find.base)), 23832#(<= (+ |cstrncmp_#in~s2.offset| 14) (select |#length| |cstrncmp_#in~s2.base|)), 23833#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 23834#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 23835#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 23836#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 23837#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 23838#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 23839#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 23840#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 23841#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 23842#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 23843#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 23844#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 23845#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 23846#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 23847#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 23848#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 1 |cstrncmp_#t~post3.offset|))] [2018-02-02 09:51:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 288 proven. 817 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:31,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 09:51:31,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 09:51:31,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1105, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 09:51:31,080 INFO L87 Difference]: Start difference. First operand 225 states and 268 transitions. Second operand 37 states. [2018-02-02 09:51:32,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:32,250 INFO L93 Difference]: Finished difference Result 351 states and 397 transitions. [2018-02-02 09:51:32,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-02 09:51:32,250 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 210 [2018-02-02 09:51:32,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:32,251 INFO L225 Difference]: With dead ends: 351 [2018-02-02 09:51:32,251 INFO L226 Difference]: Without dead ends: 351 [2018-02-02 09:51:32,252 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1682 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=5144, Unknown=0, NotChecked=0, Total=6320 [2018-02-02 09:51:32,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-02-02 09:51:32,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 233. [2018-02-02 09:51:32,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-02 09:51:32,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 278 transitions. [2018-02-02 09:51:32,253 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 278 transitions. Word has length 210 [2018-02-02 09:51:32,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:32,254 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 278 transitions. [2018-02-02 09:51:32,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 09:51:32,254 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 278 transitions. [2018-02-02 09:51:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-02-02 09:51:32,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:32,254 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:32,254 INFO L371 AbstractCegarLoop]: === Iteration 69 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 09:51:32,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1220449857, now seen corresponding path program 13 times [2018-02-02 09:51:32,255 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:32,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 09:51:32,898 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 09:51:32,901 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 09:51:32,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:51:32 BoogieIcfgContainer [2018-02-02 09:51:32,901 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:51:32,902 INFO L168 Benchmark]: Toolchain (without parser) took 48015.96 ms. Allocated memory was 405.8 MB in the beginning and 1.7 GB in the end (delta: 1.3 GB). Free memory was 362.5 MB in the beginning and 461.5 MB in the end (delta: -99.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-02-02 09:51:32,903 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 405.8 MB. Free memory is still 369.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:51:32,903 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.92 ms. Allocated memory is still 405.8 MB. Free memory was 362.5 MB in the beginning and 351.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-02 09:51:32,903 INFO L168 Benchmark]: Boogie Preprocessor took 34.06 ms. Allocated memory is still 405.8 MB. Free memory was 351.8 MB in the beginning and 350.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:51:32,903 INFO L168 Benchmark]: RCFGBuilder took 258.82 ms. Allocated memory is still 405.8 MB. Free memory was 350.5 MB in the beginning and 322.6 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-02-02 09:51:32,903 INFO L168 Benchmark]: TraceAbstraction took 47557.64 ms. Allocated memory was 405.8 MB in the beginning and 1.7 GB in the end (delta: 1.3 GB). Free memory was 321.3 MB in the beginning and 461.5 MB in the end (delta: -140.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-02-02 09:51:32,905 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 405.8 MB. Free memory is still 369.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 162.92 ms. Allocated memory is still 405.8 MB. Free memory was 362.5 MB in the beginning and 351.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.06 ms. Allocated memory is still 405.8 MB. Free memory was 351.8 MB in the beginning and 350.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 258.82 ms. Allocated memory is still 405.8 MB. Free memory was 350.5 MB in the beginning and 322.6 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 47557.64 ms. Allocated memory was 405.8 MB in the beginning and 1.7 GB in the end (delta: 1.3 GB). Free memory was 321.3 MB in the beginning and 461.5 MB in the end (delta: -140.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 215 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 215 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 215 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 215 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 215 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 215 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 215 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 215 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 215 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 215 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 215 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 215 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 215 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 215 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 215 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 215 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 215 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 215 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 215 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 215 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 215 with TraceHistMax 14, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 90 locations, 21 error locations. TIMEOUT Result, 47.5s OverallTime, 69 OverallIterations, 14 TraceHistogramMax, 28.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6051 SDtfs, 12628 SDslu, 80760 SDs, 0 SdLazy, 39410 SolverSat, 1474 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2178 GetRequests, 172 SyntacticMatches, 10 SemanticMatches, 1996 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18490 ImplicationChecksByTransitivity, 23.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 3410/14844 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 68 MinimizatonAttempts, 1976 StatesRemovedByMinimization, 54 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 5966 NumberOfCodeBlocks, 5966 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 5898 ConstructedInterpolants, 0 QuantifiedInterpolants, 5379412 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 68 InterpolantComputations, 18 PerfectInterpolantSequences, 3410/14844 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-51-32-910.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-51-32-910.csv Completed graceful shutdown