java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 19:54:56,386 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 19:54:56,388 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 19:54:56,400 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 19:54:56,400 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 19:54:56,401 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 19:54:56,402 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 19:54:56,404 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 19:54:56,405 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 19:54:56,406 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 19:54:56,407 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 19:54:56,407 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 19:54:56,408 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 19:54:56,409 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 19:54:56,409 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 19:54:56,411 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 19:54:56,413 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 19:54:56,414 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 19:54:56,415 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 19:54:56,416 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 19:54:56,418 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 19:54:56,419 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 19:54:56,419 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 19:54:56,420 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 19:54:56,420 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 19:54:56,421 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 19:54:56,421 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 19:54:56,422 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 19:54:56,422 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 19:54:56,422 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 19:54:56,423 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 19:54:56,423 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 19:54:56,432 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 19:54:56,432 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 19:54:56,432 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 19:54:56,432 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 19:54:56,433 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 19:54:56,433 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 19:54:56,433 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 19:54:56,433 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 19:54:56,433 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 19:54:56,433 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 19:54:56,433 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 19:54:56,433 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 19:54:56,433 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 19:54:56,434 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 19:54:56,434 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 19:54:56,434 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 19:54:56,434 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 19:54:56,434 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 19:54:56,434 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 19:54:56,434 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 19:54:56,434 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:54:56,434 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 19:54:56,435 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 19:54:56,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 19:54:56,473 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 19:54:56,477 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 19:54:56,478 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 19:54:56,478 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 19:54:56,479 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 19:54:56,612 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 19:54:56,614 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 19:54:56,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 19:54:56,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 19:54:56,620 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 19:54:56,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:54:56" (1/1) ... [2018-02-02 19:54:56,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68407382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:54:56, skipping insertion in model container [2018-02-02 19:54:56,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:54:56" (1/1) ... [2018-02-02 19:54:56,642 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:54:56,690 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:54:56,773 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:54:56,785 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:54:56,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:54:56 WrapperNode [2018-02-02 19:54:56,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 19:54:56,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 19:54:56,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 19:54:56,792 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 19:54:56,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:54:56" (1/1) ... [2018-02-02 19:54:56,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:54:56" (1/1) ... [2018-02-02 19:54:56,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:54:56" (1/1) ... [2018-02-02 19:54:56,813 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:54:56" (1/1) ... [2018-02-02 19:54:56,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:54:56" (1/1) ... [2018-02-02 19:54:56,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:54:56" (1/1) ... [2018-02-02 19:54:56,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:54:56" (1/1) ... [2018-02-02 19:54:56,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 19:54:56,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 19:54:56,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 19:54:56,821 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 19:54:56,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:54:56" (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 19:54:56,859 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 19:54:56,859 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 19:54:56,859 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-02-02 19:54:56,859 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-02-02 19:54:56,859 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrstr [2018-02-02 19:54:56,859 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 19:54:56,859 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 19:54:56,860 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 19:54:56,860 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 19:54:56,860 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 19:54:56,860 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 19:54:56,860 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 19:54:56,860 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-02-02 19:54:56,860 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-02-02 19:54:56,860 INFO L128 BoogieDeclarations]: Found specification of procedure cstrstr [2018-02-02 19:54:56,860 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 19:54:56,860 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 19:54:56,860 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 19:54:57,145 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 19:54:57,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:54:57 BoogieIcfgContainer [2018-02-02 19:54:57,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 19:54:57,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 19:54:57,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 19:54:57,149 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 19:54:57,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 07:54:56" (1/3) ... [2018-02-02 19:54:57,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f11b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:54:57, skipping insertion in model container [2018-02-02 19:54:57,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:54:56" (2/3) ... [2018-02-02 19:54:57,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f11b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:54:57, skipping insertion in model container [2018-02-02 19:54:57,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:54:57" (3/3) ... [2018-02-02 19:54:57,153 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-02-02 19:54:57,160 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 19:54:57,165 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-02-02 19:54:57,192 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 19:54:57,192 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 19:54:57,192 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 19:54:57,192 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 19:54:57,193 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 19:54:57,193 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 19:54:57,193 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 19:54:57,193 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 19:54:57,194 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 19:54:57,206 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-02-02 19:54:57,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 19:54:57,214 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:54:57,215 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:54:57,215 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 19:54:57,219 INFO L82 PathProgramCache]: Analyzing trace with hash -718609434, now seen corresponding path program 1 times [2018-02-02 19:54:57,255 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:54:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:54:57,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:54:57,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 19:54:57,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:54:57,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:54:57,366 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:54:57,367 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 19:54:57,367 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 19:54:57,367 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 19:54:57,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:54:57,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:54:57,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:54:57,438 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2018-02-02 19:54:57,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:54:57,528 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-02-02 19:54:57,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:54:57,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 19:54:57,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:54:57,537 INFO L225 Difference]: With dead ends: 89 [2018-02-02 19:54:57,537 INFO L226 Difference]: Without dead ends: 86 [2018-02-02 19:54:57,538 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 19:54:57,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-02 19:54:57,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-02-02 19:54:57,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-02 19:54:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-02-02 19:54:57,565 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 13 [2018-02-02 19:54:57,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:54:57,565 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-02-02 19:54:57,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:54:57,565 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-02-02 19:54:57,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 19:54:57,565 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:54:57,566 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:54:57,566 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 19:54:57,566 INFO L82 PathProgramCache]: Analyzing trace with hash -718609433, now seen corresponding path program 1 times [2018-02-02 19:54:57,566 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:54:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:54:57,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:54:57,649 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 19:54:57,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:54:57,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:54:57,650 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:54:57,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:54:57,650 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 19:54:57,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:54:57,651 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:54:57,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:54:57,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:54:57,651 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 6 states. [2018-02-02 19:54:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:54:57,688 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-02-02 19:54:57,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:54:57,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-02 19:54:57,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:54:57,690 INFO L225 Difference]: With dead ends: 85 [2018-02-02 19:54:57,690 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 19:54:57,690 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 19:54:57,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 19:54:57,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-02-02 19:54:57,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-02 19:54:57,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-02-02 19:54:57,696 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 13 [2018-02-02 19:54:57,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:54:57,697 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-02-02 19:54:57,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:54:57,697 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-02-02 19:54:57,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 19:54:57,697 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:54:57,698 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:54:57,698 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 19:54:57,698 INFO L82 PathProgramCache]: Analyzing trace with hash -802055959, now seen corresponding path program 1 times [2018-02-02 19:54:57,699 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:54:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:54:57,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:54:57,730 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 19:54:57,730 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:54:57,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:54:57,731 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:54:57,731 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 19:54:57,731 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 19:54:57,731 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 19:54:57,731 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:54:57,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:54:57,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:54:57,732 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 4 states. [2018-02-02 19:54:57,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:54:57,805 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-02-02 19:54:57,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:54:57,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 19:54:57,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:54:57,806 INFO L225 Difference]: With dead ends: 84 [2018-02-02 19:54:57,806 INFO L226 Difference]: Without dead ends: 84 [2018-02-02 19:54:57,807 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 19:54:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-02 19:54:57,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-02-02 19:54:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 19:54:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-02-02 19:54:57,813 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 14 [2018-02-02 19:54:57,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:54:57,813 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-02-02 19:54:57,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:54:57,813 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-02-02 19:54:57,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 19:54:57,814 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:54:57,814 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:54:57,814 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 19:54:57,814 INFO L82 PathProgramCache]: Analyzing trace with hash -802055958, now seen corresponding path program 1 times [2018-02-02 19:54:57,814 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:54:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:54:57,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:54:57,871 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 19:54:57,872 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:54:57,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:54:57,872 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:54:57,872 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 19:54:57,872 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 19:54:57,872 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 19:54:57,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:54:57,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:54:57,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:54:57,873 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 5 states. [2018-02-02 19:54:57,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:54:57,898 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-02-02 19:54:57,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:54:57,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 19:54:57,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:54:57,899 INFO L225 Difference]: With dead ends: 83 [2018-02-02 19:54:57,899 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 19:54:57,899 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 19:54:57,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 19:54:57,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-02 19:54:57,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 19:54:57,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-02-02 19:54:57,902 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 14 [2018-02-02 19:54:57,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:54:57,902 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-02-02 19:54:57,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:54:57,902 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-02-02 19:54:57,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 19:54:57,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:54:57,902 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 19:54:57,902 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 19:54:57,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880583, now seen corresponding path program 1 times [2018-02-02 19:54:57,903 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:54:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:54:57,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:54:57,940 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 19:54:57,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:54:57,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:54:57,940 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:54:57,941 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 19:54:57,941 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 19:54:57,941 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 19:54:57,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:54:57,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:54:57,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:54:57,941 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 5 states. [2018-02-02 19:54:57,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:54:57,996 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-02-02 19:54:57,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:54:57,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 19:54:57,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:54:57,997 INFO L225 Difference]: With dead ends: 82 [2018-02-02 19:54:57,997 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 19:54:57,998 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 19:54:57,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 19:54:57,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-02 19:54:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 19:54:58,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-02-02 19:54:58,000 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 17 [2018-02-02 19:54:58,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:54:58,000 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-02-02 19:54:58,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:54:58,001 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-02-02 19:54:58,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 19:54:58,001 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:54:58,001 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 19:54:58,001 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 19:54:58,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880582, now seen corresponding path program 1 times [2018-02-02 19:54:58,002 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:54:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:54:58,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:54:58,068 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 19:54:58,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:54:58,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:54:58,069 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:54:58,069 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 19:54:58,069 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 19:54:58,069 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 19:54:58,069 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:54:58,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:54:58,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:54:58,070 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 8 states. [2018-02-02 19:54:58,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:54:58,184 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-02-02 19:54:58,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:54:58,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-02 19:54:58,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:54:58,187 INFO L225 Difference]: With dead ends: 81 [2018-02-02 19:54:58,187 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 19:54:58,187 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 19:54:58,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 19:54:58,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-02 19:54:58,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 19:54:58,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-02-02 19:54:58,196 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 17 [2018-02-02 19:54:58,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:54:58,196 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-02-02 19:54:58,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:54:58,196 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-02-02 19:54:58,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 19:54:58,197 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:54:58,197 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 19:54:58,197 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 19:54:58,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098626, now seen corresponding path program 1 times [2018-02-02 19:54:58,198 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:54:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:54:58,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:54:58,252 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 19:54:58,253 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:54:58,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:54:58,253 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:54:58,253 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 19:54:58,253 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 19:54:58,253 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 19:54:58,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:54:58,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:54:58,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:54:58,254 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 7 states. [2018-02-02 19:54:58,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:54:58,333 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-02-02 19:54:58,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:54:58,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-02 19:54:58,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:54:58,334 INFO L225 Difference]: With dead ends: 80 [2018-02-02 19:54:58,334 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 19:54:58,335 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 19:54:58,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 19:54:58,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-02 19:54:58,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 19:54:58,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-02-02 19:54:58,337 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 23 [2018-02-02 19:54:58,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:54:58,337 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-02-02 19:54:58,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:54:58,337 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-02-02 19:54:58,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 19:54:58,338 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:54:58,338 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 19:54:58,338 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 19:54:58,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098625, now seen corresponding path program 1 times [2018-02-02 19:54:58,339 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:54:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:54:58,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:54:58,433 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 19:54:58,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:54:58,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 19:54:58,433 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:54:58,433 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 19:54:58,434 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 19:54:58,434 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 19:54:58,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:54:58,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:54:58,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:54:58,434 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 10 states. [2018-02-02 19:54:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:54:58,557 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-02-02 19:54:58,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 19:54:58,557 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-02 19:54:58,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:54:58,560 INFO L225 Difference]: With dead ends: 104 [2018-02-02 19:54:58,560 INFO L226 Difference]: Without dead ends: 104 [2018-02-02 19:54:58,560 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 19:54:58,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-02 19:54:58,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2018-02-02 19:54:58,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 19:54:58,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-02-02 19:54:58,565 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 23 [2018-02-02 19:54:58,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:54:58,566 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-02-02 19:54:58,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:54:58,566 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-02-02 19:54:58,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 19:54:58,566 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:54:58,566 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 19:54:58,567 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 19:54:58,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1390800317, now seen corresponding path program 1 times [2018-02-02 19:54:58,568 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:54:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:54:58,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:54:58,744 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 19:54:58,744 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:54:58,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 19:54:58,744 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:54:58,745 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 19:54:58,745 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 19:54:58,745 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 19:54:58,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 19:54:58,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 19:54:58,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:54:58,746 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 13 states. [2018-02-02 19:54:59,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:54:59,032 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-02-02 19:54:59,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 19:54:59,032 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-02-02 19:54:59,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:54:59,033 INFO L225 Difference]: With dead ends: 104 [2018-02-02 19:54:59,033 INFO L226 Difference]: Without dead ends: 104 [2018-02-02 19:54:59,033 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 19:54:59,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-02 19:54:59,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2018-02-02 19:54:59,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 19:54:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-02-02 19:54:59,037 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 23 [2018-02-02 19:54:59,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:54:59,038 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-02-02 19:54:59,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 19:54:59,038 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-02-02 19:54:59,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 19:54:59,038 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:54:59,039 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 19:54:59,039 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 19:54:59,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1853436480, now seen corresponding path program 1 times [2018-02-02 19:54:59,040 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:54:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:54:59,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:54:59,273 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 19:54:59,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:54:59,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 19:54:59,274 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:54:59,274 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 19:54:59,274 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 19:54:59,274 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 19:54:59,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 19:54:59,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 19:54:59,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:54:59,275 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 13 states. [2018-02-02 19:54:59,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:54:59,576 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2018-02-02 19:54:59,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 19:54:59,576 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-02-02 19:54:59,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:54:59,577 INFO L225 Difference]: With dead ends: 108 [2018-02-02 19:54:59,578 INFO L226 Difference]: Without dead ends: 108 [2018-02-02 19:54:59,578 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 19:54:59,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-02 19:54:59,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2018-02-02 19:54:59,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 19:54:59,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2018-02-02 19:54:59,582 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 27 [2018-02-02 19:54:59,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:54:59,582 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2018-02-02 19:54:59,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 19:54:59,583 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-02-02 19:54:59,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 19:54:59,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:54:59,584 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 19:54:59,587 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 19:54:59,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1699013504, now seen corresponding path program 1 times [2018-02-02 19:54:59,588 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:54:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:54:59,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:54:59,653 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 19:54:59,653 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:54:59,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:54:59,653 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:54:59,654 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 19:54:59,654 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 19:54:59,654 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 19:54:59,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:54:59,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:54:59,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:54:59,654 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 6 states. [2018-02-02 19:54:59,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:54:59,784 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2018-02-02 19:54:59,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:54:59,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-02 19:54:59,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:54:59,787 INFO L225 Difference]: With dead ends: 99 [2018-02-02 19:54:59,787 INFO L226 Difference]: Without dead ends: 75 [2018-02-02 19:54:59,788 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 19:54:59,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-02 19:54:59,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-02-02 19:54:59,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 19:54:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-02-02 19:54:59,789 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 28 [2018-02-02 19:54:59,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:54:59,790 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-02-02 19:54:59,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:54:59,790 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-02-02 19:54:59,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 19:54:59,790 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:54:59,790 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:54:59,790 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 19:54:59,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1948682038, now seen corresponding path program 1 times [2018-02-02 19:54:59,791 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:54:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:54:59,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:54:59,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:54:59,829 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:54:59,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:54:59,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:54:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:54:59,830 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 19:54:59,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:54:59,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:54:59,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:54:59,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:54:59,830 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 6 states. [2018-02-02 19:54:59,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:54:59,906 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-02-02 19:54:59,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:54:59,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-02 19:54:59,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:54:59,907 INFO L225 Difference]: With dead ends: 74 [2018-02-02 19:54:59,907 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 19:54:59,907 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 19:54:59,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 19:54:59,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-02 19:54:59,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 19:54:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-02-02 19:54:59,909 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 31 [2018-02-02 19:54:59,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:54:59,909 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-02-02 19:54:59,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:54:59,910 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-02-02 19:54:59,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 19:54:59,910 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:54:59,910 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 19:54:59,910 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 19:54:59,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1948682039, now seen corresponding path program 1 times [2018-02-02 19:54:59,911 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:54:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:54:59,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:54:59,978 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 19:54:59,978 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:54:59,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 19:54:59,978 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:54:59,978 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 19:54:59,978 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 19:54:59,979 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 19:54:59,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:54:59,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:54:59,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:54:59,979 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 9 states. [2018-02-02 19:55:00,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:00,120 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2018-02-02 19:55:00,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:55:00,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-02 19:55:00,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:00,121 INFO L225 Difference]: With dead ends: 79 [2018-02-02 19:55:00,121 INFO L226 Difference]: Without dead ends: 79 [2018-02-02 19:55:00,122 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 19:55:00,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-02 19:55:00,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-02-02 19:55:00,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 19:55:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-02-02 19:55:00,124 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 31 [2018-02-02 19:55:00,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:00,124 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-02-02 19:55:00,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:55:00,125 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-02-02 19:55:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 19:55:00,125 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:00,125 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 19:55:00,125 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 19:55:00,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1308654915, now seen corresponding path program 2 times [2018-02-02 19:55:00,126 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:00,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:00,293 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 19:55:00,293 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:00,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 19:55:00,293 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:00,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 19:55:00,293 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 19:55:00,294 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 19:55:00,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 19:55:00,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 19:55:00,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:55:00,294 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 14 states. [2018-02-02 19:55:00,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:00,590 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2018-02-02 19:55:00,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 19:55:00,591 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-02-02 19:55:00,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:00,591 INFO L225 Difference]: With dead ends: 84 [2018-02-02 19:55:00,591 INFO L226 Difference]: Without dead ends: 84 [2018-02-02 19:55:00,592 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 19:55:00,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-02 19:55:00,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2018-02-02 19:55:00,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 19:55:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-02-02 19:55:00,593 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 31 [2018-02-02 19:55:00,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:00,593 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-02-02 19:55:00,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 19:55:00,593 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-02-02 19:55:00,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 19:55:00,594 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:00,594 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 19:55:00,594 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 19:55:00,594 INFO L82 PathProgramCache]: Analyzing trace with hash -211494479, now seen corresponding path program 1 times [2018-02-02 19:55:00,595 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:00,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:00,745 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 19:55:00,745 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:55:00,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 19:55:00,746 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:00,746 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 19:55:00,746 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 19:55:00,746 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 19:55:00,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 19:55:00,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 19:55:00,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 19:55:00,747 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 13 states. [2018-02-02 19:55:00,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:00,877 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-02-02 19:55:00,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 19:55:00,878 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-02-02 19:55:00,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:00,879 INFO L225 Difference]: With dead ends: 89 [2018-02-02 19:55:00,879 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 19:55:00,880 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 19:55:00,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 19:55:00,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-02 19:55:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 19:55:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-02 19:55:00,890 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 36 [2018-02-02 19:55:00,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:00,890 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-02 19:55:00,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 19:55:00,890 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-02 19:55:00,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 19:55:00,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:00,891 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 19:55:00,891 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 19:55:00,891 INFO L82 PathProgramCache]: Analyzing trace with hash -188862225, now seen corresponding path program 1 times [2018-02-02 19:55:00,892 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:00,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:01,110 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 19:55:01,111 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:01,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 19:55:01,111 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:01,111 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 19:55:01,111 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 19:55:01,111 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 19:55:01,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 19:55:01,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 19:55:01,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:55:01,112 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 15 states. [2018-02-02 19:55:01,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:01,420 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-02-02 19:55:01,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 19:55:01,421 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-02-02 19:55:01,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:01,421 INFO L225 Difference]: With dead ends: 81 [2018-02-02 19:55:01,421 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 19:55:01,422 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 19:55:01,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 19:55:01,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-02-02 19:55:01,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-02 19:55:01,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-02-02 19:55:01,424 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 36 [2018-02-02 19:55:01,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:01,424 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-02-02 19:55:01,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 19:55:01,425 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-02-02 19:55:01,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 19:55:01,426 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:01,426 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 19:55:01,426 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 19:55:01,426 INFO L82 PathProgramCache]: Analyzing trace with hash -7823713, now seen corresponding path program 1 times [2018-02-02 19:55:01,427 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:01,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:01,470 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 19:55:01,470 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:55:01,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:55:01,470 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:01,470 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 19:55:01,470 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 19:55:01,470 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 19:55:01,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:55:01,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:55:01,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:55:01,471 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 7 states. [2018-02-02 19:55:01,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:01,530 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2018-02-02 19:55:01,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:55:01,530 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-02 19:55:01,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:01,531 INFO L225 Difference]: With dead ends: 77 [2018-02-02 19:55:01,531 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 19:55:01,531 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 19:55:01,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 19:55:01,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-02 19:55:01,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 19:55:01,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-02-02 19:55:01,532 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 39 [2018-02-02 19:55:01,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:01,533 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-02-02 19:55:01,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:55:01,533 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-02-02 19:55:01,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 19:55:01,533 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:01,533 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 19:55:01,533 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 19:55:01,533 INFO L82 PathProgramCache]: Analyzing trace with hash -7823712, now seen corresponding path program 1 times [2018-02-02 19:55:01,534 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:01,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:55:01,602 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:55:01,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 19:55:01,602 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:55:01,602 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 19:55:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:55:01,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:55:01,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:55:01,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:55:01,603 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 8 states. [2018-02-02 19:55:01,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:01,638 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-02-02 19:55:01,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:55:01,638 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-02-02 19:55:01,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:01,638 INFO L225 Difference]: With dead ends: 111 [2018-02-02 19:55:01,638 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 19:55:01,639 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 19:55:01,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 19:55:01,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-02-02 19:55:01,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 19:55:01,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2018-02-02 19:55:01,642 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 39 [2018-02-02 19:55:01,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:01,642 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2018-02-02 19:55:01,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:55:01,642 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2018-02-02 19:55:01,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 19:55:01,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:01,642 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 19:55:01,642 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 19:55:01,642 INFO L82 PathProgramCache]: Analyzing trace with hash -701857031, now seen corresponding path program 2 times [2018-02-02 19:55:01,643 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:01,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:01,915 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 22 DAG size of output 18 [2018-02-02 19:55:02,203 WARN L143 SmtUtils]: Spent 107ms on a formula simplification that was a NOOP. DAG size: 16 [2018-02-02 19:55:02,349 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 19:55:02,350 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:02,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 19:55:02,350 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:02,350 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 19:55:02,350 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 19:55:02,350 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 19:55:02,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 19:55:02,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 19:55:02,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:55:02,351 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 16 states. [2018-02-02 19:55:02,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:02,810 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2018-02-02 19:55:02,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 19:55:02,810 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-02-02 19:55:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:02,811 INFO L225 Difference]: With dead ends: 131 [2018-02-02 19:55:02,811 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 19:55:02,811 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2018-02-02 19:55:02,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 19:55:02,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-02-02 19:55:02,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 19:55:02,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2018-02-02 19:55:02,814 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 41 [2018-02-02 19:55:02,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:02,814 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2018-02-02 19:55:02,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 19:55:02,814 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2018-02-02 19:55:02,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 19:55:02,815 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:02,815 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 19:55:02,815 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 19:55:02,815 INFO L82 PathProgramCache]: Analyzing trace with hash 648064035, now seen corresponding path program 1 times [2018-02-02 19:55:02,815 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:02,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:03,145 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 19:55:03,145 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:55:03,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-02 19:55:03,145 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:03,146 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 19:55:03,146 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 19:55:03,146 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 19:55:03,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 19:55:03,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 19:55:03,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:55:03,147 INFO L87 Difference]: Start difference. First operand 127 states and 144 transitions. Second operand 16 states. [2018-02-02 19:55:03,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:03,469 INFO L93 Difference]: Finished difference Result 172 states and 192 transitions. [2018-02-02 19:55:03,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 19:55:03,470 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-02-02 19:55:03,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:03,470 INFO L225 Difference]: With dead ends: 172 [2018-02-02 19:55:03,470 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 19:55:03,471 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-02-02 19:55:03,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 19:55:03,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2018-02-02 19:55:03,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 19:55:03,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 185 transitions. [2018-02-02 19:55:03,474 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 185 transitions. Word has length 43 [2018-02-02 19:55:03,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:03,475 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 185 transitions. [2018-02-02 19:55:03,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 19:55:03,475 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 185 transitions. [2018-02-02 19:55:03,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 19:55:03,475 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:03,475 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 19:55:03,476 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 19:55:03,476 INFO L82 PathProgramCache]: Analyzing trace with hash 19279971, now seen corresponding path program 1 times [2018-02-02 19:55:03,476 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:03,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:03,528 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 19:55:03,528 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:03,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 19:55:03,529 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:03,529 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 19:55:03,529 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 19:55:03,529 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 19:55:03,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:55:03,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:55:03,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:55:03,530 INFO L87 Difference]: Start difference. First operand 155 states and 185 transitions. Second operand 9 states. [2018-02-02 19:55:03,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:03,595 INFO L93 Difference]: Finished difference Result 154 states and 182 transitions. [2018-02-02 19:55:03,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:55:03,595 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-02-02 19:55:03,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:03,596 INFO L225 Difference]: With dead ends: 154 [2018-02-02 19:55:03,596 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 19:55:03,596 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 19:55:03,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 19:55:03,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-02-02 19:55:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-02 19:55:03,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 182 transitions. [2018-02-02 19:55:03,600 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 182 transitions. Word has length 45 [2018-02-02 19:55:03,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:03,600 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 182 transitions. [2018-02-02 19:55:03,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:55:03,600 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 182 transitions. [2018-02-02 19:55:03,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 19:55:03,600 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:03,600 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 19:55:03,600 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 19:55:03,601 INFO L82 PathProgramCache]: Analyzing trace with hash 19279972, now seen corresponding path program 1 times [2018-02-02 19:55:03,601 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:03,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:03,763 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 19:55:03,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:03,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 19:55:03,763 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:03,763 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 19:55:03,763 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 19:55:03,763 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 19:55:03,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 19:55:03,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 19:55:03,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:55:03,764 INFO L87 Difference]: Start difference. First operand 154 states and 182 transitions. Second operand 15 states. [2018-02-02 19:55:03,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:03,982 INFO L93 Difference]: Finished difference Result 165 states and 194 transitions. [2018-02-02 19:55:03,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 19:55:03,983 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-02 19:55:03,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:03,984 INFO L225 Difference]: With dead ends: 165 [2018-02-02 19:55:03,984 INFO L226 Difference]: Without dead ends: 165 [2018-02-02 19:55:03,984 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 19:55:03,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-02 19:55:03,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 158. [2018-02-02 19:55:03,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 19:55:03,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2018-02-02 19:55:03,989 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 45 [2018-02-02 19:55:03,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:03,989 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2018-02-02 19:55:03,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 19:55:03,990 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2018-02-02 19:55:03,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 19:55:03,990 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:03,990 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 19:55:03,990 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 19:55:03,991 INFO L82 PathProgramCache]: Analyzing trace with hash -156113105, now seen corresponding path program 3 times [2018-02-02 19:55:03,991 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:04,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:04,238 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 19:55:04,239 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:04,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 19:55:04,239 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:04,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:55:04,240 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 19:55:04,240 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 19:55:04,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 19:55:04,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 19:55:04,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:55:04,240 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand 15 states. [2018-02-02 19:55:04,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:04,715 INFO L93 Difference]: Finished difference Result 157 states and 184 transitions. [2018-02-02 19:55:04,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 19:55:04,715 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-02-02 19:55:04,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:04,716 INFO L225 Difference]: With dead ends: 157 [2018-02-02 19:55:04,716 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 19:55:04,716 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 19:55:04,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 19:55:04,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2018-02-02 19:55:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-02 19:55:04,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2018-02-02 19:55:04,718 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 46 [2018-02-02 19:55:04,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:04,718 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2018-02-02 19:55:04,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 19:55:04,718 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2018-02-02 19:55:04,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 19:55:04,718 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:04,718 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 19:55:04,718 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 19:55:04,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1348184644, now seen corresponding path program 1 times [2018-02-02 19:55:04,719 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:04,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:04,751 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 19:55:04,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:55:04,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 19:55:04,752 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:04,752 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 19:55:04,752 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 19:55:04,752 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 19:55:04,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:55:04,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:55:04,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:55:04,752 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand 8 states. [2018-02-02 19:55:04,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:04,847 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2018-02-02 19:55:04,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:55:04,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-02-02 19:55:04,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:04,848 INFO L225 Difference]: With dead ends: 100 [2018-02-02 19:55:04,848 INFO L226 Difference]: Without dead ends: 100 [2018-02-02 19:55:04,849 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 19:55:04,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-02 19:55:04,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-02-02 19:55:04,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 19:55:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2018-02-02 19:55:04,851 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 47 [2018-02-02 19:55:04,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:04,851 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2018-02-02 19:55:04,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:55:04,851 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2018-02-02 19:55:04,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 19:55:04,852 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:04,852 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 19:55:04,852 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 19:55:04,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1348184645, now seen corresponding path program 1 times [2018-02-02 19:55:04,853 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:04,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:04,890 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 19:55:04,891 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:55:04,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:55:04,891 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:04,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 19:55:04,891 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 19:55:04,891 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 19:55:04,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:55:04,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:55:04,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:55:04,892 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand 5 states. [2018-02-02 19:55:04,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:04,927 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2018-02-02 19:55:04,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:55:04,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-02-02 19:55:04,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:04,928 INFO L225 Difference]: With dead ends: 102 [2018-02-02 19:55:04,928 INFO L226 Difference]: Without dead ends: 102 [2018-02-02 19:55:04,928 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 19:55:04,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-02 19:55:04,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2018-02-02 19:55:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 19:55:04,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2018-02-02 19:55:04,932 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 47 [2018-02-02 19:55:04,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:04,932 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2018-02-02 19:55:04,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:55:04,932 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2018-02-02 19:55:04,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 19:55:04,933 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:04,933 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 19:55:04,933 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 19:55:04,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1381663923, now seen corresponding path program 1 times [2018-02-02 19:55:04,934 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:04,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:05,284 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 19:55:05,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:05,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 19:55:05,284 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:05,284 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 19:55:05,284 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 19:55:05,284 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 19:55:05,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 19:55:05,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 19:55:05,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-02-02 19:55:05,285 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 17 states. [2018-02-02 19:55:05,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:05,816 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2018-02-02 19:55:05,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 19:55:05,816 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2018-02-02 19:55:05,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:05,817 INFO L225 Difference]: With dead ends: 144 [2018-02-02 19:55:05,817 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 19:55:05,817 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2018-02-02 19:55:05,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 19:55:05,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2018-02-02 19:55:05,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 19:55:05,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 152 transitions. [2018-02-02 19:55:05,820 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 152 transitions. Word has length 48 [2018-02-02 19:55:05,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:05,820 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 152 transitions. [2018-02-02 19:55:05,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 19:55:05,821 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2018-02-02 19:55:05,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 19:55:05,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:05,821 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 19:55:05,821 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 19:55:05,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1474955739, now seen corresponding path program 1 times [2018-02-02 19:55:05,822 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:05,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:05,871 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 19:55:05,871 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:05,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 19:55:05,871 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:05,871 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 19:55:05,872 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 19:55:05,872 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 19:55:05,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:55:05,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:55:05,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:55:05,872 INFO L87 Difference]: Start difference. First operand 127 states and 152 transitions. Second operand 8 states. [2018-02-02 19:55:05,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:05,949 INFO L93 Difference]: Finished difference Result 126 states and 149 transitions. [2018-02-02 19:55:05,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:55:05,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-02-02 19:55:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:05,951 INFO L225 Difference]: With dead ends: 126 [2018-02-02 19:55:05,951 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 19:55:05,951 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 19:55:05,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 19:55:05,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-02-02 19:55:05,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 19:55:05,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 149 transitions. [2018-02-02 19:55:05,954 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 149 transitions. Word has length 49 [2018-02-02 19:55:05,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:05,955 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 149 transitions. [2018-02-02 19:55:05,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:55:05,955 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 149 transitions. [2018-02-02 19:55:05,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 19:55:05,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:05,955 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 19:55:05,956 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 19:55:05,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1474955738, now seen corresponding path program 1 times [2018-02-02 19:55:05,956 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:05,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:06,091 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 19:55:06,091 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:06,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 19:55:06,091 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:06,091 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 19:55:06,091 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 19:55:06,091 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 19:55:06,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 19:55:06,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 19:55:06,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:55:06,092 INFO L87 Difference]: Start difference. First operand 126 states and 149 transitions. Second operand 16 states. [2018-02-02 19:55:06,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:06,298 INFO L93 Difference]: Finished difference Result 180 states and 213 transitions. [2018-02-02 19:55:06,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 19:55:06,299 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-02-02 19:55:06,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:06,299 INFO L225 Difference]: With dead ends: 180 [2018-02-02 19:55:06,299 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 19:55:06,300 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 19:55:06,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 19:55:06,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 138. [2018-02-02 19:55:06,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-02 19:55:06,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 164 transitions. [2018-02-02 19:55:06,302 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 164 transitions. Word has length 49 [2018-02-02 19:55:06,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:06,302 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 164 transitions. [2018-02-02 19:55:06,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 19:55:06,302 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 164 transitions. [2018-02-02 19:55:06,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 19:55:06,303 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:06,303 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 19:55:06,303 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 19:55:06,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1071735008, now seen corresponding path program 1 times [2018-02-02 19:55:06,303 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:06,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:06,392 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 19:55:06,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:06,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 19:55:06,392 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:06,393 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 19:55:06,393 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 19:55:06,393 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 19:55:06,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:55:06,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:55:06,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:55:06,393 INFO L87 Difference]: Start difference. First operand 138 states and 164 transitions. Second operand 10 states. [2018-02-02 19:55:06,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:06,458 INFO L93 Difference]: Finished difference Result 236 states and 272 transitions. [2018-02-02 19:55:06,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:55:06,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-02-02 19:55:06,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:06,459 INFO L225 Difference]: With dead ends: 236 [2018-02-02 19:55:06,459 INFO L226 Difference]: Without dead ends: 236 [2018-02-02 19:55:06,459 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 19:55:06,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-02 19:55:06,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 225. [2018-02-02 19:55:06,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-02 19:55:06,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 262 transitions. [2018-02-02 19:55:06,462 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 262 transitions. Word has length 52 [2018-02-02 19:55:06,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:06,462 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 262 transitions. [2018-02-02 19:55:06,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:55:06,462 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 262 transitions. [2018-02-02 19:55:06,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 19:55:06,462 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:06,462 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 19:55:06,463 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 19:55:06,463 INFO L82 PathProgramCache]: Analyzing trace with hash 515999267, now seen corresponding path program 2 times [2018-02-02 19:55:06,464 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:06,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:06,675 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 19:55:06,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:06,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 19:55:06,675 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:06,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:55:06,675 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 19:55:06,675 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 19:55:06,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 19:55:06,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 19:55:06,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:55:06,676 INFO L87 Difference]: Start difference. First operand 225 states and 262 transitions. Second operand 16 states. [2018-02-02 19:55:06,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:06,927 INFO L93 Difference]: Finished difference Result 240 states and 275 transitions. [2018-02-02 19:55:06,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 19:55:06,927 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2018-02-02 19:55:06,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:06,928 INFO L225 Difference]: With dead ends: 240 [2018-02-02 19:55:06,928 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 19:55:06,928 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 19:55:06,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 19:55:06,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 74. [2018-02-02 19:55:06,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 19:55:06,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-02-02 19:55:06,930 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 53 [2018-02-02 19:55:06,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:06,930 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-02-02 19:55:06,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 19:55:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-02-02 19:55:06,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 19:55:06,930 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:06,931 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 19:55:06,931 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 19:55:06,931 INFO L82 PathProgramCache]: Analyzing trace with hash 931438653, now seen corresponding path program 2 times [2018-02-02 19:55:06,931 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:06,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:07,534 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 19:55:07,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:07,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 19:55:07,535 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:07,535 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 19:55:07,535 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 19:55:07,535 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 19:55:07,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 19:55:07,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 19:55:07,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=504, Unknown=0, NotChecked=0, Total=552 [2018-02-02 19:55:07,536 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 24 states. [2018-02-02 19:55:08,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:08,545 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2018-02-02 19:55:08,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 19:55:08,546 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2018-02-02 19:55:08,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:08,546 INFO L225 Difference]: With dead ends: 134 [2018-02-02 19:55:08,547 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 19:55:08,547 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 19:55:08,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 19:55:08,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 113. [2018-02-02 19:55:08,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 19:55:08,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2018-02-02 19:55:08,550 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 56 [2018-02-02 19:55:08,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:08,550 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2018-02-02 19:55:08,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 19:55:08,551 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2018-02-02 19:55:08,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 19:55:08,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:08,551 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 19:55:08,551 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 19:55:08,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1759348222, now seen corresponding path program 1 times [2018-02-02 19:55:08,552 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:08,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:08,689 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 19:55:08,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:08,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 19:55:08,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:08,690 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 19:55:08,690 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 19:55:08,690 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 19:55:08,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 19:55:08,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 19:55:08,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:55:08,691 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 14 states. [2018-02-02 19:55:08,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:08,914 INFO L93 Difference]: Finished difference Result 141 states and 163 transitions. [2018-02-02 19:55:08,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 19:55:08,914 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-02-02 19:55:08,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:08,915 INFO L225 Difference]: With dead ends: 141 [2018-02-02 19:55:08,915 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 19:55:08,920 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 19:55:08,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 19:55:08,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2018-02-02 19:55:08,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 19:55:08,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2018-02-02 19:55:08,923 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 58 [2018-02-02 19:55:08,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:08,923 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2018-02-02 19:55:08,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 19:55:08,923 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2018-02-02 19:55:08,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 19:55:08,924 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:08,924 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 19:55:08,924 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 19:55:08,924 INFO L82 PathProgramCache]: Analyzing trace with hash 189332755, now seen corresponding path program 1 times [2018-02-02 19:55:08,925 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:08,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:09,212 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 19:55:09,212 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:09,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 19:55:09,212 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:09,212 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 19:55:09,212 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 19:55:09,213 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 19:55:09,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 19:55:09,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 19:55:09,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:55:09,213 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand 16 states. [2018-02-02 19:55:09,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:09,519 INFO L93 Difference]: Finished difference Result 134 states and 153 transitions. [2018-02-02 19:55:09,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 19:55:09,519 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2018-02-02 19:55:09,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:09,520 INFO L225 Difference]: With dead ends: 134 [2018-02-02 19:55:09,520 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 19:55:09,520 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 19:55:09,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 19:55:09,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 81. [2018-02-02 19:55:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 19:55:09,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2018-02-02 19:55:09,522 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 61 [2018-02-02 19:55:09,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:09,522 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2018-02-02 19:55:09,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 19:55:09,522 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-02-02 19:55:09,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 19:55:09,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:09,522 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 19:55:09,522 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 19:55:09,523 INFO L82 PathProgramCache]: Analyzing trace with hash 311750336, now seen corresponding path program 1 times [2018-02-02 19:55:09,523 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:09,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:09,712 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 19:55:09,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:09,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 19:55:09,712 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:09,713 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 19:55:09,713 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 19:55:09,713 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 19:55:09,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 19:55:09,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 19:55:09,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:55:09,714 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 18 states. [2018-02-02 19:55:10,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:10,056 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2018-02-02 19:55:10,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 19:55:10,056 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 62 [2018-02-02 19:55:10,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:10,057 INFO L225 Difference]: With dead ends: 105 [2018-02-02 19:55:10,057 INFO L226 Difference]: Without dead ends: 105 [2018-02-02 19:55:10,057 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 19:55:10,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-02 19:55:10,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 82. [2018-02-02 19:55:10,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 19:55:10,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-02-02 19:55:10,059 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 62 [2018-02-02 19:55:10,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:10,060 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-02-02 19:55:10,060 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 19:55:10,060 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-02-02 19:55:10,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 19:55:10,063 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:10,063 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 19:55:10,063 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 19:55:10,063 INFO L82 PathProgramCache]: Analyzing trace with hash 2045968775, now seen corresponding path program 2 times [2018-02-02 19:55:10,064 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:10,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:10,322 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 19:55:10,323 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:10,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 19:55:10,323 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:10,323 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 19:55:10,323 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 19:55:10,324 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 19:55:10,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 19:55:10,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 19:55:10,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:55:10,324 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 18 states. [2018-02-02 19:55:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:10,583 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2018-02-02 19:55:10,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 19:55:10,583 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2018-02-02 19:55:10,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:10,584 INFO L225 Difference]: With dead ends: 107 [2018-02-02 19:55:10,584 INFO L226 Difference]: Without dead ends: 107 [2018-02-02 19:55:10,584 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2018-02-02 19:55:10,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-02 19:55:10,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 90. [2018-02-02 19:55:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-02 19:55:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2018-02-02 19:55:10,585 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 67 [2018-02-02 19:55:10,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:10,585 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2018-02-02 19:55:10,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 19:55:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2018-02-02 19:55:10,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 19:55:10,586 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:10,586 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 19:55:10,586 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 19:55:10,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1577024969, now seen corresponding path program 2 times [2018-02-02 19:55:10,587 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:10,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:10,828 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 19:55:10,828 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:10,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 19:55:10,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:10,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:55:10,829 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 19:55:10,829 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 19:55:10,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 19:55:10,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 19:55:10,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:55:10,830 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 19 states. [2018-02-02 19:55:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:11,211 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2018-02-02 19:55:11,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 19:55:11,211 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 71 [2018-02-02 19:55:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:11,211 INFO L225 Difference]: With dead ends: 121 [2018-02-02 19:55:11,212 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 19:55:11,212 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 19:55:11,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 19:55:11,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 91. [2018-02-02 19:55:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-02 19:55:11,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2018-02-02 19:55:11,214 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 71 [2018-02-02 19:55:11,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:11,214 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2018-02-02 19:55:11,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 19:55:11,215 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2018-02-02 19:55:11,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 19:55:11,215 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:11,215 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 19:55:11,215 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 19:55:11,215 INFO L82 PathProgramCache]: Analyzing trace with hash -718966754, now seen corresponding path program 3 times [2018-02-02 19:55:11,216 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:11,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:11,341 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 19:55:11,341 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:11,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 19:55:11,342 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:11,342 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 19:55:11,342 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 19:55:11,342 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 19:55:11,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 19:55:11,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 19:55:11,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:55:11,343 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 12 states. [2018-02-02 19:55:11,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:11,420 INFO L93 Difference]: Finished difference Result 146 states and 166 transitions. [2018-02-02 19:55:11,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 19:55:11,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2018-02-02 19:55:11,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:11,421 INFO L225 Difference]: With dead ends: 146 [2018-02-02 19:55:11,421 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 19:55:11,421 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:55:11,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 19:55:11,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-02-02 19:55:11,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 19:55:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2018-02-02 19:55:11,422 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 76 [2018-02-02 19:55:11,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:11,423 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2018-02-02 19:55:11,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 19:55:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2018-02-02 19:55:11,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 19:55:11,423 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:11,423 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 19:55:11,423 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 19:55:11,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1136154501, now seen corresponding path program 4 times [2018-02-02 19:55:11,424 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:11,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:11,636 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 19:55:11,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:11,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 19:55:11,637 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:11,637 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 19:55:11,637 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 19:55:11,638 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 19:55:11,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 19:55:11,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 19:55:11,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-02-02 19:55:11,638 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand 17 states. [2018-02-02 19:55:11,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:11,973 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2018-02-02 19:55:11,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 19:55:11,974 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 80 [2018-02-02 19:55:11,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:11,974 INFO L225 Difference]: With dead ends: 131 [2018-02-02 19:55:11,974 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 19:55:11,974 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2018-02-02 19:55:11,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 19:55:11,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 103. [2018-02-02 19:55:11,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 19:55:11,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2018-02-02 19:55:11,976 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 80 [2018-02-02 19:55:11,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:11,976 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2018-02-02 19:55:11,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 19:55:11,976 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2018-02-02 19:55:11,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 19:55:11,976 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:11,976 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 19:55:11,976 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 19:55:11,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2030073155, now seen corresponding path program 3 times [2018-02-02 19:55:11,977 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:11,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:12,200 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 19:55:12,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:12,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 19:55:12,200 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:12,201 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 19:55:12,201 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 19:55:12,201 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 19:55:12,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 19:55:12,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 19:55:12,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:55:12,202 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand 18 states. [2018-02-02 19:55:12,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:12,561 INFO L93 Difference]: Finished difference Result 145 states and 163 transitions. [2018-02-02 19:55:12,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 19:55:12,561 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 84 [2018-02-02 19:55:12,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:12,562 INFO L225 Difference]: With dead ends: 145 [2018-02-02 19:55:12,562 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 19:55:12,562 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=962, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 19:55:12,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 19:55:12,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 104. [2018-02-02 19:55:12,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-02 19:55:12,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2018-02-02 19:55:12,564 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 84 [2018-02-02 19:55:12,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:12,564 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2018-02-02 19:55:12,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 19:55:12,564 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2018-02-02 19:55:12,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 19:55:12,564 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:12,565 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 19:55:12,565 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 19:55:12,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1722506154, now seen corresponding path program 5 times [2018-02-02 19:55:12,565 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:12,577 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:12,751 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 19:55:12,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:12,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 19:55:12,751 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:12,752 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 19:55:12,752 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 19:55:12,752 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 19:55:12,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 19:55:12,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 19:55:12,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:55:12,753 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand 14 states. [2018-02-02 19:55:12,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:12,891 INFO L93 Difference]: Finished difference Result 175 states and 201 transitions. [2018-02-02 19:55:12,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 19:55:12,891 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2018-02-02 19:55:12,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:12,891 INFO L225 Difference]: With dead ends: 175 [2018-02-02 19:55:12,891 INFO L226 Difference]: Without dead ends: 109 [2018-02-02 19:55:12,892 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 19:55:12,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-02 19:55:12,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-02-02 19:55:12,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 19:55:12,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-02-02 19:55:12,893 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 89 [2018-02-02 19:55:12,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:12,893 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-02-02 19:55:12,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 19:55:12,894 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-02-02 19:55:12,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 19:55:12,894 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:12,894 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 19:55:12,894 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 19:55:12,894 INFO L82 PathProgramCache]: Analyzing trace with hash 947282541, now seen corresponding path program 6 times [2018-02-02 19:55:12,894 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:12,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:13,134 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 19:55:13,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:13,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 19:55:13,135 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:13,135 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 19:55:13,135 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 19:55:13,135 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 19:55:13,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 19:55:13,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 19:55:13,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:55:13,136 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 19 states. [2018-02-02 19:55:13,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:13,543 INFO L93 Difference]: Finished difference Result 151 states and 170 transitions. [2018-02-02 19:55:13,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 19:55:13,543 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 93 [2018-02-02 19:55:13,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:13,544 INFO L225 Difference]: With dead ends: 151 [2018-02-02 19:55:13,544 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 19:55:13,545 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 19:55:13,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 19:55:13,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 116. [2018-02-02 19:55:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 19:55:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2018-02-02 19:55:13,547 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 93 [2018-02-02 19:55:13,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:13,547 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2018-02-02 19:55:13,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 19:55:13,547 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2018-02-02 19:55:13,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 19:55:13,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:13,548 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 19:55:13,548 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 19:55:13,548 INFO L82 PathProgramCache]: Analyzing trace with hash 2021391279, now seen corresponding path program 4 times [2018-02-02 19:55:13,549 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:13,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:13,855 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 19:55:13,855 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:13,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 19:55:13,856 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:13,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:55:13,856 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 19:55:13,856 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 19:55:13,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 19:55:13,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 19:55:13,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-02-02 19:55:13,857 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand 20 states. [2018-02-02 19:55:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:14,527 INFO L93 Difference]: Finished difference Result 165 states and 186 transitions. [2018-02-02 19:55:14,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 19:55:14,527 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2018-02-02 19:55:14,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:14,527 INFO L225 Difference]: With dead ends: 165 [2018-02-02 19:55:14,528 INFO L226 Difference]: Without dead ends: 165 [2018-02-02 19:55:14,528 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=1160, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 19:55:14,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-02 19:55:14,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 117. [2018-02-02 19:55:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 19:55:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2018-02-02 19:55:14,529 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 97 [2018-02-02 19:55:14,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:14,530 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2018-02-02 19:55:14,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 19:55:14,530 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2018-02-02 19:55:14,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 19:55:14,530 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:14,530 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 19:55:14,530 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 19:55:14,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1100369416, now seen corresponding path program 7 times [2018-02-02 19:55:14,531 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:14,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:14,683 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 19:55:14,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:14,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 19:55:14,683 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:14,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 19:55:14,683 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 19:55:14,684 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 19:55:14,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 19:55:14,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 19:55:14,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:55:14,684 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand 16 states. [2018-02-02 19:55:14,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:14,856 INFO L93 Difference]: Finished difference Result 204 states and 236 transitions. [2018-02-02 19:55:14,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 19:55:14,857 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 102 [2018-02-02 19:55:14,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:14,858 INFO L225 Difference]: With dead ends: 204 [2018-02-02 19:55:14,858 INFO L226 Difference]: Without dead ends: 122 [2018-02-02 19:55:14,858 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-02 19:55:14,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-02 19:55:14,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-02-02 19:55:14,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-02 19:55:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2018-02-02 19:55:14,859 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 102 [2018-02-02 19:55:14,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:14,860 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2018-02-02 19:55:14,860 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 19:55:14,860 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2018-02-02 19:55:14,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-02 19:55:14,860 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:14,860 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 19:55:14,860 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 19:55:14,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1389821931, now seen corresponding path program 8 times [2018-02-02 19:55:14,861 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:14,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:15,149 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 19:55:15,149 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:15,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 19:55:15,149 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:15,149 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 19:55:15,149 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 19:55:15,150 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 19:55:15,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 19:55:15,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 19:55:15,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-02-02 19:55:15,150 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 21 states. [2018-02-02 19:55:15,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:15,586 INFO L93 Difference]: Finished difference Result 175 states and 197 transitions. [2018-02-02 19:55:15,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 19:55:15,586 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 106 [2018-02-02 19:55:15,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:15,587 INFO L225 Difference]: With dead ends: 175 [2018-02-02 19:55:15,587 INFO L226 Difference]: Without dead ends: 175 [2018-02-02 19:55:15,587 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=1308, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 19:55:15,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-02 19:55:15,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 129. [2018-02-02 19:55:15,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 19:55:15,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2018-02-02 19:55:15,589 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 106 [2018-02-02 19:55:15,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:15,589 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2018-02-02 19:55:15,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 19:55:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2018-02-02 19:55:15,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-02 19:55:15,590 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:15,590 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 19:55:15,590 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 19:55:15,590 INFO L82 PathProgramCache]: Analyzing trace with hash -237533865, now seen corresponding path program 5 times [2018-02-02 19:55:15,591 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:15,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:15,902 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 19:55:15,902 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:15,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 19:55:15,903 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:15,903 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 19:55:15,903 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 19:55:15,903 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 19:55:15,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 19:55:15,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 19:55:15,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2018-02-02 19:55:15,904 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 25 states. [2018-02-02 19:55:16,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:16,638 INFO L93 Difference]: Finished difference Result 181 states and 205 transitions. [2018-02-02 19:55:16,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 19:55:16,638 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 110 [2018-02-02 19:55:16,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:16,639 INFO L225 Difference]: With dead ends: 181 [2018-02-02 19:55:16,639 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 19:55:16,639 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 19:55:16,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 19:55:16,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 130. [2018-02-02 19:55:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 19:55:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2018-02-02 19:55:16,641 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 110 [2018-02-02 19:55:16,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:16,641 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2018-02-02 19:55:16,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 19:55:16,641 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2018-02-02 19:55:16,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-02-02 19:55:16,641 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:16,641 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 19:55:16,642 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 19:55:16,642 INFO L82 PathProgramCache]: Analyzing trace with hash -863375024, now seen corresponding path program 9 times [2018-02-02 19:55:16,642 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:16,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:16,893 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 19:55:16,893 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:16,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 19:55:16,894 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:16,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 19:55:16,894 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 19:55:16,894 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 19:55:16,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 19:55:16,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 19:55:16,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-02-02 19:55:16,895 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand 18 states. [2018-02-02 19:55:17,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:17,201 INFO L93 Difference]: Finished difference Result 233 states and 271 transitions. [2018-02-02 19:55:17,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 19:55:17,202 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 115 [2018-02-02 19:55:17,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:17,202 INFO L225 Difference]: With dead ends: 233 [2018-02-02 19:55:17,202 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 19:55:17,202 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 19:55:17,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 19:55:17,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-02-02 19:55:17,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 19:55:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2018-02-02 19:55:17,204 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 115 [2018-02-02 19:55:17,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:17,204 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2018-02-02 19:55:17,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 19:55:17,204 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2018-02-02 19:55:17,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-02-02 19:55:17,204 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:17,205 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 19:55:17,205 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 19:55:17,205 INFO L82 PathProgramCache]: Analyzing trace with hash 901331539, now seen corresponding path program 10 times [2018-02-02 19:55:17,205 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:17,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:17,671 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 19:55:17,672 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:17,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 19:55:17,672 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:17,672 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 19:55:17,673 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 19:55:17,673 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 19:55:17,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 19:55:17,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 19:55:17,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2018-02-02 19:55:17,674 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand 26 states. [2018-02-02 19:55:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:18,443 INFO L93 Difference]: Finished difference Result 187 states and 212 transitions. [2018-02-02 19:55:18,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 19:55:18,443 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 119 [2018-02-02 19:55:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:18,443 INFO L225 Difference]: With dead ends: 187 [2018-02-02 19:55:18,443 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 19:55:18,444 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 19:55:18,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 19:55:18,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 142. [2018-02-02 19:55:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 19:55:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2018-02-02 19:55:18,446 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 166 transitions. Word has length 119 [2018-02-02 19:55:18,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:18,446 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 166 transitions. [2018-02-02 19:55:18,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 19:55:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 166 transitions. [2018-02-02 19:55:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-02-02 19:55:18,447 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:18,447 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 19:55:18,448 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 19:55:18,448 INFO L82 PathProgramCache]: Analyzing trace with hash -417042283, now seen corresponding path program 6 times [2018-02-02 19:55:18,448 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:18,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:18,931 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 19:55:18,931 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:18,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 19:55:18,932 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:18,932 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 19:55:18,932 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 19:55:18,932 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 19:55:18,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 19:55:18,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 19:55:18,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2018-02-02 19:55:18,933 INFO L87 Difference]: Start difference. First operand 142 states and 166 transitions. Second operand 27 states. [2018-02-02 19:55:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:19,712 INFO L93 Difference]: Finished difference Result 201 states and 228 transitions. [2018-02-02 19:55:19,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 19:55:19,712 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 123 [2018-02-02 19:55:19,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:19,713 INFO L225 Difference]: With dead ends: 201 [2018-02-02 19:55:19,713 INFO L226 Difference]: Without dead ends: 201 [2018-02-02 19:55:19,713 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 19:55:19,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-02 19:55:19,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 143. [2018-02-02 19:55:19,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 19:55:19,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 168 transitions. [2018-02-02 19:55:19,716 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 168 transitions. Word has length 123 [2018-02-02 19:55:19,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:19,716 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 168 transitions. [2018-02-02 19:55:19,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 19:55:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 168 transitions. [2018-02-02 19:55:19,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-02-02 19:55:19,717 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:19,717 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 19:55:19,717 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 19:55:19,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1285268270, now seen corresponding path program 11 times [2018-02-02 19:55:19,718 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:19,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:20,027 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 19:55:20,027 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:20,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 19:55:20,027 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:20,028 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 19:55:20,028 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 19:55:20,028 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 19:55:20,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 19:55:20,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 19:55:20,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-02-02 19:55:20,028 INFO L87 Difference]: Start difference. First operand 143 states and 168 transitions. Second operand 20 states. [2018-02-02 19:55:20,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:20,302 INFO L93 Difference]: Finished difference Result 262 states and 306 transitions. [2018-02-02 19:55:20,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 19:55:20,302 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 128 [2018-02-02 19:55:20,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:20,303 INFO L225 Difference]: With dead ends: 262 [2018-02-02 19:55:20,303 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 19:55:20,303 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 19:55:20,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 19:55:20,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-02-02 19:55:20,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 19:55:20,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2018-02-02 19:55:20,305 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 128 [2018-02-02 19:55:20,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:20,305 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2018-02-02 19:55:20,305 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 19:55:20,306 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2018-02-02 19:55:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-02 19:55:20,306 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:20,306 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 19:55:20,306 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 19:55:20,307 INFO L82 PathProgramCache]: Analyzing trace with hash -760409937, now seen corresponding path program 12 times [2018-02-02 19:55:20,307 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:20,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:20,760 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 19:55:20,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:20,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 19:55:20,760 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:20,761 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 19:55:20,761 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 19:55:20,761 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 19:55:20,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 19:55:20,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 19:55:20,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2018-02-02 19:55:20,762 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand 25 states. [2018-02-02 19:55:21,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:21,345 INFO L93 Difference]: Finished difference Result 219 states and 247 transitions. [2018-02-02 19:55:21,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 19:55:21,345 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 132 [2018-02-02 19:55:21,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:21,346 INFO L225 Difference]: With dead ends: 219 [2018-02-02 19:55:21,346 INFO L226 Difference]: Without dead ends: 219 [2018-02-02 19:55:21,346 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 19:55:21,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-02 19:55:21,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 155. [2018-02-02 19:55:21,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 19:55:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 182 transitions. [2018-02-02 19:55:21,348 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 182 transitions. Word has length 132 [2018-02-02 19:55:21,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:21,349 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 182 transitions. [2018-02-02 19:55:21,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 19:55:21,349 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2018-02-02 19:55:21,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-02-02 19:55:21,349 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:21,349 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 19:55:21,349 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 19:55:21,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1622296335, now seen corresponding path program 7 times [2018-02-02 19:55:21,350 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:21,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:21,715 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 19:55:21,715 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:21,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 19:55:21,715 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:21,715 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 19:55:21,716 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 19:55:21,716 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 19:55:21,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 19:55:21,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 19:55:21,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2018-02-02 19:55:21,716 INFO L87 Difference]: Start difference. First operand 155 states and 182 transitions. Second operand 26 states. [2018-02-02 19:55:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:22,531 INFO L93 Difference]: Finished difference Result 233 states and 263 transitions. [2018-02-02 19:55:22,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 19:55:22,555 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 136 [2018-02-02 19:55:22,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:22,556 INFO L225 Difference]: With dead ends: 233 [2018-02-02 19:55:22,556 INFO L226 Difference]: Without dead ends: 233 [2018-02-02 19:55:22,557 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=524, Invalid=2782, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 19:55:22,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-02 19:55:22,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 156. [2018-02-02 19:55:22,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 19:55:22,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 184 transitions. [2018-02-02 19:55:22,559 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 184 transitions. Word has length 136 [2018-02-02 19:55:22,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:22,559 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 184 transitions. [2018-02-02 19:55:22,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 19:55:22,559 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 184 transitions. [2018-02-02 19:55:22,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-02-02 19:55:22,559 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:22,560 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 19:55:22,560 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 19:55:22,560 INFO L82 PathProgramCache]: Analyzing trace with hash 650505718, now seen corresponding path program 13 times [2018-02-02 19:55:22,560 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:22,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:22,858 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 19:55:22,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:22,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 19:55:22,859 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:22,859 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 19:55:22,859 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 19:55:22,859 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 19:55:22,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 19:55:22,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 19:55:22,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-02-02 19:55:22,860 INFO L87 Difference]: Start difference. First operand 156 states and 184 transitions. Second operand 22 states. [2018-02-02 19:55:23,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:23,161 INFO L93 Difference]: Finished difference Result 291 states and 341 transitions. [2018-02-02 19:55:23,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 19:55:23,161 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 141 [2018-02-02 19:55:23,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:23,162 INFO L225 Difference]: With dead ends: 291 [2018-02-02 19:55:23,162 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 19:55:23,162 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2018-02-02 19:55:23,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 19:55:23,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-02-02 19:55:23,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 19:55:23,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 188 transitions. [2018-02-02 19:55:23,164 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 188 transitions. Word has length 141 [2018-02-02 19:55:23,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:23,164 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 188 transitions. [2018-02-02 19:55:23,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 19:55:23,164 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 188 transitions. [2018-02-02 19:55:23,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-02-02 19:55:23,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:23,165 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 19:55:23,165 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 19:55:23,165 INFO L82 PathProgramCache]: Analyzing trace with hash 753871161, now seen corresponding path program 14 times [2018-02-02 19:55:23,166 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:23,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:23,618 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 19:55:23,618 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:23,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 19:55:23,618 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:23,618 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 19:55:23,618 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 19:55:23,619 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 19:55:23,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 19:55:23,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 19:55:23,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2018-02-02 19:55:23,619 INFO L87 Difference]: Start difference. First operand 160 states and 188 transitions. Second operand 27 states. [2018-02-02 19:55:24,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:24,310 INFO L93 Difference]: Finished difference Result 239 states and 270 transitions. [2018-02-02 19:55:24,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 19:55:24,310 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 145 [2018-02-02 19:55:24,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:24,311 INFO L225 Difference]: With dead ends: 239 [2018-02-02 19:55:24,311 INFO L226 Difference]: Without dead ends: 239 [2018-02-02 19:55:24,311 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 19:55:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-02 19:55:24,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 168. [2018-02-02 19:55:24,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 19:55:24,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 198 transitions. [2018-02-02 19:55:24,313 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 198 transitions. Word has length 145 [2018-02-02 19:55:24,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:24,313 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 198 transitions. [2018-02-02 19:55:24,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 19:55:24,314 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 198 transitions. [2018-02-02 19:55:24,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-02-02 19:55:24,314 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:24,315 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 19:55:24,315 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 19:55:24,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1650228347, now seen corresponding path program 8 times [2018-02-02 19:55:24,315 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:24,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:24,883 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 19:55:24,883 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:24,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 19:55:24,883 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:24,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 19:55:24,884 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 19:55:24,884 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 19:55:24,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 19:55:24,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 19:55:24,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-02-02 19:55:24,885 INFO L87 Difference]: Start difference. First operand 168 states and 198 transitions. Second operand 28 states. [2018-02-02 19:55:25,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:25,848 INFO L93 Difference]: Finished difference Result 253 states and 286 transitions. [2018-02-02 19:55:25,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 19:55:25,849 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 149 [2018-02-02 19:55:25,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:25,849 INFO L225 Difference]: With dead ends: 253 [2018-02-02 19:55:25,850 INFO L226 Difference]: Without dead ends: 253 [2018-02-02 19:55:25,850 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=544, Invalid=3116, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 19:55:25,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-02 19:55:25,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 169. [2018-02-02 19:55:25,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-02 19:55:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 200 transitions. [2018-02-02 19:55:25,853 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 200 transitions. Word has length 149 [2018-02-02 19:55:25,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:25,853 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 200 transitions. [2018-02-02 19:55:25,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 19:55:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 200 transitions. [2018-02-02 19:55:25,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-02 19:55:25,854 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:25,854 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 19:55:25,854 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 19:55:25,854 INFO L82 PathProgramCache]: Analyzing trace with hash -923414356, now seen corresponding path program 15 times [2018-02-02 19:55:25,854 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:25,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:26,265 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 19:55:26,265 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:26,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 19:55:26,266 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:26,266 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 19:55:26,266 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 19:55:26,266 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 19:55:26,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 19:55:26,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 19:55:26,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-02-02 19:55:26,267 INFO L87 Difference]: Start difference. First operand 169 states and 200 transitions. Second operand 24 states. [2018-02-02 19:55:26,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:26,651 INFO L93 Difference]: Finished difference Result 320 states and 376 transitions. [2018-02-02 19:55:26,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 19:55:26,652 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 154 [2018-02-02 19:55:26,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:26,652 INFO L225 Difference]: With dead ends: 320 [2018-02-02 19:55:26,652 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 19:55:26,653 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 19:55:26,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 19:55:26,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-02-02 19:55:26,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-02 19:55:26,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 204 transitions. [2018-02-02 19:55:26,655 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 204 transitions. Word has length 154 [2018-02-02 19:55:26,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:26,655 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 204 transitions. [2018-02-02 19:55:26,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 19:55:26,655 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 204 transitions. [2018-02-02 19:55:26,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-02-02 19:55:26,656 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:26,656 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 19:55:26,657 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 19:55:26,657 INFO L82 PathProgramCache]: Analyzing trace with hash 133184073, now seen corresponding path program 16 times [2018-02-02 19:55:26,657 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:26,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:27,236 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 19:55:27,237 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:27,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 19:55:27,237 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:55:27,237 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 19:55:27,237 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 19:55:27,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 19:55:27,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 19:55:27,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2018-02-02 19:55:27,238 INFO L87 Difference]: Start difference. First operand 173 states and 204 transitions. Second operand 29 states. [2018-02-02 19:55:27,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:27,986 INFO L93 Difference]: Finished difference Result 263 states and 297 transitions. [2018-02-02 19:55:27,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-02 19:55:27,986 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 158 [2018-02-02 19:55:27,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:27,987 INFO L225 Difference]: With dead ends: 263 [2018-02-02 19:55:27,987 INFO L226 Difference]: Without dead ends: 263 [2018-02-02 19:55:27,987 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=626, Invalid=2914, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 19:55:27,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-02 19:55:27,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 181. [2018-02-02 19:55:27,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-02 19:55:27,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 214 transitions. [2018-02-02 19:55:27,989 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 214 transitions. Word has length 158 [2018-02-02 19:55:27,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:27,989 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 214 transitions. [2018-02-02 19:55:27,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 19:55:27,989 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 214 transitions. [2018-02-02 19:55:27,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-02 19:55:27,990 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:27,990 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 19:55:27,990 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 19:55:27,990 INFO L82 PathProgramCache]: Analyzing trace with hash -984709749, now seen corresponding path program 9 times [2018-02-02 19:55:27,990 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:28,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:28,431 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 19:55:28,431 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:28,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 19:55:28,431 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:28,431 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 19:55:28,431 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 19:55:28,431 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 19:55:28,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 19:55:28,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 19:55:28,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2018-02-02 19:55:28,432 INFO L87 Difference]: Start difference. First operand 181 states and 214 transitions. Second operand 30 states. [2018-02-02 19:55:29,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:29,443 INFO L93 Difference]: Finished difference Result 273 states and 309 transitions. [2018-02-02 19:55:29,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-02 19:55:29,443 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 162 [2018-02-02 19:55:29,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:29,444 INFO L225 Difference]: With dead ends: 273 [2018-02-02 19:55:29,444 INFO L226 Difference]: Without dead ends: 273 [2018-02-02 19:55:29,444 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 19:55:29,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-02 19:55:29,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 182. [2018-02-02 19:55:29,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 19:55:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 216 transitions. [2018-02-02 19:55:29,446 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 216 transitions. Word has length 162 [2018-02-02 19:55:29,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:29,446 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 216 transitions. [2018-02-02 19:55:29,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 19:55:29,446 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2018-02-02 19:55:29,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-02-02 19:55:29,446 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:29,447 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 19:55:29,447 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 19:55:29,447 INFO L82 PathProgramCache]: Analyzing trace with hash -466685540, now seen corresponding path program 17 times [2018-02-02 19:55:29,447 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:29,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:29,807 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 19:55:29,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:29,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 19:55:29,807 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:29,807 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 19:55:29,807 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 19:55:29,807 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 19:55:29,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 19:55:29,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 19:55:29,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-02-02 19:55:29,808 INFO L87 Difference]: Start difference. First operand 182 states and 216 transitions. Second operand 26 states. [2018-02-02 19:55:30,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:30,274 INFO L93 Difference]: Finished difference Result 349 states and 411 transitions. [2018-02-02 19:55:30,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 19:55:30,274 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 167 [2018-02-02 19:55:30,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:30,274 INFO L225 Difference]: With dead ends: 349 [2018-02-02 19:55:30,275 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 19:55:30,275 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 19:55:30,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 19:55:30,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2018-02-02 19:55:30,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-02 19:55:30,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 220 transitions. [2018-02-02 19:55:30,277 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 220 transitions. Word has length 167 [2018-02-02 19:55:30,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:30,277 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 220 transitions. [2018-02-02 19:55:30,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 19:55:30,277 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 220 transitions. [2018-02-02 19:55:30,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-02-02 19:55:30,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:30,278 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 19:55:30,278 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 19:55:30,279 INFO L82 PathProgramCache]: Analyzing trace with hash -936653025, now seen corresponding path program 18 times [2018-02-02 19:55:30,279 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:30,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:30,715 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 19:55:30,715 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:30,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 19:55:30,715 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:30,716 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 19:55:30,716 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 19:55:30,716 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 19:55:30,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 19:55:30,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 19:55:30,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2018-02-02 19:55:30,716 INFO L87 Difference]: Start difference. First operand 186 states and 220 transitions. Second operand 31 states. [2018-02-02 19:55:31,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:31,704 INFO L93 Difference]: Finished difference Result 279 states and 316 transitions. [2018-02-02 19:55:31,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 19:55:31,704 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 171 [2018-02-02 19:55:31,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:31,705 INFO L225 Difference]: With dead ends: 279 [2018-02-02 19:55:31,705 INFO L226 Difference]: Without dead ends: 279 [2018-02-02 19:55:31,705 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=519, Invalid=3263, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 19:55:31,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-02-02 19:55:31,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 194. [2018-02-02 19:55:31,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 19:55:31,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 230 transitions. [2018-02-02 19:55:31,708 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 230 transitions. Word has length 171 [2018-02-02 19:55:31,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:31,708 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 230 transitions. [2018-02-02 19:55:31,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 19:55:31,708 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 230 transitions. [2018-02-02 19:55:31,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-02-02 19:55:31,709 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:31,709 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 19:55:31,709 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 19:55:31,710 INFO L82 PathProgramCache]: Analyzing trace with hash 560447329, now seen corresponding path program 10 times [2018-02-02 19:55:31,710 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:31,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:32,198 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 19:55:32,199 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:32,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 19:55:32,199 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:32,199 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 19:55:32,199 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 19:55:32,199 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 19:55:32,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 19:55:32,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 19:55:32,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2018-02-02 19:55:32,200 INFO L87 Difference]: Start difference. First operand 194 states and 230 transitions. Second operand 32 states. [2018-02-02 19:55:33,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:33,379 INFO L93 Difference]: Finished difference Result 293 states and 332 transitions. [2018-02-02 19:55:33,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-02 19:55:33,379 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 175 [2018-02-02 19:55:33,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:33,380 INFO L225 Difference]: With dead ends: 293 [2018-02-02 19:55:33,380 INFO L226 Difference]: Without dead ends: 293 [2018-02-02 19:55:33,380 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=581, Invalid=3841, Unknown=0, NotChecked=0, Total=4422 [2018-02-02 19:55:33,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-02 19:55:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 195. [2018-02-02 19:55:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-02 19:55:33,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 232 transitions. [2018-02-02 19:55:33,382 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 232 transitions. Word has length 175 [2018-02-02 19:55:33,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:33,382 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 232 transitions. [2018-02-02 19:55:33,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 19:55:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 232 transitions. [2018-02-02 19:55:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-02-02 19:55:33,382 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:33,383 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 19:55:33,383 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 19:55:33,383 INFO L82 PathProgramCache]: Analyzing trace with hash -518099578, now seen corresponding path program 19 times [2018-02-02 19:55:33,383 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:33,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:33,738 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 19:55:33,738 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:33,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 19:55:33,739 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:33,739 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 19:55:33,739 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 19:55:33,739 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 19:55:33,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 19:55:33,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 19:55:33,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-02-02 19:55:33,739 INFO L87 Difference]: Start difference. First operand 195 states and 232 transitions. Second operand 28 states. [2018-02-02 19:55:34,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:34,291 INFO L93 Difference]: Finished difference Result 378 states and 446 transitions. [2018-02-02 19:55:34,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 19:55:34,291 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 180 [2018-02-02 19:55:34,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:34,292 INFO L225 Difference]: With dead ends: 378 [2018-02-02 19:55:34,292 INFO L226 Difference]: Without dead ends: 200 [2018-02-02 19:55:34,292 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 19:55:34,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-02 19:55:34,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2018-02-02 19:55:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 19:55:34,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 236 transitions. [2018-02-02 19:55:34,294 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 236 transitions. Word has length 180 [2018-02-02 19:55:34,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:34,294 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 236 transitions. [2018-02-02 19:55:34,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 19:55:34,294 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 236 transitions. [2018-02-02 19:55:34,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-02-02 19:55:34,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:34,295 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 19:55:34,295 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 19:55:34,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1647238371, now seen corresponding path program 20 times [2018-02-02 19:55:34,296 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:34,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:34,885 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 19:55:34,885 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:34,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 19:55:34,885 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:34,886 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 19:55:34,886 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 19:55:34,886 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 19:55:34,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 19:55:34,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 19:55:34,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=883, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 19:55:34,886 INFO L87 Difference]: Start difference. First operand 199 states and 236 transitions. Second operand 33 states. [2018-02-02 19:55:35,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:35,793 INFO L93 Difference]: Finished difference Result 307 states and 347 transitions. [2018-02-02 19:55:35,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-02 19:55:35,793 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 184 [2018-02-02 19:55:35,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:35,794 INFO L225 Difference]: With dead ends: 307 [2018-02-02 19:55:35,794 INFO L226 Difference]: Without dead ends: 307 [2018-02-02 19:55:35,794 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=879, Invalid=3951, Unknown=0, NotChecked=0, Total=4830 [2018-02-02 19:55:35,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-02-02 19:55:35,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 207. [2018-02-02 19:55:35,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-02 19:55:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 246 transitions. [2018-02-02 19:55:35,796 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 246 transitions. Word has length 184 [2018-02-02 19:55:35,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:35,796 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 246 transitions. [2018-02-02 19:55:35,796 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 19:55:35,796 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 246 transitions. [2018-02-02 19:55:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-02-02 19:55:35,797 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:35,797 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 19:55:35,797 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 19:55:35,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1008317659, now seen corresponding path program 11 times [2018-02-02 19:55:35,798 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:35,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:36,340 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 19:55:36,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:36,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 19:55:36,340 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:55:36,341 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 19:55:36,341 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 19:55:36,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 19:55:36,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 19:55:36,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 19:55:36,341 INFO L87 Difference]: Start difference. First operand 207 states and 246 transitions. Second operand 34 states. [2018-02-02 19:55:37,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:37,598 INFO L93 Difference]: Finished difference Result 321 states and 363 transitions. [2018-02-02 19:55:37,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-02 19:55:37,598 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 188 [2018-02-02 19:55:37,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:37,599 INFO L225 Difference]: With dead ends: 321 [2018-02-02 19:55:37,599 INFO L226 Difference]: Without dead ends: 321 [2018-02-02 19:55:37,600 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 19:55:37,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-02-02 19:55:37,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 208. [2018-02-02 19:55:37,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 19:55:37,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 248 transitions. [2018-02-02 19:55:37,602 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 248 transitions. Word has length 188 [2018-02-02 19:55:37,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:37,603 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 248 transitions. [2018-02-02 19:55:37,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 19:55:37,603 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 248 transitions. [2018-02-02 19:55:37,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-02-02 19:55:37,604 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:37,604 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 19:55:37,604 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 19:55:37,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1653302206, now seen corresponding path program 21 times [2018-02-02 19:55:37,605 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:37,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:38,013 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 19:55:38,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:38,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 19:55:38,013 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:38,013 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 19:55:38,014 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 19:55:38,014 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 19:55:38,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 19:55:38,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 19:55:38,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-02-02 19:55:38,014 INFO L87 Difference]: Start difference. First operand 208 states and 248 transitions. Second operand 30 states. [2018-02-02 19:55:38,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:38,666 INFO L93 Difference]: Finished difference Result 407 states and 481 transitions. [2018-02-02 19:55:38,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 19:55:38,667 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 193 [2018-02-02 19:55:38,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:38,667 INFO L225 Difference]: With dead ends: 407 [2018-02-02 19:55:38,667 INFO L226 Difference]: Without dead ends: 213 [2018-02-02 19:55:38,667 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 19:55:38,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-02 19:55:38,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2018-02-02 19:55:38,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-02 19:55:38,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 252 transitions. [2018-02-02 19:55:38,669 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 252 transitions. Word has length 193 [2018-02-02 19:55:38,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:38,669 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 252 transitions. [2018-02-02 19:55:38,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 19:55:38,669 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 252 transitions. [2018-02-02 19:55:38,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-02 19:55:38,670 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:38,670 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 19:55:38,670 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 19:55:38,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1906127867, now seen corresponding path program 22 times [2018-02-02 19:55:38,670 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:38,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:39,253 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 19:55:39,253 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:39,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 19:55:39,253 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:39,254 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 19:55:39,254 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 19:55:39,254 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 19:55:39,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 19:55:39,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 19:55:39,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1002, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 19:55:39,254 INFO L87 Difference]: Start difference. First operand 212 states and 252 transitions. Second operand 35 states. [2018-02-02 19:55:40,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:40,269 INFO L93 Difference]: Finished difference Result 327 states and 370 transitions. [2018-02-02 19:55:40,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-02 19:55:40,269 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 197 [2018-02-02 19:55:40,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:40,270 INFO L225 Difference]: With dead ends: 327 [2018-02-02 19:55:40,270 INFO L226 Difference]: Without dead ends: 327 [2018-02-02 19:55:40,271 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=924, Invalid=4478, Unknown=0, NotChecked=0, Total=5402 [2018-02-02 19:55:40,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-02 19:55:40,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 220. [2018-02-02 19:55:40,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-02 19:55:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 262 transitions. [2018-02-02 19:55:40,273 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 262 transitions. Word has length 197 [2018-02-02 19:55:40,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:40,273 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 262 transitions. [2018-02-02 19:55:40,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 19:55:40,273 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 262 transitions. [2018-02-02 19:55:40,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-02-02 19:55:40,274 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:40,274 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 19:55:40,275 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 19:55:40,275 INFO L82 PathProgramCache]: Analyzing trace with hash -932587193, now seen corresponding path program 12 times [2018-02-02 19:55:40,275 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:40,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:40,884 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 19:55:40,885 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:40,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 19:55:40,885 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:40,885 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 19:55:40,885 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 19:55:40,886 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 19:55:40,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 19:55:40,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 19:55:40,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1070, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 19:55:40,886 INFO L87 Difference]: Start difference. First operand 220 states and 262 transitions. Second operand 36 states. [2018-02-02 19:55:42,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:42,287 INFO L93 Difference]: Finished difference Result 341 states and 386 transitions. [2018-02-02 19:55:42,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-02 19:55:42,287 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 201 [2018-02-02 19:55:42,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:42,288 INFO L225 Difference]: With dead ends: 341 [2018-02-02 19:55:42,288 INFO L226 Difference]: Without dead ends: 341 [2018-02-02 19:55:42,288 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 19:55:42,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-02 19:55:42,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 221. [2018-02-02 19:55:42,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-02 19:55:42,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 264 transitions. [2018-02-02 19:55:42,290 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 264 transitions. Word has length 201 [2018-02-02 19:55:42,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:42,290 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 264 transitions. [2018-02-02 19:55:42,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 19:55:42,290 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 264 transitions. [2018-02-02 19:55:42,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-02-02 19:55:42,291 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:42,291 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 19:55:42,291 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 19:55:42,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2097058656, now seen corresponding path program 23 times [2018-02-02 19:55:42,291 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:42,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:42,747 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 19:55:42,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:42,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 19:55:42,747 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:42,748 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 19:55:42,748 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 19:55:42,748 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 19:55:42,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 19:55:42,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 19:55:42,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-02-02 19:55:42,748 INFO L87 Difference]: Start difference. First operand 221 states and 264 transitions. Second operand 32 states. [2018-02-02 19:55:43,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:43,413 INFO L93 Difference]: Finished difference Result 436 states and 516 transitions. [2018-02-02 19:55:43,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 19:55:43,413 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 206 [2018-02-02 19:55:43,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:43,414 INFO L225 Difference]: With dead ends: 436 [2018-02-02 19:55:43,414 INFO L226 Difference]: Without dead ends: 226 [2018-02-02 19:55:43,414 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 19:55:43,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-02 19:55:43,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-02-02 19:55:43,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-02 19:55:43,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 268 transitions. [2018-02-02 19:55:43,416 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 268 transitions. Word has length 206 [2018-02-02 19:55:43,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:43,416 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 268 transitions. [2018-02-02 19:55:43,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 19:55:43,416 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 268 transitions. [2018-02-02 19:55:43,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-02-02 19:55:43,416 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:43,417 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 19:55:43,417 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 19:55:43,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1027254147, now seen corresponding path program 24 times [2018-02-02 19:55:43,417 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:43,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:44,037 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 19:55:44,037 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:44,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 19:55:44,037 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:44,038 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 19:55:44,038 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 19:55:44,038 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 19:55:44,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 19:55:44,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 19:55:44,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1105, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 19:55:44,039 INFO L87 Difference]: Start difference. First operand 225 states and 268 transitions. Second operand 37 states. [2018-02-02 19:55:45,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:45,150 INFO L93 Difference]: Finished difference Result 351 states and 397 transitions. [2018-02-02 19:55:45,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-02 19:55:45,150 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 210 [2018-02-02 19:55:45,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:45,151 INFO L225 Difference]: With dead ends: 351 [2018-02-02 19:55:45,151 INFO L226 Difference]: Without dead ends: 351 [2018-02-02 19:55:45,152 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 19:55:45,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-02-02 19:55:45,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 233. [2018-02-02 19:55:45,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-02 19:55:45,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 278 transitions. [2018-02-02 19:55:45,155 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 278 transitions. Word has length 210 [2018-02-02 19:55:45,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:45,155 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 278 transitions. [2018-02-02 19:55:45,155 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 19:55:45,155 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 278 transitions. [2018-02-02 19:55:45,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-02-02 19:55:45,155 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:45,156 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 19:55:45,156 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 19:55:45,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1220449857, now seen corresponding path program 13 times [2018-02-02 19:55:45,156 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:45,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1118 backedges. 288 proven. 830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:55:46,002 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:46,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-02 19:55:46,002 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:46,002 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 19:55:46,002 INFO L182 omatonBuilderFactory]: Interpolants [24520#true, 24521#false, 24522#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 24523#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 24524#(= 0 main_~nondetString2~0.offset), 24525#(= 0 |cstrstr_#in~find.offset|), 24526#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0)), 24527#(<= 1 cstrstr_~find.offset), 24528#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 24529#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 24530#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 24531#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 24532#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 24533#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 24534#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 24535#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 24536#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 24537#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 24538#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 24539#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 24540#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 24541#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= cstrlen_~s~0.base |cstrlen_#in~str.base|)), 24542#(<= (+ |cstrlen_#in~str.offset| 14) (select |#length| |cstrlen_#in~str.base|)), 24543#(and (<= 1 cstrstr_~find.offset) (<= (+ cstrstr_~find.offset 14) (select |#length| cstrstr_~find.base))), 24544#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= (+ |cstrncmp_#in~s2.offset| 14) (select |#length| |cstrncmp_#in~s2.base|))), 24545#(and (<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 24546#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base))), 24547#(and (<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)) (<= 3 cstrncmp_~s2.offset)), 24548#(and (<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 24549#(and (<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)) (<= 5 cstrncmp_~s2.offset)), 24550#(and (<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)) (<= 6 cstrncmp_~s2.offset)), 24551#(and (<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)) (<= 7 cstrncmp_~s2.offset)), 24552#(and (<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)) (<= 8 cstrncmp_~s2.offset)), 24553#(and (<= 9 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base))), 24554#(and (<= 10 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base))), 24555#(and (<= 11 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base))), 24556#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 12 cstrncmp_~s2.offset)), 24557#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 13 cstrncmp_~s2.offset)), 24558#(and (<= 14 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 24559#(and (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base)) (<= 15 cstrncmp_~s2.offset)), 24560#(and (<= 14 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)))] [2018-02-02 19:55:46,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1118 backedges. 288 proven. 830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:55:46,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 19:55:46,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 19:55:46,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1480, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 19:55:46,003 INFO L87 Difference]: Start difference. First operand 233 states and 278 transitions. Second operand 41 states. [2018-02-02 19:55:47,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:47,643 INFO L93 Difference]: Finished difference Result 341 states and 389 transitions. [2018-02-02 19:55:47,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 19:55:47,644 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 214 [2018-02-02 19:55:47,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:47,644 INFO L225 Difference]: With dead ends: 341 [2018-02-02 19:55:47,644 INFO L226 Difference]: Without dead ends: 341 [2018-02-02 19:55:47,645 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=263, Invalid=3519, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 19:55:47,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-02 19:55:47,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 234. [2018-02-02 19:55:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-02 19:55:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 280 transitions. [2018-02-02 19:55:47,647 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 280 transitions. Word has length 214 [2018-02-02 19:55:47,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:47,647 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 280 transitions. [2018-02-02 19:55:47,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 19:55:47,647 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 280 transitions. [2018-02-02 19:55:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-02-02 19:55:47,648 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:47,648 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 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 19:55:47,648 INFO L371 AbstractCegarLoop]: === Iteration 70 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 19:55:47,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1020883480, now seen corresponding path program 25 times [2018-02-02 19:55:47,649 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:47,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:48,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 169 proven. 1053 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 19:55:48,179 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:48,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 19:55:48,179 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:48,179 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 19:55:48,179 INFO L182 omatonBuilderFactory]: Interpolants [25178#true, 25179#false, 25180#(= cstrlen_~s~0.offset cstrlen_~str.offset), 25181#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 25182#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 25183#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 25184#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 25185#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 25186#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 25187#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 25188#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 25189#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 25190#(and (<= (+ cstrlen_~str.offset 10) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 10))), 25191#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 11)) (<= (+ cstrlen_~str.offset 11) cstrlen_~s~0.offset)), 25192#(and (<= (+ cstrlen_~str.offset 12) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 12))), 25193#(and (<= (+ cstrlen_~str.offset 13) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 13))), 25194#(and (<= |cstrlen_#res| 13) (<= 13 |cstrlen_#res|)), 25195#(and (<= 13 |cstrstr_#t~ret13|) (<= |cstrstr_#t~ret13| 13)), 25196#(and (<= 13 cstrstr_~len~0) (<= cstrstr_~len~0 13)), 25197#(and (<= |cstrncmp_#in~n| 13) (<= 13 |cstrncmp_#in~n|)), 25198#(and (<= cstrncmp_~n 13) (<= 13 cstrncmp_~n)), 25199#(and (<= 12 cstrncmp_~n) (<= cstrncmp_~n 12)), 25200#(and (<= cstrncmp_~n 11) (<= 11 cstrncmp_~n)), 25201#(and (<= 10 cstrncmp_~n) (<= cstrncmp_~n 10)), 25202#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 25203#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 25204#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 25205#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 25206#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 25207#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 25208#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 25209#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 25210#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 25211#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|))] [2018-02-02 19:55:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 169 proven. 1053 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 19:55:48,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 19:55:48,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 19:55:48,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 19:55:48,180 INFO L87 Difference]: Start difference. First operand 234 states and 280 transitions. Second operand 34 states. [2018-02-02 19:55:48,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:48,952 INFO L93 Difference]: Finished difference Result 465 states and 551 transitions. [2018-02-02 19:55:48,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 19:55:48,953 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 219 [2018-02-02 19:55:48,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:48,953 INFO L225 Difference]: With dead ends: 465 [2018-02-02 19:55:48,954 INFO L226 Difference]: Without dead ends: 239 [2018-02-02 19:55:48,954 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=2227, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 19:55:48,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-02 19:55:48,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2018-02-02 19:55:48,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-02 19:55:48,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 284 transitions. [2018-02-02 19:55:48,955 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 284 transitions. Word has length 219 [2018-02-02 19:55:48,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:48,956 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 284 transitions. [2018-02-02 19:55:48,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 19:55:48,956 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 284 transitions. [2018-02-02 19:55:48,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-02-02 19:55:48,956 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:48,956 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:55:48,956 INFO L371 AbstractCegarLoop]: === Iteration 71 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 19:55:48,956 INFO L82 PathProgramCache]: Analyzing trace with hash -781729813, now seen corresponding path program 26 times [2018-02-02 19:55:48,957 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:48,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 338 proven. 943 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:55:49,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:49,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-02 19:55:49,886 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:49,886 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 19:55:49,886 INFO L182 omatonBuilderFactory]: Interpolants [25984#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 14 cstrncmp_~s2.offset)), 25985#(and (<= 15 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 25986#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 15 |cstrncmp_#t~post3.offset|)), 25945#true, 25946#false, 25947#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 25948#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 25949#(= 0 main_~nondetString2~0.offset), 25950#(= 0 |cstrstr_#in~find.offset|), 25951#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0)), 25952#(<= 1 cstrstr_~find.offset), 25953#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 25954#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 25955#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 25956#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 25957#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 25958#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 25959#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 25960#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 25961#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 25962#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 25963#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 25964#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 25965#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 25966#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 25967#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 25968#(<= (+ |cstrlen_#in~str.offset| 15) (select |#length| |cstrlen_#in~str.base|)), 25969#(and (<= (+ cstrstr_~find.offset 15) (select |#length| cstrstr_~find.base)) (<= 1 cstrstr_~find.offset)), 25970#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= (+ |cstrncmp_#in~s2.offset| 15) (select |#length| |cstrncmp_#in~s2.base|))), 25971#(and (<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 25972#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base))), 25973#(and (<= 3 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base))), 25974#(and (<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 25975#(and (<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)) (<= 5 cstrncmp_~s2.offset)), 25976#(and (<= 6 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base))), 25977#(and (<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)) (<= 7 cstrncmp_~s2.offset)), 25978#(and (<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)) (<= 8 cstrncmp_~s2.offset)), 25979#(and (<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)) (<= 9 cstrncmp_~s2.offset)), 25980#(and (<= 10 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base))), 25981#(and (<= 11 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base))), 25982#(and (<= 12 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base))), 25983#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 13 cstrncmp_~s2.offset))] [2018-02-02 19:55:49,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 338 proven. 943 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:55:49,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 19:55:49,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 19:55:49,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1547, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 19:55:49,887 INFO L87 Difference]: Start difference. First operand 238 states and 284 transitions. Second operand 42 states. [2018-02-02 19:55:51,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:51,541 INFO L93 Difference]: Finished difference Result 347 states and 396 transitions. [2018-02-02 19:55:51,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 19:55:51,541 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 223 [2018-02-02 19:55:51,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:51,542 INFO L225 Difference]: With dead ends: 347 [2018-02-02 19:55:51,542 INFO L226 Difference]: Without dead ends: 347 [2018-02-02 19:55:51,542 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=277, Invalid=3629, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 19:55:51,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-02-02 19:55:51,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 246. [2018-02-02 19:55:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-02-02 19:55:51,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 294 transitions. [2018-02-02 19:55:51,544 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 294 transitions. Word has length 223 [2018-02-02 19:55:51,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:51,545 INFO L432 AbstractCegarLoop]: Abstraction has 246 states and 294 transitions. [2018-02-02 19:55:51,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 19:55:51,545 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 294 transitions. [2018-02-02 19:55:51,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-02-02 19:55:51,545 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:51,545 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:55:51,545 INFO L371 AbstractCegarLoop]: === Iteration 72 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 19:55:51,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1449552429, now seen corresponding path program 14 times [2018-02-02 19:55:51,546 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:51,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:52,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 338 proven. 957 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:55:52,423 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:52,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-02 19:55:52,423 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:52,424 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 19:55:52,424 INFO L182 omatonBuilderFactory]: Interpolants [26624#(and (= 0 |main_#t~malloc21.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc21.base|))), 26625#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 26626#(= 0 main_~nondetString2~0.offset), 26627#(= 0 |cstrstr_#in~find.offset|), 26628#(and (<= (+ |cstrstr_#t~post11.offset| 1) cstrstr_~find.offset) (= |cstrstr_#t~post11.offset| 0)), 26629#(<= 1 cstrstr_~find.offset), 26630#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 26631#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 26632#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 26633#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 26634#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 26635#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 26636#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 26637#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 26638#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 26639#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 26640#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 26641#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 26642#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 26643#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 26644#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 26645#(<= (+ |cstrlen_#in~str.offset| 15) (select |#length| |cstrlen_#in~str.base|)), 26646#(and (<= (+ cstrstr_~find.offset 15) (select |#length| cstrstr_~find.base)) (<= 1 cstrstr_~find.offset)), 26647#(and (<= 1 |cstrncmp_#in~s2.offset|) (<= (+ |cstrncmp_#in~s2.offset| 15) (select |#length| |cstrncmp_#in~s2.base|))), 26648#(and (<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 26649#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base))), 26650#(and (<= 3 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base))), 26651#(and (<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)) (<= 4 cstrncmp_~s2.offset)), 26652#(and (<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)) (<= 5 cstrncmp_~s2.offset)), 26653#(and (<= 6 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base))), 26654#(and (<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)) (<= 7 cstrncmp_~s2.offset)), 26655#(and (<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)) (<= 8 cstrncmp_~s2.offset)), 26656#(and (<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)) (<= 9 cstrncmp_~s2.offset)), 26657#(and (<= 10 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base))), 26658#(and (<= 11 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base))), 26659#(and (<= 12 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base))), 26660#(and (<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)) (<= 13 cstrncmp_~s2.offset)), 26661#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 14 cstrncmp_~s2.offset)), 26662#(and (<= 15 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 26663#(and (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base)) (<= 16 cstrncmp_~s2.offset)), 26664#(and (<= 15 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|))), 26622#true, 26623#false] [2018-02-02 19:55:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 338 proven. 957 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:55:52,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-02 19:55:52,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-02 19:55:52,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1629, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 19:55:52,424 INFO L87 Difference]: Start difference. First operand 246 states and 294 transitions. Second operand 43 states. [2018-02-02 19:55:54,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:54,193 INFO L93 Difference]: Finished difference Result 361 states and 412 transitions. [2018-02-02 19:55:54,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 19:55:54,193 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 227 [2018-02-02 19:55:54,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:54,194 INFO L225 Difference]: With dead ends: 361 [2018-02-02 19:55:54,194 INFO L226 Difference]: Without dead ends: 361 [2018-02-02 19:55:54,195 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=285, Invalid=3875, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 19:55:54,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-02-02 19:55:54,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 247. [2018-02-02 19:55:54,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-02 19:55:54,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 296 transitions. [2018-02-02 19:55:54,197 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 296 transitions. Word has length 227 [2018-02-02 19:55:54,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:54,197 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 296 transitions. [2018-02-02 19:55:54,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-02 19:55:54,197 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 296 transitions. [2018-02-02 19:55:54,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-02-02 19:55:54,197 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:54,197 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:55:54,197 INFO L371 AbstractCegarLoop]: === Iteration 73 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 19:55:54,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1898536390, now seen corresponding path program 27 times [2018-02-02 19:55:54,198 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:54,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1411 backedges. 182 proven. 1225 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 19:55:54,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:54,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 19:55:54,784 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:54,784 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 19:55:54,784 INFO L182 omatonBuilderFactory]: Interpolants [27328#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 27329#(and (<= (+ cstrlen_~str.offset 10) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 10))), 27330#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 11)) (<= (+ cstrlen_~str.offset 11) cstrlen_~s~0.offset)), 27331#(and (<= (+ cstrlen_~str.offset 12) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 12))), 27332#(and (<= (+ cstrlen_~str.offset 13) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 13))), 27333#(and (<= (+ cstrlen_~str.offset 14) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 14))), 27334#(and (<= 14 |cstrlen_#res|) (<= |cstrlen_#res| 14)), 27335#(and (<= |cstrstr_#t~ret13| 14) (<= 14 |cstrstr_#t~ret13|)), 27336#(and (<= 14 cstrstr_~len~0) (<= cstrstr_~len~0 14)), 27337#(and (<= 14 |cstrncmp_#in~n|) (<= |cstrncmp_#in~n| 14)), 27338#(and (<= 14 cstrncmp_~n) (<= cstrncmp_~n 14)), 27339#(and (<= cstrncmp_~n 13) (<= 13 cstrncmp_~n)), 27340#(and (<= 12 cstrncmp_~n) (<= cstrncmp_~n 12)), 27341#(and (<= cstrncmp_~n 11) (<= 11 cstrncmp_~n)), 27342#(and (<= 10 cstrncmp_~n) (<= cstrncmp_~n 10)), 27343#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 27344#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 27345#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 27346#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 27347#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 27348#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 27349#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 27350#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 27351#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 27352#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|)), 27317#true, 27318#false, 27319#(= cstrlen_~s~0.offset cstrlen_~str.offset), 27320#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 27321#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 27322#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 27323#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 27324#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 27325#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 27326#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 27327#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset))] [2018-02-02 19:55:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1411 backedges. 182 proven. 1225 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 19:55:54,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 19:55:54,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 19:55:54,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 19:55:54,785 INFO L87 Difference]: Start difference. First operand 247 states and 296 transitions. Second operand 36 states. [2018-02-02 19:55:55,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:55,653 INFO L93 Difference]: Finished difference Result 494 states and 586 transitions. [2018-02-02 19:55:55,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 19:55:55,653 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 232 [2018-02-02 19:55:55,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:55,654 INFO L225 Difference]: With dead ends: 494 [2018-02-02 19:55:55,654 INFO L226 Difference]: Without dead ends: 252 [2018-02-02 19:55:55,654 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=2519, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 19:55:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-02 19:55:55,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2018-02-02 19:55:55,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-02 19:55:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 300 transitions. [2018-02-02 19:55:55,656 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 300 transitions. Word has length 232 [2018-02-02 19:55:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:55,656 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 300 transitions. [2018-02-02 19:55:55,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 19:55:55,656 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 300 transitions. [2018-02-02 19:55:55,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-02-02 19:55:55,656 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:55,656 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:55:55,657 INFO L371 AbstractCegarLoop]: === Iteration 74 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 19:55:55,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1764756759, now seen corresponding path program 28 times [2018-02-02 19:55:55,657 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:55,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 392 proven. 1078 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:55:56,439 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:56,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-02 19:55:56,439 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:56,439 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 19:55:56,439 INFO L182 omatonBuilderFactory]: Interpolants [28160#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 28161#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 28162#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 28163#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 28164#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 28165#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 28166#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 28167#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 28168#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 28169#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 28170#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 1 |cstrncmp_#t~post3.offset|)), 28130#true, 28131#false, 28132#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 28133#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 28134#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 28135#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 28136#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 28137#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 28138#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 28139#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 28140#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 28141#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 28142#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 28143#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 28144#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 28145#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 28146#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 28147#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 28148#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 28149#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 28150#(<= (+ |cstrlen_#in~str.offset| 16) (select |#length| |cstrlen_#in~str.base|)), 28151#(<= (+ cstrstr_~find.offset 16) (select |#length| cstrstr_~find.base)), 28152#(<= (+ |cstrncmp_#in~s2.offset| 16) (select |#length| |cstrncmp_#in~s2.base|)), 28153#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 28154#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 28155#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 28156#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 28157#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 28158#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 28159#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base))] [2018-02-02 19:55:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 392 proven. 1078 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:55:56,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 19:55:56,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 19:55:56,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 19:55:56,440 INFO L87 Difference]: Start difference. First operand 251 states and 300 transitions. Second operand 41 states. [2018-02-02 19:55:57,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:55:57,628 INFO L93 Difference]: Finished difference Result 395 states and 447 transitions. [2018-02-02 19:55:57,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-02-02 19:55:57,629 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 236 [2018-02-02 19:55:57,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:55:57,629 INFO L225 Difference]: With dead ends: 395 [2018-02-02 19:55:57,630 INFO L226 Difference]: Without dead ends: 395 [2018-02-02 19:55:57,630 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2197 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1517, Invalid=6493, Unknown=0, NotChecked=0, Total=8010 [2018-02-02 19:55:57,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-02-02 19:55:57,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 259. [2018-02-02 19:55:57,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-02-02 19:55:57,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 310 transitions. [2018-02-02 19:55:57,632 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 310 transitions. Word has length 236 [2018-02-02 19:55:57,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:55:57,633 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 310 transitions. [2018-02-02 19:55:57,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 19:55:57,633 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 310 transitions. [2018-02-02 19:55:57,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-02-02 19:55:57,634 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:55:57,634 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:55:57,634 INFO L371 AbstractCegarLoop]: === Iteration 75 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 19:55:57,634 INFO L82 PathProgramCache]: Analyzing trace with hash 162283865, now seen corresponding path program 15 times [2018-02-02 19:55:57,635 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:55:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:55:57,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:55:58,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 392 proven. 1093 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:55:58,526 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:55:58,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-02 19:55:58,526 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:55:58,526 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 19:55:58,526 INFO L182 omatonBuilderFactory]: Interpolants [28928#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 28929#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 28930#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 28931#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 28932#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 28933#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 28934#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 28935#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 28936#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 28937#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 28938#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 28939#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 28940#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 28941#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 28942#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 28943#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 28944#(<= (+ |cstrlen_#in~str.offset| 16) (select |#length| |cstrlen_#in~str.base|)), 28945#(<= (+ cstrstr_~find.offset 16) (select |#length| cstrstr_~find.base)), 28946#(<= (+ |cstrncmp_#in~s2.offset| 16) (select |#length| |cstrncmp_#in~s2.base|)), 28947#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 28948#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 28949#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 28950#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 28951#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 28952#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 28953#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 28954#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 28955#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 28956#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 28957#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 28958#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 28959#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 28960#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 28961#(<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)), 28962#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 28963#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 28964#(and (<= 2 cstrncmp_~s2.offset) (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base))), 28965#(and (<= 1 |cstrncmp_#t~pre6.offset|) (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|))), 28924#true, 28925#false, 28926#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 28927#(= main_~length2~0 (select |#length| main_~nondetString2~0.base))] [2018-02-02 19:55:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 392 proven. 1093 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:55:58,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 19:55:58,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 19:55:58,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1431, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 19:55:58,527 INFO L87 Difference]: Start difference. First operand 259 states and 310 transitions. Second operand 42 states. [2018-02-02 19:56:00,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:00,260 INFO L93 Difference]: Finished difference Result 409 states and 463 transitions. [2018-02-02 19:56:00,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-02-02 19:56:00,261 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 240 [2018-02-02 19:56:00,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:00,261 INFO L225 Difference]: With dead ends: 409 [2018-02-02 19:56:00,261 INFO L226 Difference]: Without dead ends: 409 [2018-02-02 19:56:00,262 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3274 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1924, Invalid=9206, Unknown=0, NotChecked=0, Total=11130 [2018-02-02 19:56:00,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-02-02 19:56:00,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 260. [2018-02-02 19:56:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-02-02 19:56:00,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 312 transitions. [2018-02-02 19:56:00,264 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 312 transitions. Word has length 240 [2018-02-02 19:56:00,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:00,264 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 312 transitions. [2018-02-02 19:56:00,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 19:56:00,264 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 312 transitions. [2018-02-02 19:56:00,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-02-02 19:56:00,265 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:00,265 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:56:00,265 INFO L371 AbstractCegarLoop]: === Iteration 76 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 19:56:00,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1270113934, now seen corresponding path program 29 times [2018-02-02 19:56:00,265 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:00,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:00,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1609 backedges. 195 proven. 1410 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 19:56:00,871 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:00,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-02 19:56:00,871 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:00,871 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 19:56:00,871 INFO L182 omatonBuilderFactory]: Interpolants [29764#true, 29765#false, 29766#(= cstrlen_~s~0.offset cstrlen_~str.offset), 29767#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 1)) (<= (+ cstrlen_~str.offset 1) cstrlen_~s~0.offset)), 29768#(and (<= (+ cstrlen_~str.offset 2) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 2))), 29769#(and (<= (+ cstrlen_~str.offset 3) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 3))), 29770#(and (<= (+ cstrlen_~str.offset 4) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 4))), 29771#(and (<= (+ cstrlen_~str.offset 5) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 5))), 29772#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 6)) (<= (+ cstrlen_~str.offset 6) cstrlen_~s~0.offset)), 29773#(and (<= (+ cstrlen_~str.offset 7) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 7))), 29774#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 8)) (<= (+ cstrlen_~str.offset 8) cstrlen_~s~0.offset)), 29775#(and (<= (+ cstrlen_~str.offset 9) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 9))), 29776#(and (<= (+ cstrlen_~str.offset 10) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 10))), 29777#(and (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 11)) (<= (+ cstrlen_~str.offset 11) cstrlen_~s~0.offset)), 29778#(and (<= (+ cstrlen_~str.offset 12) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 12))), 29779#(and (<= (+ cstrlen_~str.offset 13) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 13))), 29780#(and (<= (+ cstrlen_~str.offset 14) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 14))), 29781#(and (<= (+ cstrlen_~str.offset 15) cstrlen_~s~0.offset) (<= cstrlen_~s~0.offset (+ cstrlen_~str.offset 15))), 29782#(and (<= 15 |cstrlen_#res|) (<= |cstrlen_#res| 15)), 29783#(and (<= |cstrstr_#t~ret13| 15) (<= 15 |cstrstr_#t~ret13|)), 29784#(and (<= 15 cstrstr_~len~0) (<= cstrstr_~len~0 15)), 29785#(and (<= 15 |cstrncmp_#in~n|) (<= |cstrncmp_#in~n| 15)), 29786#(and (<= cstrncmp_~n 15) (<= 15 cstrncmp_~n)), 29787#(and (<= 14 cstrncmp_~n) (<= cstrncmp_~n 14)), 29788#(and (<= cstrncmp_~n 13) (<= 13 cstrncmp_~n)), 29789#(and (<= 12 cstrncmp_~n) (<= cstrncmp_~n 12)), 29790#(and (<= cstrncmp_~n 11) (<= 11 cstrncmp_~n)), 29791#(and (<= 10 cstrncmp_~n) (<= cstrncmp_~n 10)), 29792#(and (<= 9 cstrncmp_~n) (<= cstrncmp_~n 9)), 29793#(and (<= 8 cstrncmp_~n) (<= cstrncmp_~n 8)), 29794#(and (<= 7 cstrncmp_~n) (<= cstrncmp_~n 7)), 29795#(and (<= cstrncmp_~n 6) (<= 6 cstrncmp_~n)), 29796#(and (<= cstrncmp_~n 5) (<= 5 cstrncmp_~n)), 29797#(and (<= 4 cstrncmp_~n) (<= cstrncmp_~n 4)), 29798#(and (<= 3 cstrncmp_~n) (<= cstrncmp_~n 3)), 29799#(and (<= 2 cstrncmp_~n) (<= cstrncmp_~n 2)), 29800#(and (<= cstrncmp_~n 1) (<= 1 cstrncmp_~n)), 29801#(and (<= |cstrncmp_#t~pre2| (* 4294967296 (div |cstrncmp_#t~pre2| 4294967296))) (<= 0 |cstrncmp_#t~pre2|))] [2018-02-02 19:56:00,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1609 backedges. 195 proven. 1410 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 19:56:00,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 19:56:00,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 19:56:00,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 19:56:00,872 INFO L87 Difference]: Start difference. First operand 260 states and 312 transitions. Second operand 38 states. [2018-02-02 19:56:01,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:01,929 INFO L93 Difference]: Finished difference Result 523 states and 621 transitions. [2018-02-02 19:56:01,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 19:56:01,930 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 245 [2018-02-02 19:56:01,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:01,931 INFO L225 Difference]: With dead ends: 523 [2018-02-02 19:56:01,931 INFO L226 Difference]: Without dead ends: 265 [2018-02-02 19:56:01,931 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=2829, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 19:56:01,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-02 19:56:01,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 264. [2018-02-02 19:56:01,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-02-02 19:56:01,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 316 transitions. [2018-02-02 19:56:01,934 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 316 transitions. Word has length 245 [2018-02-02 19:56:01,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:01,934 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 316 transitions. [2018-02-02 19:56:01,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 19:56:01,935 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 316 transitions. [2018-02-02 19:56:01,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-02-02 19:56:01,935 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:01,936 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:56:01,936 INFO L371 AbstractCegarLoop]: === Iteration 77 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 19:56:01,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1678882095, now seen corresponding path program 30 times [2018-02-02 19:56:01,936 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:01,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1672 backedges. 450 proven. 1222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:03,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:03,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-02 19:56:03,000 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:03,000 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 19:56:03,000 INFO L182 omatonBuilderFactory]: Interpolants [30656#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 30657#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 30658#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 30659#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 30660#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 30661#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 30662#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 30663#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 30664#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 30665#(and (<= (+ |cstrncmp_#t~post3.offset| 1) (select |#length| |cstrncmp_#t~post3.base|)) (<= 2 |cstrncmp_#t~post3.offset|)), 30623#true, 30624#false, 30625#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 30626#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 30627#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 30628#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 30629#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 30630#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 30631#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 30632#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 30633#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 30634#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 30635#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 30636#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 30637#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 30638#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 30639#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 30640#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 30641#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 30642#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 30643#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 16) cstrlen_~s~0.offset)), 30644#(<= (+ |cstrlen_#in~str.offset| 17) (select |#length| |cstrlen_#in~str.base|)), 30645#(<= (+ cstrstr_~find.offset 17) (select |#length| cstrstr_~find.base)), 30646#(<= (+ |cstrncmp_#in~s2.offset| 17) (select |#length| |cstrncmp_#in~s2.base|)), 30647#(<= (+ cstrncmp_~s2.offset 17) (select |#length| cstrncmp_~s2.base)), 30648#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 30649#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 30650#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 30651#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 30652#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 30653#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 30654#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base)), 30655#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base))] [2018-02-02 19:56:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1672 backedges. 450 proven. 1222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:03,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-02 19:56:03,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-02 19:56:03,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1498, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 19:56:03,001 INFO L87 Difference]: Start difference. First operand 264 states and 316 transitions. Second operand 43 states. [2018-02-02 19:56:04,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:56:04,525 INFO L93 Difference]: Finished difference Result 415 states and 470 transitions. [2018-02-02 19:56:04,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-02 19:56:04,526 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 249 [2018-02-02 19:56:04,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:56:04,527 INFO L225 Difference]: With dead ends: 415 [2018-02-02 19:56:04,527 INFO L226 Difference]: Without dead ends: 415 [2018-02-02 19:56:04,528 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2410 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1574, Invalid=7168, Unknown=0, NotChecked=0, Total=8742 [2018-02-02 19:56:04,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-02-02 19:56:04,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 272. [2018-02-02 19:56:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-02-02 19:56:04,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 326 transitions. [2018-02-02 19:56:04,530 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 326 transitions. Word has length 249 [2018-02-02 19:56:04,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:56:04,530 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 326 transitions. [2018-02-02 19:56:04,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-02 19:56:04,530 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 326 transitions. [2018-02-02 19:56:04,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-02-02 19:56:04,531 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:56:04,531 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:56:04,531 INFO L371 AbstractCegarLoop]: === Iteration 78 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-02 19:56:04,531 INFO L82 PathProgramCache]: Analyzing trace with hash 323031571, now seen corresponding path program 16 times [2018-02-02 19:56:04,532 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 19:56:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:56:04,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:56:05,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1688 backedges. 450 proven. 1238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:05,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:56:05,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-02 19:56:05,442 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 19:56:05,442 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 19:56:05,442 INFO L182 omatonBuilderFactory]: Interpolants [31488#(<= (+ cstrncmp_~s2.offset 9) (select |#length| cstrncmp_~s2.base)), 31489#(<= (+ cstrncmp_~s2.offset 8) (select |#length| cstrncmp_~s2.base)), 31490#(<= (+ cstrncmp_~s2.offset 7) (select |#length| cstrncmp_~s2.base)), 31491#(<= (+ cstrncmp_~s2.offset 6) (select |#length| cstrncmp_~s2.base)), 31492#(<= (+ cstrncmp_~s2.offset 5) (select |#length| cstrncmp_~s2.base)), 31493#(<= (+ cstrncmp_~s2.offset 4) (select |#length| cstrncmp_~s2.base)), 31494#(<= (+ cstrncmp_~s2.offset 3) (select |#length| cstrncmp_~s2.base)), 31495#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (+ |cstrncmp_#t~post3.offset| 1) cstrncmp_~s2.offset)), 31496#(and (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 31497#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 31498#(and (<= 3 cstrncmp_~s2.offset) (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base))), 31499#(and (<= (+ |cstrncmp_#t~pre6.offset| 1) (select |#length| |cstrncmp_#t~pre6.base|)) (<= 2 |cstrncmp_#t~pre6.offset|)), 31456#true, 31457#false, 31458#(= main_~length2~0 (select |#length| |main_#t~malloc21.base|)), 31459#(= main_~length2~0 (select |#length| main_~nondetString2~0.base)), 31460#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (= |cstrlen_#in~str.offset| cstrlen_~s~0.offset)), 31461#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 1) cstrlen_~s~0.offset)), 31462#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 2) cstrlen_~s~0.offset)), 31463#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 3) cstrlen_~s~0.offset)), 31464#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 4) cstrlen_~s~0.offset)), 31465#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 5) cstrlen_~s~0.offset)), 31466#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 6) cstrlen_~s~0.offset)), 31467#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 7) cstrlen_~s~0.offset)), 31468#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 8) cstrlen_~s~0.offset)), 31469#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 9) cstrlen_~s~0.offset)), 31470#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 10) cstrlen_~s~0.offset)), 31471#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 11) cstrlen_~s~0.offset)), 31472#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 12) cstrlen_~s~0.offset)), 31473#(and (<= (+ |cstrlen_#in~str.offset| 13) cstrlen_~s~0.offset) (= |cstrlen_#in~str.base| cstrlen_~s~0.base)), 31474#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 14) cstrlen_~s~0.offset)), 31475#(and (= |cstrlen_#in~str.base| cstrlen_~s~0.base) (<= (+ |cstrlen_#in~str.offset| 15) cstrlen_~s~0.offset)), 31476#(and (= cstrlen_~s~0.base |cstrlen_#in~str.base|) (<= (+ |cstrlen_#in~str.offset| 16) cstrlen_~s~0.offset)), 31477#(<= (+ |cstrlen_#in~str.offset| 17) (select |#length| |cstrlen_#in~str.base|)), 31478#(<= (+ cstrstr_~find.offset 17) (select |#length| cstrstr_~find.base)), 31479#(<= (+ |cstrncmp_#in~s2.offset| 17) (select |#length| |cstrncmp_#in~s2.base|)), 31480#(<= (+ cstrncmp_~s2.offset 17) (select |#length| cstrncmp_~s2.base)), 31481#(<= (+ cstrncmp_~s2.offset 16) (select |#length| cstrncmp_~s2.base)), 31482#(<= (+ cstrncmp_~s2.offset 15) (select |#length| cstrncmp_~s2.base)), 31483#(<= (+ cstrncmp_~s2.offset 14) (select |#length| cstrncmp_~s2.base)), 31484#(<= (+ cstrncmp_~s2.offset 13) (select |#length| cstrncmp_~s2.base)), 31485#(<= (+ cstrncmp_~s2.offset 12) (select |#length| cstrncmp_~s2.base)), 31486#(<= (+ cstrncmp_~s2.offset 11) (select |#length| cstrncmp_~s2.base)), 31487#(<= (+ cstrncmp_~s2.offset 10) (select |#length| cstrncmp_~s2.base))] [2018-02-02 19:56:05,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1688 backedges. 450 proven. 1238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:56:05,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 19:56:05,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 19:56:05,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1582, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 19:56:05,443 INFO L87 Difference]: Start difference. First operand 272 states and 326 transitions. Second operand 44 states. Received shutdown request... [2018-02-02 19:56:06,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-02 19:56:06,752 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 19:56:06,755 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 19:56:06,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 07:56:06 BoogieIcfgContainer [2018-02-02 19:56:06,755 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 19:56:06,756 INFO L168 Benchmark]: Toolchain (without parser) took 70142.75 ms. Allocated memory was 399.0 MB in the beginning and 2.1 GB in the end (delta: 1.7 GB). Free memory was 355.7 MB in the beginning and 1.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 273.6 MB. Max. memory is 5.3 GB. [2018-02-02 19:56:06,756 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 399.0 MB. Free memory is still 362.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:56:06,756 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.37 ms. Allocated memory is still 399.0 MB. Free memory was 355.7 MB in the beginning and 345.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-02 19:56:06,757 INFO L168 Benchmark]: Boogie Preprocessor took 28.55 ms. Allocated memory is still 399.0 MB. Free memory was 345.0 MB in the beginning and 343.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 19:56:06,757 INFO L168 Benchmark]: RCFGBuilder took 325.26 ms. Allocated memory is still 399.0 MB. Free memory was 343.7 MB in the beginning and 315.8 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-02-02 19:56:06,757 INFO L168 Benchmark]: TraceAbstraction took 69608.42 ms. Allocated memory was 399.0 MB in the beginning and 2.1 GB in the end (delta: 1.7 GB). Free memory was 314.5 MB in the beginning and 1.8 GB in the end (delta: -1.5 GB). Peak memory consumption was 232.5 MB. Max. memory is 5.3 GB. [2018-02-02 19:56:06,758 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.15 ms. Allocated memory is still 399.0 MB. Free memory is still 362.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 177.37 ms. Allocated memory is still 399.0 MB. Free memory was 355.7 MB in the beginning and 345.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.55 ms. Allocated memory is still 399.0 MB. Free memory was 345.0 MB in the beginning and 343.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 325.26 ms. Allocated memory is still 399.0 MB. Free memory was 343.7 MB in the beginning and 315.8 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 69608.42 ms. Allocated memory was 399.0 MB in the beginning and 2.1 GB in the end (delta: 1.7 GB). Free memory was 314.5 MB in the beginning and 1.8 GB in the end (delta: -1.5 GB). Peak memory consumption was 232.5 MB. 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 constructing difference of abstraction (272states) and interpolant automaton (currently 64 states, 44 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 64 states, 44 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 64 states, 44 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 64 states, 44 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 64 states, 44 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 64 states, 44 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22. - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 64 states, 44 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 64 states, 44 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 64 states, 44 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 64 states, 44 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 64 states, 44 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 64 states, 44 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 64 states, 44 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 64 states, 44 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 64 states, 44 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 64 states, 44 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 64 states, 44 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 64 states, 44 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 64 states, 44 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 64 states, 44 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 64 states, 44 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 90 locations, 21 error locations. TIMEOUT Result, 69.5s OverallTime, 78 OverallIterations, 17 TraceHistogramMax, 42.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7998 SDtfs, 18093 SDslu, 132852 SDs, 0 SdLazy, 63779 SolverSat, 2134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2910 GetRequests, 201 SyntacticMatches, 10 SemanticMatches, 2698 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31160 ImplicationChecksByTransitivity, 33.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272occurred in iteration=77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 6616/29099 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 77 MinimizatonAttempts, 2729 StatesRemovedByMinimization, 63 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 24.1s InterpolantComputationTime, 8304 NumberOfCodeBlocks, 8304 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 8226 ConstructedInterpolants, 0 QuantifiedInterpolants, 9652816 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 78 InterpolantComputations, 18 PerfectInterpolantSequences, 6616/29099 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_19-56-06-762.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_19-56-06-762.csv Completed graceful shutdown