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/substring-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 15:07:37,666 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 15:07:37,667 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 15:07:37,679 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 15:07:37,680 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 15:07:37,680 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 15:07:37,681 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 15:07:37,682 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 15:07:37,684 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 15:07:37,684 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 15:07:37,685 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 15:07:37,685 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 15:07:37,686 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 15:07:37,687 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 15:07:37,688 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 15:07:37,689 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 15:07:37,691 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 15:07:37,692 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 15:07:37,693 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 15:07:37,694 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 15:07:37,696 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 15:07:37,696 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 15:07:37,696 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 15:07:37,697 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 15:07:37,698 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 15:07:37,699 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 15:07:37,699 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 15:07:37,699 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 15:07:37,699 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 15:07:37,699 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 15:07:37,700 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 15:07:37,700 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 15:07:37,708 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 15:07:37,709 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 15:07:37,710 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 15:07:37,710 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 15:07:37,710 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 15:07:37,710 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 15:07:37,710 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 15:07:37,710 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 15:07:37,711 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 15:07:37,711 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 15:07:37,711 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 15:07:37,711 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 15:07:37,711 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 15:07:37,712 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 15:07:37,712 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 15:07:37,712 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 15:07:37,712 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 15:07:37,712 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 15:07:37,712 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 15:07:37,712 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 15:07:37,713 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 15:07:37,713 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 15:07:37,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 15:07:37,749 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 15:07:37,752 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 15:07:37,753 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 15:07:37,753 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 15:07:37,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-02-04 15:07:37,859 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 15:07:37,860 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 15:07:37,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 15:07:37,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 15:07:37,864 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 15:07:37,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:07:37" (1/1) ... [2018-02-04 15:07:37,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a17581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:37, skipping insertion in model container [2018-02-04 15:07:37,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:07:37" (1/1) ... [2018-02-04 15:07:37,876 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:07:37,905 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:07:37,997 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:07:38,012 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:07:38,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:38 WrapperNode [2018-02-04 15:07:38,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 15:07:38,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 15:07:38,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 15:07:38,017 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 15:07:38,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:38" (1/1) ... [2018-02-04 15:07:38,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:38" (1/1) ... [2018-02-04 15:07:38,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:38" (1/1) ... [2018-02-04 15:07:38,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:38" (1/1) ... [2018-02-04 15:07:38,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:38" (1/1) ... [2018-02-04 15:07:38,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:38" (1/1) ... [2018-02-04 15:07:38,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:38" (1/1) ... [2018-02-04 15:07:38,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 15:07:38,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 15:07:38,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 15:07:38,042 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 15:07:38,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:38" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 15:07:38,105 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 15:07:38,105 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 15:07:38,105 INFO L136 BoogieDeclarations]: Found implementation of procedure substring [2018-02-04 15:07:38,106 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 15:07:38,106 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 15:07:38,106 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 15:07:38,106 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 15:07:38,106 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 15:07:38,106 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 15:07:38,106 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 15:07:38,107 INFO L128 BoogieDeclarations]: Found specification of procedure substring [2018-02-04 15:07:38,107 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 15:07:38,107 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 15:07:38,108 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 15:07:38,280 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 15:07:38,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:07:38 BoogieIcfgContainer [2018-02-04 15:07:38,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 15:07:38,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 15:07:38,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 15:07:38,282 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 15:07:38,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:07:37" (1/3) ... [2018-02-04 15:07:38,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3889bda2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:07:38, skipping insertion in model container [2018-02-04 15:07:38,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:38" (2/3) ... [2018-02-04 15:07:38,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3889bda2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:07:38, skipping insertion in model container [2018-02-04 15:07:38,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:07:38" (3/3) ... [2018-02-04 15:07:38,285 INFO L107 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-02-04 15:07:38,290 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 15:07:38,295 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 15:07:38,316 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 15:07:38,316 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 15:07:38,317 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 15:07:38,317 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 15:07:38,317 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 15:07:38,317 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 15:07:38,317 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 15:07:38,317 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 15:07:38,318 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 15:07:38,329 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-02-04 15:07:38,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 15:07:38,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:38,338 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:38,339 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:38,343 INFO L82 PathProgramCache]: Analyzing trace with hash 680757637, now seen corresponding path program 1 times [2018-02-04 15:07:38,378 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:38,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:38,515 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:38,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:07:38,517 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:38,517 INFO L182 omatonBuilderFactory]: Interpolants [59#true, 60#false, 61#(= 1 (select |#valid| |main_#t~malloc11.base|)), 62#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-02-04 15:07:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:38,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 15:07:38,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 15:07:38,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:07:38,535 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 4 states. [2018-02-04 15:07:38,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:38,693 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-02-04 15:07:38,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 15:07:38,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 15:07:38,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:38,701 INFO L225 Difference]: With dead ends: 55 [2018-02-04 15:07:38,701 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 15:07:38,703 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:07:38,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 15:07:38,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 15:07:38,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 15:07:38,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-02-04 15:07:38,726 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 13 [2018-02-04 15:07:38,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:38,726 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-02-04 15:07:38,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 15:07:38,726 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-02-04 15:07:38,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 15:07:38,727 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:38,727 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:38,727 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:38,727 INFO L82 PathProgramCache]: Analyzing trace with hash 680757638, now seen corresponding path program 1 times [2018-02-04 15:07:38,728 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:38,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:38,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:38,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 15:07:38,841 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:38,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:38,841 INFO L182 omatonBuilderFactory]: Interpolants [176#(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)), 177#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 172#true, 173#false, 174#(<= 1 main_~length1~0), 175#(and (= main_~length1~0 (select |#length| |main_#t~malloc11.base|)) (= (select |#valid| |main_#t~malloc11.base|) 1) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length1~0))] [2018-02-04 15:07:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:38,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 15:07:38,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 15:07:38,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:07:38,844 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2018-02-04 15:07:38,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:38,911 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-02-04 15:07:38,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 15:07:38,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 15:07:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:38,912 INFO L225 Difference]: With dead ends: 51 [2018-02-04 15:07:38,912 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 15:07:38,913 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:07:38,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 15:07:38,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 15:07:38,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 15:07:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-02-04 15:07:38,916 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-02-04 15:07:38,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:38,917 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-02-04 15:07:38,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 15:07:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-02-04 15:07:38,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 15:07:38,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:38,918 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:38,918 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:38,918 INFO L82 PathProgramCache]: Analyzing trace with hash -371349738, now seen corresponding path program 1 times [2018-02-04 15:07:38,919 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:38,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:38,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:38,951 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:38,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:07:38,951 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:38,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:38,952 INFO L182 omatonBuilderFactory]: Interpolants [282#true, 283#false, 284#(= 1 (select |#valid| |main_#t~malloc12.base|)), 285#(= 1 (select |#valid| main_~nondetString2~0.base))] [2018-02-04 15:07:38,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:38,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 15:07:38,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 15:07:38,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:07:38,953 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 4 states. [2018-02-04 15:07:39,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:39,005 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-04 15:07:39,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 15:07:39,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 15:07:39,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:39,006 INFO L225 Difference]: With dead ends: 50 [2018-02-04 15:07:39,006 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 15:07:39,006 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:07:39,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 15:07:39,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 15:07:39,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 15:07:39,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-02-04 15:07:39,011 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 14 [2018-02-04 15:07:39,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:39,011 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-02-04 15:07:39,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 15:07:39,011 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-02-04 15:07:39,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 15:07:39,012 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:39,012 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:39,012 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:39,012 INFO L82 PathProgramCache]: Analyzing trace with hash -371349737, now seen corresponding path program 1 times [2018-02-04 15:07:39,013 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:39,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:39,066 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:39,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 15:07:39,067 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:39,067 INFO L182 omatonBuilderFactory]: Interpolants [388#true, 389#false, 390#(<= 1 main_~length2~0), 391#(and (= 0 |main_#t~malloc12.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc12.base|))), 392#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))] [2018-02-04 15:07:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:39,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:07:39,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:07:39,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:07:39,067 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 5 states. [2018-02-04 15:07:39,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:39,089 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-04 15:07:39,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 15:07:39,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 15:07:39,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:39,090 INFO L225 Difference]: With dead ends: 49 [2018-02-04 15:07:39,091 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 15:07:39,091 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:07:39,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 15:07:39,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 15:07:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 15:07:39,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-02-04 15:07:39,094 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-02-04 15:07:39,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:39,095 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-02-04 15:07:39,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:07:39,095 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-02-04 15:07:39,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 15:07:39,095 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:39,096 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:39,096 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:39,096 INFO L82 PathProgramCache]: Analyzing trace with hash -435796900, now seen corresponding path program 1 times [2018-02-04 15:07:39,097 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:39,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:39,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:39,139 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:39,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 15:07:39,139 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:39,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:39,139 INFO L182 omatonBuilderFactory]: Interpolants [496#(= 1 (select |#valid| |substring_#in~s.base|)), 497#(= 1 (select |#valid| substring_~ps~0.base)), 493#true, 494#false, 495#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-02-04 15:07:39,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:39,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:07:39,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:07:39,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:07:39,140 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-02-04 15:07:39,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:39,189 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-02-04 15:07:39,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:07:39,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 15:07:39,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:39,192 INFO L225 Difference]: With dead ends: 48 [2018-02-04 15:07:39,192 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 15:07:39,193 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:07:39,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 15:07:39,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 15:07:39,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 15:07:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-02-04 15:07:39,197 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 18 [2018-02-04 15:07:39,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:39,197 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-02-04 15:07:39,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:07:39,197 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-02-04 15:07:39,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 15:07:39,198 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:39,198 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:39,198 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:39,198 INFO L82 PathProgramCache]: Analyzing trace with hash -435796899, now seen corresponding path program 1 times [2018-02-04 15:07:39,199 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:39,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:39,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-04 15:07:39,293 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:39,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 15:07:39,293 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:39,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-04 15:07:39,294 INFO L182 omatonBuilderFactory]: Interpolants [596#true, 597#false, 598#(<= 1 main_~length1~0), 599#(and (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length1~0)), 600#(and (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 601#(and (<= (+ main_~nondetString1~0.offset 1) (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 602#(and (= 0 |substring_#in~s.offset|) (<= 1 (select |#length| |substring_#in~s.base|))), 603#(and (= substring_~ps~0.offset 0) (<= 1 (select |#length| substring_~ps~0.base)))] [2018-02-04 15:07:39,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:39,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 15:07:39,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 15:07:39,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:07:39,297 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 8 states. [2018-02-04 15:07:39,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:39,397 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-02-04 15:07:39,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 15:07:39,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-04 15:07:39,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:39,402 INFO L225 Difference]: With dead ends: 72 [2018-02-04 15:07:39,402 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 15:07:39,402 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-04 15:07:39,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 15:07:39,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-02-04 15:07:39,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 15:07:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-02-04 15:07:39,407 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 18 [2018-02-04 15:07:39,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:39,407 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-02-04 15:07:39,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 15:07:39,407 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-02-04 15:07:39,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 15:07:39,408 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:39,408 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] [2018-02-04 15:07:39,408 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:39,408 INFO L82 PathProgramCache]: Analyzing trace with hash 860706905, now seen corresponding path program 1 times [2018-02-04 15:07:39,409 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:39,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:39,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:39,452 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:39,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 15:07:39,452 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:39,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:39,452 INFO L182 omatonBuilderFactory]: Interpolants [736#(= 1 (select |#valid| main_~nondetString2~0.base)), 737#(= 1 (select |#valid| |substring_#in~t.base|)), 738#(= 1 (select |#valid| substring_~t.base)), 739#(= 1 (select |#valid| substring_~pt~0.base)), 734#true, 735#false] [2018-02-04 15:07:39,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:39,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 15:07:39,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 15:07:39,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:07:39,453 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 6 states. [2018-02-04 15:07:39,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:39,516 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-02-04 15:07:39,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 15:07:39,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-02-04 15:07:39,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:39,517 INFO L225 Difference]: With dead ends: 51 [2018-02-04 15:07:39,517 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 15:07:39,517 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:07:39,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 15:07:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-02-04 15:07:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 15:07:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-02-04 15:07:39,519 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 21 [2018-02-04 15:07:39,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:39,519 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-02-04 15:07:39,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 15:07:39,519 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-02-04 15:07:39,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 15:07:39,519 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:39,519 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] [2018-02-04 15:07:39,519 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:39,520 INFO L82 PathProgramCache]: Analyzing trace with hash 860706906, now seen corresponding path program 1 times [2018-02-04 15:07:39,520 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:39,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:39,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:39,622 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:39,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 15:07:39,623 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:39,624 INFO L182 omatonBuilderFactory]: Interpolants [848#(and (= 0 |substring_#in~t.offset|) (<= 1 (select |#length| |substring_#in~t.base|))), 849#(and (<= 1 (select |#length| substring_~t.base)) (= 0 substring_~t.offset)), 850#(and (<= 1 (select |#length| substring_~pt~0.base)) (= substring_~pt~0.offset 0)), 842#true, 843#false, 844#(<= 1 main_~length2~0), 845#(and (= 0 |main_#t~malloc12.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc12.base|))), 846#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 847#(and (= 0 main_~nondetString2~0.offset) (<= 1 (select |#length| main_~nondetString2~0.base)))] [2018-02-04 15:07:39,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:39,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 15:07:39,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 15:07:39,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 15:07:39,625 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 9 states. [2018-02-04 15:07:39,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:39,732 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-02-04 15:07:39,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 15:07:39,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-04 15:07:39,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:39,733 INFO L225 Difference]: With dead ends: 66 [2018-02-04 15:07:39,733 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 15:07:39,734 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-04 15:07:39,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 15:07:39,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-02-04 15:07:39,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 15:07:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2018-02-04 15:07:39,736 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 21 [2018-02-04 15:07:39,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:39,737 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2018-02-04 15:07:39,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 15:07:39,737 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-02-04 15:07:39,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 15:07:39,737 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:39,737 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] [2018-02-04 15:07:39,737 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:39,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1579895137, now seen corresponding path program 1 times [2018-02-04 15:07:39,738 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:39,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:39,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:39,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 15:07:39,769 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:39,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:39,769 INFO L182 omatonBuilderFactory]: Interpolants [979#true, 980#false, 981#(= 1 (select |#valid| main_~nondetString1~0.base)), 982#(= 1 (select |#valid| |substring_#in~s.base|)), 983#(= 1 (select |#valid| substring_~ps~0.base)), 984#(= 1 (select |#valid| substring_~ps2~0.base))] [2018-02-04 15:07:39,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:39,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 15:07:39,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 15:07:39,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:07:39,770 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 6 states. [2018-02-04 15:07:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:39,815 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-02-04 15:07:39,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 15:07:39,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 15:07:39,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:39,816 INFO L225 Difference]: With dead ends: 59 [2018-02-04 15:07:39,816 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 15:07:39,817 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:07:39,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 15:07:39,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-02-04 15:07:39,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 15:07:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-02-04 15:07:39,819 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 25 [2018-02-04 15:07:39,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:39,819 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-02-04 15:07:39,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 15:07:39,819 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-02-04 15:07:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 15:07:39,819 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:39,819 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] [2018-02-04 15:07:39,819 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:39,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1579895136, now seen corresponding path program 1 times [2018-02-04 15:07:39,820 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:39,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:39,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:39,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:39,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 15:07:39,889 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:39,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:39,890 INFO L182 omatonBuilderFactory]: Interpolants [1104#false, 1105#(= 0 |main_#t~malloc11.offset|), 1106#(= 0 main_~nondetString1~0.offset), 1107#(= 0 |substring_#in~s.offset|), 1108#(= substring_~ps~0.offset 0), 1109#(and (= substring_~ps~0.offset 0) (<= (+ substring_~ps~0.offset 1) (select |#length| substring_~ps~0.base))), 1110#(and (<= 1 (select |#length| substring_~ps2~0.base)) (= substring_~ps2~0.offset 0)), 1103#true] [2018-02-04 15:07:39,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:39,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 15:07:39,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 15:07:39,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:07:39,891 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 8 states. [2018-02-04 15:07:40,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:40,002 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2018-02-04 15:07:40,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 15:07:40,003 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-02-04 15:07:40,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:40,004 INFO L225 Difference]: With dead ends: 92 [2018-02-04 15:07:40,004 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 15:07:40,004 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-02-04 15:07:40,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 15:07:40,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2018-02-04 15:07:40,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 15:07:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-02-04 15:07:40,008 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 25 [2018-02-04 15:07:40,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:40,008 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-02-04 15:07:40,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 15:07:40,008 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-02-04 15:07:40,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 15:07:40,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:40,009 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] [2018-02-04 15:07:40,009 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:40,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1731827764, now seen corresponding path program 1 times [2018-02-04 15:07:40,010 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:40,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:40,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:40,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:07:40,028 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:40,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:40,029 INFO L182 omatonBuilderFactory]: Interpolants [1275#true, 1276#false, 1277#(not |substring_#t~short4|)] [2018-02-04 15:07:40,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:40,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 15:07:40,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 15:07:40,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 15:07:40,030 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 3 states. [2018-02-04 15:07:40,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:40,035 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-02-04 15:07:40,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 15:07:40,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-02-04 15:07:40,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:40,036 INFO L225 Difference]: With dead ends: 64 [2018-02-04 15:07:40,036 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 15:07:40,037 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 15:07:40,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 15:07:40,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-04 15:07:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 15:07:40,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-02-04 15:07:40,040 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 26 [2018-02-04 15:07:40,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:40,040 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-02-04 15:07:40,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 15:07:40,040 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2018-02-04 15:07:40,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 15:07:40,041 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:40,041 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] [2018-02-04 15:07:40,041 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:40,041 INFO L82 PathProgramCache]: Analyzing trace with hash -2135151184, now seen corresponding path program 1 times [2018-02-04 15:07:40,042 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:40,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:40,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:40,079 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:40,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 15:07:40,080 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:40,080 INFO L182 omatonBuilderFactory]: Interpolants [1408#(= (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset) |substring_#t~mem1|), 1409#(or (= 0 (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)) |substring_#t~short4|), 1410#(= 0 (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)), 1411#(= 0 |substring_#t~mem7|), 1406#true, 1407#false] [2018-02-04 15:07:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:40,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 15:07:40,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 15:07:40,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:07:40,081 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 6 states. [2018-02-04 15:07:40,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:40,136 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-02-04 15:07:40,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 15:07:40,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-04 15:07:40,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:40,138 INFO L225 Difference]: With dead ends: 70 [2018-02-04 15:07:40,138 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 15:07:40,138 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-04 15:07:40,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 15:07:40,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-02-04 15:07:40,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 15:07:40,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-02-04 15:07:40,141 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 28 [2018-02-04 15:07:40,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:40,141 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-02-04 15:07:40,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 15:07:40,142 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-02-04 15:07:40,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 15:07:40,142 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:40,142 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-04 15:07:40,142 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:40,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1750130544, now seen corresponding path program 1 times [2018-02-04 15:07:40,143 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:40,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:40,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-04 15:07:40,254 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:40,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 15:07:40,255 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:40,255 INFO L182 omatonBuilderFactory]: Interpolants [1555#true, 1556#false, 1557#(= |#valid| |old(#valid)|), 1558#(and (= |old(#valid)| (store |#valid| |main_#t~malloc11.base| 0)) (= (select |#valid| |main_#t~malloc11.base|) 1)), 1559#(and (= |old(#valid)| (store |#valid| |main_#t~malloc11.base| 0)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.base |main_#t~malloc11.base|)), 1560#(and (not (= |main_#t~malloc11.base| |main_#t~malloc12.base|)) (= (store (store |#valid| |main_#t~malloc12.base| 0) |main_#t~malloc11.base| (select (store |#valid| |main_#t~malloc11.base| 0) |main_#t~malloc11.base|)) |old(#valid)|)), 1561#(= (store |#valid| |main_#t~malloc12.base| 0) |old(#valid)|)] [2018-02-04 15:07:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:40,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 15:07:40,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 15:07:40,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:07:40,255 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 7 states. [2018-02-04 15:07:40,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:40,330 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-02-04 15:07:40,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 15:07:40,330 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-02-04 15:07:40,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:40,331 INFO L225 Difference]: With dead ends: 66 [2018-02-04 15:07:40,331 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 15:07:40,331 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-04 15:07:40,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 15:07:40,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 15:07:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 15:07:40,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-02-04 15:07:40,336 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 28 [2018-02-04 15:07:40,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:40,336 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-02-04 15:07:40,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 15:07:40,337 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-02-04 15:07:40,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 15:07:40,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:40,337 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:40,337 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:40,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1520679734, now seen corresponding path program 1 times [2018-02-04 15:07:40,338 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:40,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:40,517 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:40,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 15:07:40,517 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:40,518 INFO L182 omatonBuilderFactory]: Interpolants [1696#(and (or (<= 2 (select |#length| substring_~pt~0.base)) (not |substring_#t~short4|)) (= substring_~pt~0.offset 0)), 1697#(and (<= 2 (select |#length| substring_~pt~0.base)) (= substring_~pt~0.offset 0)), 1698#(and (<= (+ substring_~pt~0.offset 1) (select |#length| substring_~pt~0.base)) (<= 1 substring_~pt~0.offset)), 1686#true, 1687#false, 1688#(<= 1 main_~length2~0), 1689#(and (= 0 |main_#t~malloc12.offset|) (<= 1 main_~length2~0)), 1690#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0)), 1691#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset)) (<= 2 (select |#length| main_~nondetString2~0.base)))), 1692#(and (= 0 |substring_#in~t.offset|) (or (<= 2 (select |#length| |substring_#in~t.base|)) (= 0 (select (select |#memory_int| |substring_#in~t.base|) |substring_#in~t.offset|)))), 1693#(and (or (= 0 (select (select |#memory_int| substring_~t.base) substring_~t.offset)) (<= 2 (select |#length| substring_~t.base))) (= 0 substring_~t.offset)), 1694#(and (or (= 0 (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)) (<= 2 (select |#length| substring_~pt~0.base))) (= substring_~pt~0.offset 0)), 1695#(and (or (<= 2 (select |#length| substring_~pt~0.base)) (and (= 0 (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)) (= |substring_#t~mem1| (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)))) (= substring_~pt~0.offset 0))] [2018-02-04 15:07:40,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:40,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 15:07:40,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 15:07:40,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 15:07:40,518 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 13 states. [2018-02-04 15:07:40,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:40,743 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-02-04 15:07:40,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 15:07:40,744 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-02-04 15:07:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:40,744 INFO L225 Difference]: With dead ends: 77 [2018-02-04 15:07:40,744 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 15:07:40,745 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-02-04 15:07:40,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 15:07:40,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2018-02-04 15:07:40,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 15:07:40,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-02-04 15:07:40,747 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 29 [2018-02-04 15:07:40,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:40,748 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-02-04 15:07:40,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 15:07:40,748 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-02-04 15:07:40,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 15:07:40,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:40,748 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] [2018-02-04 15:07:40,749 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:40,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1085357266, now seen corresponding path program 1 times [2018-02-04 15:07:40,750 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:40,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:40,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:40,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 15:07:40,901 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:40,902 INFO L182 omatonBuilderFactory]: Interpolants [1856#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 1857#(and (= (select |#valid| |main_#t~malloc11.base|) 1) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length1~0) (<= main_~length1~0 1)), 1858#(and (= (select |#valid| main_~nondetString1~0.base) 1) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 1859#(and (not (= main_~nondetString1~0.base |main_#t~malloc12.base|)) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 1860#(and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 1861#(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)), 1862#(= 0 (select (select |#memory_int| |substring_#in~s.base|) |substring_#in~s.offset|)), 1863#(= 0 (select (select |#memory_int| substring_~ps~0.base) substring_~ps~0.offset)), 1864#(and (= 0 (select (select |#memory_int| substring_~ps~0.base) substring_~ps~0.offset)) (= |substring_#t~mem0| (select (select |#memory_int| substring_~ps~0.base) substring_~ps~0.offset))), 1854#true, 1855#false] [2018-02-04 15:07:40,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:40,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 15:07:40,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 15:07:40,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 15:07:40,902 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 11 states. [2018-02-04 15:07:41,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:41,077 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-02-04 15:07:41,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 15:07:41,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-02-04 15:07:41,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:41,078 INFO L225 Difference]: With dead ends: 74 [2018-02-04 15:07:41,078 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 15:07:41,078 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-02-04 15:07:41,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 15:07:41,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-02-04 15:07:41,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 15:07:41,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-02-04 15:07:41,080 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 31 [2018-02-04 15:07:41,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:41,081 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-02-04 15:07:41,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 15:07:41,081 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-02-04 15:07:41,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 15:07:41,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:41,081 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] [2018-02-04 15:07:41,081 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:41,081 INFO L82 PathProgramCache]: Analyzing trace with hash -944808656, now seen corresponding path program 1 times [2018-02-04 15:07:41,082 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:41,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:41,252 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:41,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 15:07:41,252 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:41,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-04 15:07:41,252 INFO L182 omatonBuilderFactory]: Interpolants [2016#(and (= (select |#valid| |main_#t~malloc11.base|) 1) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length1~0)), 2017#(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)), 2018#(and (or (not (= main_~nondetString1~0.base |main_#t~malloc12.base|)) (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1))) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 2019#(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)), 2020#(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)))), 2021#(and (or (= 0 (select (select |#memory_int| |substring_#in~s.base|) |substring_#in~s.offset|)) (<= 2 (select |#length| |substring_#in~s.base|))) (= 0 |substring_#in~s.offset|)), 2022#(and (= substring_~ps~0.offset 0) (or (= 0 (select (select |#memory_int| substring_~ps~0.base) substring_~ps~0.offset)) (<= 2 (select |#length| substring_~ps~0.base)))), 2023#(and (= substring_~ps~0.offset 0) (or (<= 2 (select |#length| substring_~ps~0.base)) (and (= 0 (select (select |#memory_int| substring_~ps~0.base) substring_~ps~0.offset)) (= |substring_#t~mem0| (select (select |#memory_int| substring_~ps~0.base) substring_~ps~0.offset))))), 2024#(and (= substring_~ps~0.offset 0) (<= 2 (select |#length| substring_~ps~0.base))), 2025#(and (<= 1 substring_~ps~0.offset) (<= (+ substring_~ps~0.offset 1) (select |#length| substring_~ps~0.base))), 2013#true, 2014#false, 2015#(<= 1 main_~length1~0)] [2018-02-04 15:07:41,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:41,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 15:07:41,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 15:07:41,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-02-04 15:07:41,253 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 13 states. [2018-02-04 15:07:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:41,519 INFO L93 Difference]: Finished difference Result 125 states and 143 transitions. [2018-02-04 15:07:41,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 15:07:41,520 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-02-04 15:07:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:41,520 INFO L225 Difference]: With dead ends: 125 [2018-02-04 15:07:41,520 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 15:07:41,522 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-02-04 15:07:41,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 15:07:41,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2018-02-04 15:07:41,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 15:07:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2018-02-04 15:07:41,524 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 31 [2018-02-04 15:07:41,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:41,525 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2018-02-04 15:07:41,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 15:07:41,525 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2018-02-04 15:07:41,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 15:07:41,525 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:41,525 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:41,525 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:41,525 INFO L82 PathProgramCache]: Analyzing trace with hash -749073262, now seen corresponding path program 1 times [2018-02-04 15:07:41,526 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:41,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:41,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:41,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:41,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 15:07:41,774 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:41,774 INFO L182 omatonBuilderFactory]: Interpolants [2252#true, 2253#false, 2254#(<= 1 main_~length1~0), 2255#(and (= (select |#valid| |main_#t~malloc11.base|) 1) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length1~0)), 2256#(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)), 2257#(and (or (not (= main_~nondetString1~0.base |main_#t~malloc12.base|)) (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1))) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 2258#(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)), 2259#(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)))), 2260#(and (or (= 0 (select (select |#memory_int| |substring_#in~s.base|) |substring_#in~s.offset|)) (<= 2 (select |#length| |substring_#in~s.base|))) (= 0 |substring_#in~s.offset|)), 2261#(and (= 0 substring_~ps~0.offset) (or (= 0 (select (select |#memory_int| substring_~ps~0.base) substring_~ps~0.offset)) (<= 2 (select |#length| substring_~ps~0.base)))), 2262#(and (= substring_~ps2~0.offset 0) (or (<= 2 (select |#length| substring_~ps2~0.base)) (= 0 (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)))), 2263#(and (or (<= 2 (select |#length| substring_~ps2~0.base)) (and (= 0 (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)) (= |substring_#t~mem1| (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)))) (= substring_~ps2~0.offset 0)), 2264#(and (= substring_~ps2~0.offset 0) (or (<= 2 (select |#length| substring_~ps2~0.base)) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))) (not |substring_#t~short4|))), 2265#(and (= substring_~ps2~0.offset 0) (or (<= 2 (select |#length| substring_~ps2~0.base)) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))))), 2266#(and (or (<= 2 (select |#length| substring_~ps2~0.base)) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) |substring_#t~mem2|))) (= substring_~ps2~0.offset 0)), 2267#(and (or (and (= |substring_#t~mem3| (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) |substring_#t~mem2|))) (<= 2 (select |#length| substring_~ps2~0.base))) (= substring_~ps2~0.offset 0)), 2268#(and (or (<= 2 (select |#length| substring_~ps2~0.base)) (not |substring_#t~short4|)) (= substring_~ps2~0.offset 0)), 2269#(and (<= 1 substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 1) (select |#length| substring_~ps2~0.base)))] [2018-02-04 15:07:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:41,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 15:07:41,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 15:07:41,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-02-04 15:07:41,775 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand 18 states. [2018-02-04 15:07:42,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:42,218 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2018-02-04 15:07:42,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 15:07:42,218 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-02-04 15:07:42,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:42,219 INFO L225 Difference]: With dead ends: 100 [2018-02-04 15:07:42,219 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 15:07:42,219 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=926, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 15:07:42,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 15:07:42,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2018-02-04 15:07:42,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 15:07:42,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2018-02-04 15:07:42,221 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 33 [2018-02-04 15:07:42,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:42,221 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2018-02-04 15:07:42,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 15:07:42,221 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2018-02-04 15:07:42,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 15:07:42,222 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:42,222 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 15:07:42,222 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:42,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1199657404, now seen corresponding path program 1 times [2018-02-04 15:07:42,223 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:42,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:42,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:42,466 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:42,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 15:07:42,466 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:42,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:42,466 INFO L182 omatonBuilderFactory]: Interpolants [2496#(and (<= 1 substring_~pt~0.offset) (or (<= (+ substring_~pt~0.offset 2) (select |#length| substring_~pt~0.base)) (and (= 0 (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)) (= 1 substring_~pt~0.offset) (= |substring_#t~mem1| (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))))), 2497#(and (<= 1 substring_~pt~0.offset) (or (<= (+ substring_~pt~0.offset 2) (select |#length| substring_~pt~0.base)) (and (= 1 substring_~pt~0.offset) (not |substring_#t~short4|)))), 2498#(and (<= (+ substring_~pt~0.offset 2) (select |#length| substring_~pt~0.base)) (<= 1 substring_~pt~0.offset)), 2499#(and (<= 2 substring_~pt~0.offset) (<= (+ substring_~pt~0.offset 1) (select |#length| substring_~pt~0.base))), 2487#true, 2488#false, 2489#(and (= 0 |main_#t~malloc12.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc12.base|))), 2490#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 2491#(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))))), 2492#(and (or (<= (select |#length| |substring_#in~t.base|) 1) (= 0 (select (select |#memory_int| |substring_#in~t.base|) 1)) (<= 3 (select |#length| |substring_#in~t.base|))) (= 0 |substring_#in~t.offset|)), 2493#(and (or (= 0 (select (select |#memory_int| substring_~t.base) 1)) (<= 3 (select |#length| substring_~t.base)) (<= (select |#length| substring_~t.base) 1)) (= 0 substring_~t.offset)), 2494#(and (or (<= (select |#length| substring_~pt~0.base) 1) (<= 3 (select |#length| substring_~pt~0.base)) (= 0 (select (select |#memory_int| substring_~pt~0.base) 1))) (= substring_~pt~0.offset 0)), 2495#(and (or (<= (+ substring_~pt~0.offset 2) (select |#length| substring_~pt~0.base)) (and (= 0 (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)) (= 1 substring_~pt~0.offset)) (<= (select |#length| substring_~pt~0.base) substring_~pt~0.offset)) (<= 1 substring_~pt~0.offset))] [2018-02-04 15:07:42,466 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:42,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 15:07:42,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 15:07:42,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 15:07:42,467 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand 13 states. [2018-02-04 15:07:42,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:42,803 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2018-02-04 15:07:42,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 15:07:42,803 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-02-04 15:07:42,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:42,805 INFO L225 Difference]: With dead ends: 134 [2018-02-04 15:07:42,805 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 15:07:42,805 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2018-02-04 15:07:42,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 15:07:42,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 101. [2018-02-04 15:07:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 15:07:42,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 120 transitions. [2018-02-04 15:07:42,808 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 120 transitions. Word has length 37 [2018-02-04 15:07:42,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:42,809 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 120 transitions. [2018-02-04 15:07:42,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 15:07:42,809 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2018-02-04 15:07:42,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 15:07:42,809 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:42,809 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 15:07:42,809 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:42,809 INFO L82 PathProgramCache]: Analyzing trace with hash -86467987, now seen corresponding path program 1 times [2018-02-04 15:07:42,810 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:42,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:42,899 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-04 15:07:42,899 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:42,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 15:07:42,899 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:42,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:42,899 INFO L182 omatonBuilderFactory]: Interpolants [2753#true, 2754#false, 2755#(= 0 |main_#t~malloc11.offset|), 2756#(= 0 main_~nondetString1~0.offset), 2757#(= 0 |substring_#in~s.offset|), 2758#(= substring_~ps~0.offset 0), 2759#(<= 1 substring_~ps~0.offset), 2760#(and (<= 1 substring_~ps~0.offset) (<= (+ substring_~ps~0.offset 1) (select |#length| substring_~ps~0.base))), 2761#(and (<= 1 substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 1) (select |#length| substring_~ps2~0.base)))] [2018-02-04 15:07:42,899 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-04 15:07:42,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 15:07:42,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 15:07:42,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 15:07:42,900 INFO L87 Difference]: Start difference. First operand 101 states and 120 transitions. Second operand 9 states. [2018-02-04 15:07:43,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:43,030 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2018-02-04 15:07:43,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 15:07:43,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-02-04 15:07:43,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:43,032 INFO L225 Difference]: With dead ends: 113 [2018-02-04 15:07:43,032 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 15:07:43,032 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-02-04 15:07:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 15:07:43,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2018-02-04 15:07:43,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 15:07:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2018-02-04 15:07:43,035 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 38 [2018-02-04 15:07:43,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:43,035 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2018-02-04 15:07:43,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 15:07:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2018-02-04 15:07:43,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 15:07:43,036 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:43,036 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-04 15:07:43,036 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:43,036 INFO L82 PathProgramCache]: Analyzing trace with hash 516501250, now seen corresponding path program 2 times [2018-02-04 15:07:43,037 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:43,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:43,553 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:43,554 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:43,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 15:07:43,554 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:43,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:43,554 INFO L182 omatonBuilderFactory]: Interpolants [2988#true, 2989#false, 2990#(and (= main_~length1~0 (select |#length| |main_#t~malloc11.base|)) (= (select |#valid| |main_#t~malloc11.base|) 1) (= 0 |main_#t~malloc11.offset|)), 2991#(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))), 2992#(and (= 0 main_~nondetString1~0.offset) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2)) (or (not (= main_~nondetString1~0.base |main_#t~malloc12.base|)) (not (= (+ main_~nondetString1~0.offset main_~length1~0) 2)))), 2993#(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))), 2994#(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)), 2995#(and (or (<= 3 (select |#length| |substring_#in~s.base|)) (<= (select |#length| |substring_#in~s.base|) 1) (= 0 (select (select |#memory_int| |substring_#in~s.base|) 1))) (= 0 |substring_#in~s.offset|)), 2996#(and (= 0 substring_~ps~0.offset) (or (= 0 (select (select |#memory_int| substring_~ps~0.base) 1)) (<= 3 (select |#length| substring_~ps~0.base)) (<= (select |#length| substring_~ps~0.base) 1))), 2997#(and (= substring_~ps2~0.offset 0) (or (= 0 (select (select |#memory_int| substring_~ps2~0.base) 1)) (<= 3 (select |#length| substring_~ps2~0.base)) (<= (select |#length| substring_~ps2~0.base) 1))), 2998#(or (and (<= 1 substring_~ps2~0.offset) (or (<= (select |#length| substring_~ps2~0.base) substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)))) (and (= 1 substring_~ps2~0.offset) (= 0 (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)))), 2999#(or (and (= 1 substring_~ps2~0.offset) (= 0 (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)) (= |substring_#t~mem1| (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))) (and (<= 1 substring_~ps2~0.offset) (or (<= (select |#length| substring_~ps2~0.base) substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base))))), 3000#(or (and (<= 1 substring_~ps2~0.offset) (or (<= (select |#length| substring_~ps2~0.base) substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)))) (and (or (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))) (not |substring_#t~short4|)) (= 1 substring_~ps2~0.offset))), 3001#(or (and (<= 1 substring_~ps2~0.offset) (or (<= (select |#length| substring_~ps2~0.base) substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)))) (and (= 1 substring_~ps2~0.offset) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))))), 3002#(or (and (<= 1 substring_~ps2~0.offset) (or (<= (select |#length| substring_~ps2~0.base) substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)))) (and (= 1 substring_~ps2~0.offset) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) |substring_#t~mem2|)))), 3003#(or (and (= 1 substring_~ps2~0.offset) (= |substring_#t~mem3| (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) |substring_#t~mem2|))) (and (<= 1 substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)))), 3004#(or (and (= 1 substring_~ps2~0.offset) (not |substring_#t~short4|)) (and (<= 1 substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)))), 3005#(and (<= 2 substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 1) (select |#length| substring_~ps2~0.base)))] [2018-02-04 15:07:43,554 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:43,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 15:07:43,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 15:07:43,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-02-04 15:07:43,555 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand 18 states. [2018-02-04 15:07:44,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:44,430 INFO L93 Difference]: Finished difference Result 121 states and 134 transitions. [2018-02-04 15:07:44,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 15:07:44,430 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-02-04 15:07:44,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:44,431 INFO L225 Difference]: With dead ends: 121 [2018-02-04 15:07:44,431 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 15:07:44,431 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=199, Invalid=1061, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 15:07:44,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 15:07:44,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 101. [2018-02-04 15:07:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 15:07:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 118 transitions. [2018-02-04 15:07:44,433 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 118 transitions. Word has length 41 [2018-02-04 15:07:44,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:44,434 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 118 transitions. [2018-02-04 15:07:44,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 15:07:44,434 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 118 transitions. [2018-02-04 15:07:44,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 15:07:44,434 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:44,434 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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] [2018-02-04 15:07:44,434 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:44,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1929782981, now seen corresponding path program 2 times [2018-02-04 15:07:44,435 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:44,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:44,708 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:44,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:44,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 15:07:44,709 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:44,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:44,709 INFO L182 omatonBuilderFactory]: Interpolants [3264#true, 3265#false, 3266#(and (= main_~length1~0 (select |#length| |main_#t~malloc11.base|)) (= (select |#valid| |main_#t~malloc11.base|) 1) (= 0 |main_#t~malloc11.offset|)), 3267#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 3268#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (or (not (= main_~nondetString1~0.base |main_#t~malloc12.base|)) (not (= 2 (+ main_~nondetString1~0.offset main_~length1~0)))) (= main_~nondetString1~0.offset 0)), 3269#(and (= 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)), 3270#(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)) (= main_~nondetString1~0.offset 0)), 3271#(and (or (<= 3 (select |#length| |substring_#in~s.base|)) (<= (select |#length| |substring_#in~s.base|) 1) (= 0 (select (select |#memory_int| |substring_#in~s.base|) 1))) (= 0 |substring_#in~s.offset|)), 3272#(and (= substring_~ps~0.offset 0) (or (= 0 (select (select |#memory_int| substring_~ps~0.base) 1)) (<= 3 (select |#length| substring_~ps~0.base)) (<= (select |#length| substring_~ps~0.base) 1))), 3273#(or (<= (select |#length| substring_~ps~0.base) substring_~ps~0.offset) (and (<= 1 substring_~ps~0.offset) (<= (+ substring_~ps~0.offset 2) (select |#length| substring_~ps~0.base))) (and (<= substring_~ps~0.offset 1) (= 0 (select (select |#memory_int| substring_~ps~0.base) 1)) (<= 1 substring_~ps~0.offset))), 3274#(or (and (<= substring_~ps~0.offset 1) (= 0 (select (select |#memory_int| substring_~ps~0.base) 1)) (<= 1 substring_~ps~0.offset) (= |substring_#t~mem0| (select (select |#memory_int| substring_~ps~0.base) substring_~ps~0.offset))) (and (<= 1 substring_~ps~0.offset) (<= (+ substring_~ps~0.offset 2) (select |#length| substring_~ps~0.base)))), 3275#(and (= substring_~ps~0.offset substring_~ps2~0.offset) (<= 1 substring_~ps~0.offset) (<= (+ substring_~ps~0.offset 2) (select |#length| substring_~ps~0.base))), 3276#(and (<= 1 substring_~ps~0.offset) (<= (+ substring_~ps~0.offset 2) (select |#length| substring_~ps~0.base))), 3277#(and (<= (+ substring_~ps~0.offset 1) (select |#length| substring_~ps~0.base)) (<= 2 substring_~ps~0.offset))] [2018-02-04 15:07:44,709 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:44,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 15:07:44,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 15:07:44,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-04 15:07:44,710 INFO L87 Difference]: Start difference. First operand 101 states and 118 transitions. Second operand 14 states. [2018-02-04 15:07:45,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:45,002 INFO L93 Difference]: Finished difference Result 195 states and 222 transitions. [2018-02-04 15:07:45,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 15:07:45,002 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-02-04 15:07:45,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:45,003 INFO L225 Difference]: With dead ends: 195 [2018-02-04 15:07:45,003 INFO L226 Difference]: Without dead ends: 195 [2018-02-04 15:07:45,003 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-02-04 15:07:45,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-04 15:07:45,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 139. [2018-02-04 15:07:45,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-04 15:07:45,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 167 transitions. [2018-02-04 15:07:45,006 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 167 transitions. Word has length 44 [2018-02-04 15:07:45,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:45,007 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 167 transitions. [2018-02-04 15:07:45,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 15:07:45,007 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 167 transitions. [2018-02-04 15:07:45,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 15:07:45,007 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:45,007 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 15:07:45,007 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:45,007 INFO L82 PathProgramCache]: Analyzing trace with hash 683260972, now seen corresponding path program 2 times [2018-02-04 15:07:45,008 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:45,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:45,129 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 15:07:45,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:45,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 15:07:45,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:45,130 INFO L182 omatonBuilderFactory]: Interpolants [3632#true, 3633#false, 3634#(and (= 0 |main_#t~malloc12.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc12.base|))), 3635#(and (= main_~nondetString2~0.offset 0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 3636#(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)))))), 3637#(= 0 (select (select |#memory_int| |substring_#in~t.base|) (+ (select |#length| |substring_#in~t.base|) (- 1)))), 3638#(= 0 (select (select |#memory_int| substring_~t.base) (+ (select |#length| substring_~t.base) (- 1)))), 3639#(= 0 (select (select |#memory_int| substring_~pt~0.base) (+ (select |#length| substring_~pt~0.base) (- 1)))), 3640#(or (= 0 (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)) (<= (+ substring_~pt~0.offset 2) (select |#length| substring_~pt~0.base)) (<= (select |#length| substring_~pt~0.base) substring_~pt~0.offset)), 3641#(and (or (<= (+ substring_~pt~0.offset 2) (select |#length| substring_~pt~0.base)) (and (= 0 (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)) (= |substring_#t~mem1| (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)))) (<= 0 substring_~pt~0.offset)), 3642#(and (or (<= (+ substring_~pt~0.offset 2) (select |#length| substring_~pt~0.base)) (not |substring_#t~short4|)) (<= 0 substring_~pt~0.offset)), 3643#(and (<= (+ substring_~pt~0.offset 2) (select |#length| substring_~pt~0.base)) (<= 0 substring_~pt~0.offset)), 3644#(and (<= (+ substring_~pt~0.offset 1) (select |#length| substring_~pt~0.base)) (<= 1 substring_~pt~0.offset))] [2018-02-04 15:07:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 15:07:45,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 15:07:45,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 15:07:45,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 15:07:45,131 INFO L87 Difference]: Start difference. First operand 139 states and 167 transitions. Second operand 13 states. [2018-02-04 15:07:45,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:45,351 INFO L93 Difference]: Finished difference Result 151 states and 172 transitions. [2018-02-04 15:07:45,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 15:07:45,351 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-02-04 15:07:45,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:45,352 INFO L225 Difference]: With dead ends: 151 [2018-02-04 15:07:45,352 INFO L226 Difference]: Without dead ends: 149 [2018-02-04 15:07:45,352 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-02-04 15:07:45,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-04 15:07:45,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 93. [2018-02-04 15:07:45,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 15:07:45,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-02-04 15:07:45,355 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 45 [2018-02-04 15:07:45,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:45,355 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-02-04 15:07:45,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 15:07:45,355 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-02-04 15:07:45,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 15:07:45,356 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:45,356 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-02-04 15:07:45,356 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:45,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1878372829, now seen corresponding path program 1 times [2018-02-04 15:07:45,356 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:45,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:45,774 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:45,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:45,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 15:07:45,774 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:45,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:45,775 INFO L182 omatonBuilderFactory]: Interpolants [3911#true, 3912#false, 3913#(and (= main_~length1~0 (select |#length| |main_#t~malloc11.base|)) (= (select |#valid| |main_#t~malloc11.base|) 1) (= 0 |main_#t~malloc11.offset|)), 3914#(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))), 3915#(and (= 0 main_~nondetString1~0.offset) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2)) (or (not (= main_~nondetString1~0.base |main_#t~malloc12.base|)) (not (= (+ main_~nondetString1~0.offset main_~length1~0) 2)))), 3916#(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))), 3917#(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)), 3918#(and (or (<= 3 (select |#length| |substring_#in~s.base|)) (<= (select |#length| |substring_#in~s.base|) 1) (= 0 (select (select |#memory_int| |substring_#in~s.base|) 1))) (= 0 |substring_#in~s.offset|)), 3919#(and (= substring_~ps~0.offset 0) (or (= 0 (select (select |#memory_int| substring_~ps~0.base) 1)) (<= 3 (select |#length| substring_~ps~0.base)) (<= (select |#length| substring_~ps~0.base) 1))), 3920#(or (<= (select |#length| substring_~ps~0.base) substring_~ps~0.offset) (and (= 0 (select (select |#memory_int| substring_~ps~0.base) 1)) (= 1 substring_~ps~0.offset)) (<= (+ substring_~ps~0.offset 2) (select |#length| substring_~ps~0.base))), 3921#(or (and (= 0 (select (select |#memory_int| substring_~ps~0.base) 1)) (= 1 substring_~ps~0.offset)) (<= (+ substring_~ps~0.offset 2) (select |#length| substring_~ps~0.base))), 3922#(or (= 0 (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base))), 3923#(or (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)) (and (= 0 (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)) (= |substring_#t~mem1| (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)))), 3924#(or (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))) (not |substring_#t~short4|) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base))), 3925#(or (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base))), 3926#(or (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) |substring_#t~mem2|))), 3927#(or (and (= |substring_#t~mem3| (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) |substring_#t~mem2|))) (and (<= 0 substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)))), 3928#(or (not |substring_#t~short4|) (and (<= 0 substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)))), 3929#(and (<= 1 substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 1) (select |#length| substring_~ps2~0.base)))] [2018-02-04 15:07:45,775 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:45,775 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 15:07:45,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 15:07:45,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-02-04 15:07:45,775 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 19 states. [2018-02-04 15:07:46,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:46,343 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2018-02-04 15:07:46,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 15:07:46,343 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-02-04 15:07:46,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:46,343 INFO L225 Difference]: With dead ends: 115 [2018-02-04 15:07:46,343 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 15:07:46,344 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=1113, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 15:07:46,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 15:07:46,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2018-02-04 15:07:46,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 15:07:46,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2018-02-04 15:07:46,345 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 46 [2018-02-04 15:07:46,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:46,345 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2018-02-04 15:07:46,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 15:07:46,346 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2018-02-04 15:07:46,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 15:07:46,346 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:46,346 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:46,346 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:46,346 INFO L82 PathProgramCache]: Analyzing trace with hash 2145837426, now seen corresponding path program 3 times [2018-02-04 15:07:46,347 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:46,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:46,579 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 15:07:46,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:46,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 15:07:46,580 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:46,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:46,580 INFO L182 omatonBuilderFactory]: Interpolants [4192#(or (= 0 (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)) (<= (select |#length| substring_~ps2~0.base) substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base))), 4193#(or (<= (select |#length| substring_~ps2~0.base) substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)) (and (= 0 (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)) (= |substring_#t~mem1| (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset)))), 4194#(or (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))) (not |substring_#t~short4|) (<= (select |#length| substring_~ps2~0.base) substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base))), 4195#(or (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) (select (select |#memory_int| substring_~pt~0.base) substring_~pt~0.offset))) (<= (select |#length| substring_~ps2~0.base) substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base))), 4196#(or (<= (select |#length| substring_~ps2~0.base) substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) |substring_#t~mem2|))), 4197#(or (and (= |substring_#t~mem3| (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset)) (not (= (select (select |#memory_int| substring_~ps2~0.base) substring_~ps2~0.offset) |substring_#t~mem2|))) (and (<= 0 substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)))), 4198#(or (not |substring_#t~short4|) (and (<= 0 substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps2~0.base)))), 4199#(and (<= 1 substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 1) (select |#length| substring_~ps2~0.base))), 4182#true, 4183#false, 4184#(and (= main_~length1~0 (select |#length| |main_#t~malloc11.base|)) (= (select |#valid| |main_#t~malloc11.base|) 1) (= 0 |main_#t~malloc11.offset|)), 4185#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 4186#(and (not (= main_~nondetString1~0.base |main_#t~malloc12.base|)) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 4187#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 4188#(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)), 4189#(= 0 (select (select |#memory_int| |substring_#in~s.base|) (+ (select |#length| |substring_#in~s.base|) (- 1)))), 4190#(= 0 (select (select |#memory_int| substring_~ps~0.base) (+ (select |#length| substring_~ps~0.base) (- 1)))), 4191#(= 0 (select (select |#memory_int| substring_~ps2~0.base) (+ (select |#length| substring_~ps2~0.base) (- 1))))] [2018-02-04 15:07:46,580 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 15:07:46,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 15:07:46,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 15:07:46,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-04 15:07:46,581 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand 18 states. [2018-02-04 15:07:47,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:47,365 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-02-04 15:07:47,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 15:07:47,365 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-02-04 15:07:47,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:47,366 INFO L225 Difference]: With dead ends: 117 [2018-02-04 15:07:47,366 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 15:07:47,366 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=322, Invalid=1160, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 15:07:47,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 15:07:47,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 58. [2018-02-04 15:07:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 15:07:47,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-02-04 15:07:47,368 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 49 [2018-02-04 15:07:47,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:47,368 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-02-04 15:07:47,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 15:07:47,368 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-02-04 15:07:47,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 15:07:47,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:47,369 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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] [2018-02-04 15:07:47,369 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-02-04 15:07:47,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1377863440, now seen corresponding path program 3 times [2018-02-04 15:07:47,375 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:47,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:47,531 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-04 15:07:47,531 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:47,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 15:07:47,532 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:47,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:47,532 INFO L182 omatonBuilderFactory]: Interpolants [4417#true, 4418#false, 4419#(and (= main_~length1~0 (select |#length| |main_#t~malloc11.base|)) (= (select |#valid| |main_#t~malloc11.base|) 1) (= 0 |main_#t~malloc11.offset|)), 4420#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 4421#(and (not (= main_~nondetString1~0.base |main_#t~malloc12.base|)) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 4422#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 4423#(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)), 4424#(= 0 (select (select |#memory_int| |substring_#in~s.base|) (+ (select |#length| |substring_#in~s.base|) (- 1)))), 4425#(= 0 (select (select |#memory_int| substring_~ps~0.base) (+ (select |#length| substring_~ps~0.base) (- 1)))), 4426#(and (<= (+ substring_~ps~0.offset 1) (select |#length| substring_~ps~0.base)) (or (and (= 0 (select (select |#memory_int| substring_~ps~0.base) (+ (+ substring_~ps~0.offset 1) (- 1)))) (= |substring_#t~mem0| (select (select |#memory_int| substring_~ps~0.base) substring_~ps~0.offset))) (<= (+ substring_~ps~0.offset 2) (select |#length| substring_~ps~0.base))) (<= 0 substring_~ps~0.offset)), 4427#(and (= substring_~ps~0.offset substring_~ps2~0.offset) (<= (+ substring_~ps2~0.offset 2) (select |#length| substring_~ps~0.base)) (<= 0 substring_~ps~0.offset)), 4428#(and (<= 0 substring_~ps~0.offset) (<= (+ substring_~ps~0.offset 2) (select |#length| substring_~ps~0.base))), 4429#(and (<= 1 substring_~ps~0.offset) (<= (+ substring_~ps~0.offset 1) (select |#length| substring_~ps~0.base)))] [2018-02-04 15:07:47,532 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-04 15:07:47,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 15:07:47,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 15:07:47,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 15:07:47,533 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 13 states. [2018-02-04 15:07:47,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:47,773 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-02-04 15:07:47,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 15:07:47,773 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-02-04 15:07:47,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:47,774 INFO L225 Difference]: With dead ends: 87 [2018-02-04 15:07:47,774 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 15:07:47,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2018-02-04 15:07:47,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 15:07:47,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 15:07:47,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 15:07:47,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 15:07:47,774 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2018-02-04 15:07:47,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:47,774 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 15:07:47,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 15:07:47,775 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 15:07:47,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 15:07:47,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:07:47 BoogieIcfgContainer [2018-02-04 15:07:47,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 15:07:47,778 INFO L168 Benchmark]: Toolchain (without parser) took 9918.44 ms. Allocated memory was 407.4 MB in the beginning and 848.8 MB in the end (delta: 441.5 MB). Free memory was 365.4 MB in the beginning and 486.4 MB in the end (delta: -121.0 MB). Peak memory consumption was 320.5 MB. Max. memory is 5.3 GB. [2018-02-04 15:07:47,779 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 407.4 MB. Free memory is still 370.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 15:07:47,779 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.16 ms. Allocated memory is still 407.4 MB. Free memory was 364.1 MB in the beginning and 353.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 15:07:47,779 INFO L168 Benchmark]: Boogie Preprocessor took 24.05 ms. Allocated memory is still 407.4 MB. Free memory was 353.5 MB in the beginning and 352.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 15:07:47,780 INFO L168 Benchmark]: RCFGBuilder took 238.60 ms. Allocated memory is still 407.4 MB. Free memory was 352.2 MB in the beginning and 331.0 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. [2018-02-04 15:07:47,780 INFO L168 Benchmark]: TraceAbstraction took 9497.38 ms. Allocated memory was 407.4 MB in the beginning and 848.8 MB in the end (delta: 441.5 MB). Free memory was 331.0 MB in the beginning and 486.4 MB in the end (delta: -155.4 MB). Peak memory consumption was 286.0 MB. Max. memory is 5.3 GB. [2018-02-04 15:07:47,781 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 407.4 MB. Free memory is still 370.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 156.16 ms. Allocated memory is still 407.4 MB. Free memory was 364.1 MB in the beginning and 353.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.05 ms. Allocated memory is still 407.4 MB. Free memory was 353.5 MB in the beginning and 352.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 238.60 ms. Allocated memory is still 407.4 MB. Free memory was 352.2 MB in the beginning and 331.0 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9497.38 ms. Allocated memory was 407.4 MB in the beginning and 848.8 MB in the end (delta: 441.5 MB). Free memory was 331.0 MB in the beginning and 486.4 MB in the end (delta: -155.4 MB). Peak memory consumption was 286.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 56 locations, 15 error locations. SAFE Result, 9.4s OverallTime, 25 OverallIterations, 4 TraceHistogramMax, 5.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 879 SDtfs, 2130 SDslu, 3088 SDs, 0 SdLazy, 4027 SolverSat, 248 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 418 GetRequests, 39 SyntacticMatches, 11 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1205 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 39/214 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 389 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 745 NumberOfCodeBlocks, 745 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 720 ConstructedInterpolants, 0 QuantifiedInterpolants, 256594 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 14 PerfectInterpolantSequences, 39/214 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_15-07-47-785.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_15-07-47-785.csv Received shutdown request...