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/subseq-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 01:53:18,222 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:53:18,224 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:53:18,236 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:53:18,236 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:53:18,237 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:53:18,238 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:53:18,239 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:53:18,241 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:53:18,242 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:53:18,242 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:53:18,242 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:53:18,243 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:53:18,244 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:53:18,244 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:53:18,246 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:53:18,248 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:53:18,249 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:53:18,250 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:53:18,251 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:53:18,253 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:53:18,253 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:53:18,253 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:53:18,254 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:53:18,255 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:53:18,256 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:53:18,256 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:53:18,257 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:53:18,257 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:53:18,257 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:53:18,258 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:53:18,258 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 01:53:18,268 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:53:18,268 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:53:18,270 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:53:18,270 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:53:18,270 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:53:18,270 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:53:18,270 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:53:18,271 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:53:18,271 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:53:18,271 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:53:18,271 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:53:18,271 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:53:18,271 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:53:18,271 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:53:18,272 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:53:18,272 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:53:18,272 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:53:18,272 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:53:18,272 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:53:18,272 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:53:18,272 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:53:18,273 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:53:18,273 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 01:53:18,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:53:18,312 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:53:18,316 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:53:18,317 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:53:18,317 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:53:18,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:53:18,463 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:53:18,464 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:53:18,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:53:18,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:53:18,470 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:53:18,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:53:18" (1/1) ... [2018-02-04 01:53:18,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a53858a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:18, skipping insertion in model container [2018-02-04 01:53:18,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:53:18" (1/1) ... [2018-02-04 01:53:18,488 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:53:18,514 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:53:18,604 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:53:18,615 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:53:18,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:18 WrapperNode [2018-02-04 01:53:18,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:53:18,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:53:18,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:53:18,620 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:53:18,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:18" (1/1) ... [2018-02-04 01:53:18,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:18" (1/1) ... [2018-02-04 01:53:18,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:18" (1/1) ... [2018-02-04 01:53:18,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:18" (1/1) ... [2018-02-04 01:53:18,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:18" (1/1) ... [2018-02-04 01:53:18,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:18" (1/1) ... [2018-02-04 01:53:18,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:18" (1/1) ... [2018-02-04 01:53:18,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:53:18,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:53:18,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:53:18,643 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:53:18,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:18" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:53:18,679 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:53:18,679 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:53:18,679 INFO L136 BoogieDeclarations]: Found implementation of procedure subseq [2018-02-04 01:53:18,679 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:53:18,679 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 01:53:18,680 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 01:53:18,680 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 01:53:18,680 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 01:53:18,680 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 01:53:18,680 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 01:53:18,680 INFO L128 BoogieDeclarations]: Found specification of procedure subseq [2018-02-04 01:53:18,680 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:53:18,680 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:53:18,680 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:53:18,853 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:53:18,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:53:18 BoogieIcfgContainer [2018-02-04 01:53:18,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:53:18,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:53:18,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:53:18,858 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:53:18,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:53:18" (1/3) ... [2018-02-04 01:53:18,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74104122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:53:18, skipping insertion in model container [2018-02-04 01:53:18,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:53:18" (2/3) ... [2018-02-04 01:53:18,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74104122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:53:18, skipping insertion in model container [2018-02-04 01:53:18,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:53:18" (3/3) ... [2018-02-04 01:53:18,860 INFO L107 eAbstractionObserver]: Analyzing ICFG subseq-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:53:18,865 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:53:18,869 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 01:53:18,898 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:53:18,898 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:53:18,899 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 01:53:18,899 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 01:53:18,899 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:53:18,899 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:53:18,899 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:53:18,899 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:53:18,899 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:53:18,908 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-02-04 01:53:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 01:53:18,916 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:18,916 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:18,917 INFO L371 AbstractCegarLoop]: === Iteration 1 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:53:18,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1068442526, now seen corresponding path program 1 times [2018-02-04 01:53:18,954 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:18,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:19,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:53:19,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:53:19,076 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:19,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:19,076 INFO L182 omatonBuilderFactory]: Interpolants [58#true, 59#false, 60#(= 1 (select |#valid| |main_#t~malloc10.base|)), 61#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-02-04 01:53:19,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:19,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:53:19,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:53:19,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:53:19,090 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-02-04 01:53:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:19,245 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-02-04 01:53:19,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:53:19,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 01:53:19,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:19,254 INFO L225 Difference]: With dead ends: 54 [2018-02-04 01:53:19,254 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 01:53:19,255 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:53:19,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 01:53:19,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 01:53:19,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 01:53:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-02-04 01:53:19,280 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-02-04 01:53:19,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:19,280 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-02-04 01:53:19,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:53:19,280 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-02-04 01:53:19,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 01:53:19,281 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:19,281 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:19,281 INFO L371 AbstractCegarLoop]: === Iteration 2 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:53:19,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1068442527, now seen corresponding path program 1 times [2018-02-04 01:53:19,282 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:19,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:19,376 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:53:19,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:53:19,377 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:19,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:19,377 INFO L182 omatonBuilderFactory]: Interpolants [169#true, 170#false, 171#(<= 1 main_~length1~0), 172#(and (= 0 |main_#t~malloc10.offset|) (<= 1 main_~length1~0) (= main_~length1~0 (select |#length| |main_#t~malloc10.base|)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 173#(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)), 174#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0))] [2018-02-04 01:53:19,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:19,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:53:19,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:53:19,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:53:19,378 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 6 states. [2018-02-04 01:53:19,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:19,424 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-04 01:53:19,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:53:19,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 01:53:19,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:19,425 INFO L225 Difference]: With dead ends: 50 [2018-02-04 01:53:19,425 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 01:53:19,426 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:53:19,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 01:53:19,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 01:53:19,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 01:53:19,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-02-04 01:53:19,430 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 13 [2018-02-04 01:53:19,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:19,430 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-02-04 01:53:19,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:53:19,431 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-02-04 01:53:19,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 01:53:19,431 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:19,431 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:19,431 INFO L371 AbstractCegarLoop]: === Iteration 3 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:53:19,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1238020018, now seen corresponding path program 1 times [2018-02-04 01:53:19,433 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:19,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:19,469 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:53:19,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:53:19,469 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:19,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:19,469 INFO L182 omatonBuilderFactory]: Interpolants [277#true, 278#false, 279#(= 1 (select |#valid| |main_#t~malloc11.base|)), 280#(= 1 (select |#valid| main_~nondetString2~0.base))] [2018-02-04 01:53:19,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:19,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:53:19,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:53:19,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:53:19,470 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 4 states. [2018-02-04 01:53:19,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:19,520 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-04 01:53:19,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:53:19,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 01:53:19,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:19,521 INFO L225 Difference]: With dead ends: 49 [2018-02-04 01:53:19,521 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 01:53:19,521 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:53:19,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 01:53:19,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 01:53:19,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 01:53:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-02-04 01:53:19,526 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-02-04 01:53:19,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:19,526 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-02-04 01:53:19,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:53:19,527 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-02-04 01:53:19,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 01:53:19,527 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:19,527 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:19,527 INFO L371 AbstractCegarLoop]: === Iteration 4 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:53:19,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1238020017, now seen corresponding path program 1 times [2018-02-04 01:53:19,528 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:19,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:19,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:19,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:53:19,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:53:19,599 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:19,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:19,600 INFO L182 omatonBuilderFactory]: Interpolants [384#(and (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 385#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 381#true, 382#false, 383#(<= 1 main_~length2~0)] [2018-02-04 01:53:19,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:19,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:53:19,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:53:19,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:53:19,601 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-02-04 01:53:19,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:19,660 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-02-04 01:53:19,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:53:19,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 01:53:19,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:19,661 INFO L225 Difference]: With dead ends: 48 [2018-02-04 01:53:19,661 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 01:53:19,662 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:53:19,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 01:53:19,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 01:53:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 01:53:19,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-02-04 01:53:19,666 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 14 [2018-02-04 01:53:19,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:19,666 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-02-04 01:53:19,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:53:19,666 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-02-04 01:53:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 01:53:19,667 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:19,667 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:19,667 INFO L371 AbstractCegarLoop]: === Iteration 5 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:53:19,667 INFO L82 PathProgramCache]: Analyzing trace with hash -9248999, now seen corresponding path program 1 times [2018-02-04 01:53:19,668 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:19,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:19,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:19,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:53:19,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:53:19,715 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:19,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:19,715 INFO L182 omatonBuilderFactory]: Interpolants [484#true, 485#false, 486#(= 1 (select |#valid| main_~nondetString1~0.base)), 487#(= 1 (select |#valid| |subseq_#in~s.base|)), 488#(= 1 (select |#valid| subseq_~ps~0.base))] [2018-02-04 01:53:19,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:19,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:53:19,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:53:19,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:53:19,716 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 5 states. [2018-02-04 01:53:19,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:19,761 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-02-04 01:53:19,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:53:19,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 01:53:19,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:19,762 INFO L225 Difference]: With dead ends: 46 [2018-02-04 01:53:19,762 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 01:53:19,763 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:53:19,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 01:53:19,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 01:53:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 01:53:19,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-02-04 01:53:19,769 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 18 [2018-02-04 01:53:19,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:19,769 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-02-04 01:53:19,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:53:19,769 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-02-04 01:53:19,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 01:53:19,770 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:19,770 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:19,770 INFO L371 AbstractCegarLoop]: === Iteration 6 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:53:19,770 INFO L82 PathProgramCache]: Analyzing trace with hash -9248998, now seen corresponding path program 1 times [2018-02-04 01:53:19,771 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:19,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:19,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:19,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:53:19,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:53:19,862 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:19,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:19,863 INFO L182 omatonBuilderFactory]: Interpolants [583#true, 584#false, 585#(<= 1 main_~length1~0), 586#(and (= 0 |main_#t~malloc10.offset|) (<= 1 main_~length1~0)), 587#(and (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 588#(and (<= (+ main_~nondetString1~0.offset 1) (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 589#(and (<= 1 (select |#length| |subseq_#in~s.base|)) (= 0 |subseq_#in~s.offset|)), 590#(and (<= 1 (select |#length| subseq_~ps~0.base)) (= subseq_~ps~0.offset 0))] [2018-02-04 01:53:19,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:19,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:53:19,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:53:19,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:53:19,864 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 8 states. [2018-02-04 01:53:19,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:19,979 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-02-04 01:53:19,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:53:19,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-04 01:53:19,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:19,981 INFO L225 Difference]: With dead ends: 67 [2018-02-04 01:53:19,981 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 01:53:19,982 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:53:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 01:53:19,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2018-02-04 01:53:19,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 01:53:19,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-02-04 01:53:19,987 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 18 [2018-02-04 01:53:19,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:19,988 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-02-04 01:53:19,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:53:19,988 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-02-04 01:53:19,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 01:53:19,988 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:19,988 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 01:53:19,988 INFO L371 AbstractCegarLoop]: === Iteration 7 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:53:19,988 INFO L82 PathProgramCache]: Analyzing trace with hash -659041035, now seen corresponding path program 1 times [2018-02-04 01:53:19,989 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:19,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:20,034 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:53:20,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:53:20,034 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:20,035 INFO L182 omatonBuilderFactory]: Interpolants [723#true, 724#false, 725#(= 1 (select |#valid| main_~nondetString2~0.base)), 726#(= 1 (select |#valid| |subseq_#in~t.base|)), 727#(= 1 (select |#valid| subseq_~pt~0.base))] [2018-02-04 01:53:20,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:20,035 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:53:20,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:53:20,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:53:20,036 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 5 states. [2018-02-04 01:53:20,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:20,086 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-02-04 01:53:20,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:53:20,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-02-04 01:53:20,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:20,087 INFO L225 Difference]: With dead ends: 54 [2018-02-04 01:53:20,088 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 01:53:20,088 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:53:20,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 01:53:20,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 01:53:20,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 01:53:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-02-04 01:53:20,091 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 21 [2018-02-04 01:53:20,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:20,091 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-02-04 01:53:20,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:53:20,091 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-02-04 01:53:20,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 01:53:20,092 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:20,092 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 01:53:20,092 INFO L371 AbstractCegarLoop]: === Iteration 8 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:53:20,092 INFO L82 PathProgramCache]: Analyzing trace with hash -659041034, now seen corresponding path program 1 times [2018-02-04 01:53:20,093 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:20,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:20,168 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:53:20,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:53:20,168 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:20,169 INFO L182 omatonBuilderFactory]: Interpolants [838#true, 839#false, 840#(<= 1 main_~length2~0), 841#(and (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 842#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 843#(and (= 0 main_~nondetString2~0.offset) (<= 1 (select |#length| main_~nondetString2~0.base))), 844#(and (= 0 |subseq_#in~t.offset|) (<= 1 (select |#length| |subseq_#in~t.base|))), 845#(and (= subseq_~pt~0.offset 0) (<= 1 (select |#length| subseq_~pt~0.base)))] [2018-02-04 01:53:20,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:20,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:53:20,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:53:20,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:53:20,170 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 8 states. [2018-02-04 01:53:20,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:20,263 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2018-02-04 01:53:20,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:53:20,266 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-04 01:53:20,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:20,267 INFO L225 Difference]: With dead ends: 70 [2018-02-04 01:53:20,267 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 01:53:20,268 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:53:20,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 01:53:20,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2018-02-04 01:53:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 01:53:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-02-04 01:53:20,272 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 21 [2018-02-04 01:53:20,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:20,272 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-02-04 01:53:20,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:53:20,272 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-02-04 01:53:20,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 01:53:20,273 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:20,273 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:20,273 INFO L371 AbstractCegarLoop]: === Iteration 9 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:53:20,274 INFO L82 PathProgramCache]: Analyzing trace with hash 753859844, now seen corresponding path program 1 times [2018-02-04 01:53:20,274 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:20,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:20,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:53:20,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:53:20,301 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:20,302 INFO L182 omatonBuilderFactory]: Interpolants [984#true, 985#false, 986#(not |subseq_#t~short2|)] [2018-02-04 01:53:20,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:20,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 01:53:20,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 01:53:20,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 01:53:20,305 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 3 states. [2018-02-04 01:53:20,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:20,309 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-02-04 01:53:20,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 01:53:20,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-02-04 01:53:20,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:20,311 INFO L225 Difference]: With dead ends: 67 [2018-02-04 01:53:20,311 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 01:53:20,311 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 01:53:20,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 01:53:20,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-02-04 01:53:20,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 01:53:20,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2018-02-04 01:53:20,319 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 27 [2018-02-04 01:53:20,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:20,319 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2018-02-04 01:53:20,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 01:53:20,319 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2018-02-04 01:53:20,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 01:53:20,320 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:20,320 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:20,320 INFO L371 AbstractCegarLoop]: === Iteration 10 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:53:20,321 INFO L82 PathProgramCache]: Analyzing trace with hash 199156551, now seen corresponding path program 1 times [2018-02-04 01:53:20,321 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:20,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:20,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:53:20,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-04 01:53:20,553 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:20,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 01:53:20,554 INFO L182 omatonBuilderFactory]: Interpolants [1120#true, 1121#false, 1122#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 1123#(and (= 0 |main_#t~malloc10.offset|) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= (select |#valid| |main_#t~malloc10.base|) 1)), 1124#(and (= (select |#valid| main_~nondetString1~0.base) 1) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 1125#(and (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 1126#(and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 1127#(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)), 1128#(= 0 (select (select |#memory_int| |subseq_#in~s.base|) |subseq_#in~s.offset|)), 1129#(= 0 (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)), 1130#(and (= |subseq_#t~mem1| (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)) (= 0 (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset))), 1131#(or (not (= (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset) (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset))) (not |subseq_#t~short2|)), 1132#(not (= (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset) (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset))), 1133#(and (not (= (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset) (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset))) (= |subseq_#t~mem3| (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset))), 1134#(not (= |subseq_#t~mem3| |subseq_#t~mem4|))] [2018-02-04 01:53:20,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:20,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 01:53:20,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 01:53:20,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:53:20,554 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 15 states. [2018-02-04 01:53:20,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:20,831 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2018-02-04 01:53:20,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 01:53:20,832 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-02-04 01:53:20,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:20,832 INFO L225 Difference]: With dead ends: 112 [2018-02-04 01:53:20,832 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 01:53:20,832 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2018-02-04 01:53:20,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 01:53:20,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2018-02-04 01:53:20,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 01:53:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2018-02-04 01:53:20,837 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 29 [2018-02-04 01:53:20,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:20,838 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2018-02-04 01:53:20,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 01:53:20,838 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2018-02-04 01:53:20,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 01:53:20,839 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:20,839 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:20,839 INFO L371 AbstractCegarLoop]: === Iteration 11 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:53:20,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1606281783, now seen corresponding path program 1 times [2018-02-04 01:53:20,840 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:20,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:21,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:21,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 01:53:21,118 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:21,118 INFO L182 omatonBuilderFactory]: Interpolants [1376#false, 1377#(<= 1 main_~length1~0), 1378#(and (= 0 |main_#t~malloc10.offset|) (<= 1 main_~length1~0) (= (select |#valid| |main_#t~malloc10.base|) 1)), 1379#(and (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 1380#(and (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 1381#(and (<= 1 main_~length1~0) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 1382#(and (= 0 main_~nondetString1~0.offset) (or (= 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)) (<= 2 (select |#length| main_~nondetString1~0.base))) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 1383#(and (or (<= 2 (select |#length| |subseq_#in~s.base|)) (= 0 (select (select |#memory_int| |subseq_#in~s.base|) |subseq_#in~s.offset|))) (= 0 |subseq_#in~s.offset|)), 1384#(and (or (<= 2 (select |#length| subseq_~ps~0.base)) (= 0 (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset))) (= subseq_~ps~0.offset 0)), 1385#(and (or (and (= |subseq_#t~mem1| (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)) (= 0 (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset))) (<= 2 (select |#length| subseq_~ps~0.base))) (= subseq_~ps~0.offset 0)), 1386#(and (or (<= 2 (select |#length| subseq_~ps~0.base)) (not (= (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset) (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset))) (not |subseq_#t~short2|)) (= subseq_~ps~0.offset 0)), 1387#(and (or (<= 2 (select |#length| subseq_~ps~0.base)) (not (= (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset) (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)))) (= subseq_~ps~0.offset 0)), 1388#(and (or (<= 2 (select |#length| subseq_~ps~0.base)) (and (not (= (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset) (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset))) (= |subseq_#t~mem3| (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)))) (= subseq_~ps~0.offset 0)), 1389#(and (or (<= 2 (select |#length| subseq_~ps~0.base)) (not (= |subseq_#t~mem3| |subseq_#t~mem4|))) (= subseq_~ps~0.offset 0)), 1390#(and (<= (+ subseq_~ps~0.offset 1) (select |#length| subseq_~ps~0.base)) (<= 1 subseq_~ps~0.offset)), 1375#true] [2018-02-04 01:53:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:21,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 01:53:21,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 01:53:21,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:53:21,119 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand 16 states. [2018-02-04 01:53:21,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:21,581 INFO L93 Difference]: Finished difference Result 129 states and 153 transitions. [2018-02-04 01:53:21,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 01:53:21,583 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-02-04 01:53:21,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:21,583 INFO L225 Difference]: With dead ends: 129 [2018-02-04 01:53:21,583 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 01:53:21,584 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2018-02-04 01:53:21,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 01:53:21,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 113. [2018-02-04 01:53:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 01:53:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 139 transitions. [2018-02-04 01:53:21,588 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 139 transitions. Word has length 29 [2018-02-04 01:53:21,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:21,588 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 139 transitions. [2018-02-04 01:53:21,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 01:53:21,588 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 139 transitions. [2018-02-04 01:53:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 01:53:21,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:21,589 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:21,591 INFO L371 AbstractCegarLoop]: === Iteration 12 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:53:21,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1713594616, now seen corresponding path program 1 times [2018-02-04 01:53:21,592 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:21,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:21,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:21,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:53:21,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:53:21,654 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:21,654 INFO L182 omatonBuilderFactory]: Interpolants [1664#(and (= |old(#valid)| (store |#valid| |main_#t~malloc10.base| 0)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 1665#(and (not (= |main_#t~malloc10.base| |main_#t~malloc11.base|)) (= |old(#valid)| (store (store |#valid| |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0))), 1666#(= |old(#valid)| (store |#valid| |main_#t~malloc11.base| 0)), 1661#true, 1662#false, 1663#(= |#valid| |old(#valid)|)] [2018-02-04 01:53:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:21,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:53:21,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:53:21,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:53:21,655 INFO L87 Difference]: Start difference. First operand 113 states and 139 transitions. Second operand 6 states. [2018-02-04 01:53:21,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:21,733 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2018-02-04 01:53:21,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:53:21,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 01:53:21,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:21,734 INFO L225 Difference]: With dead ends: 112 [2018-02-04 01:53:21,734 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 01:53:21,734 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:53:21,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 01:53:21,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-02-04 01:53:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 01:53:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2018-02-04 01:53:21,737 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 31 [2018-02-04 01:53:21,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:21,737 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2018-02-04 01:53:21,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:53:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2018-02-04 01:53:21,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 01:53:21,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:21,742 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:21,742 INFO L371 AbstractCegarLoop]: === Iteration 13 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:53:21,743 INFO L82 PathProgramCache]: Analyzing trace with hash -797033429, now seen corresponding path program 1 times [2018-02-04 01:53:21,743 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:21,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:21,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 01:53:21,917 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:53:21,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 01:53:21,917 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:21,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:21,918 INFO L182 omatonBuilderFactory]: Interpolants [1888#(not |subseq_#t~short2|), 1877#true, 1878#false, 1879#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 1880#(and (= 0 |main_#t~malloc10.offset|) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= (select |#valid| |main_#t~malloc10.base|) 1)), 1881#(and (= (select |#valid| main_~nondetString1~0.base) 1) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 1882#(and (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 1883#(and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 1884#(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)), 1885#(= 0 (select (select |#memory_int| |subseq_#in~s.base|) |subseq_#in~s.offset|)), 1886#(= 0 (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)), 1887#(and (= |subseq_#t~mem0| (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)) (= 0 (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)))] [2018-02-04 01:53:21,918 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 01:53:21,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 01:53:21,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 01:53:21,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:53:21,919 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand 12 states. [2018-02-04 01:53:22,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:22,079 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2018-02-04 01:53:22,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 01:53:22,079 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-02-04 01:53:22,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:22,080 INFO L225 Difference]: With dead ends: 78 [2018-02-04 01:53:22,080 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 01:53:22,080 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-02-04 01:53:22,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 01:53:22,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-02-04 01:53:22,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 01:53:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2018-02-04 01:53:22,083 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 32 [2018-02-04 01:53:22,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:22,083 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2018-02-04 01:53:22,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 01:53:22,083 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2018-02-04 01:53:22,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 01:53:22,084 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:22,084 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:22,084 INFO L371 AbstractCegarLoop]: === Iteration 14 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:53:22,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1784966119, now seen corresponding path program 1 times [2018-02-04 01:53:22,085 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:22,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:22,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:22,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:22,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 01:53:22,191 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:22,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:22,192 INFO L182 omatonBuilderFactory]: Interpolants [2048#(<= 1 main_~length2~0), 2049#(and (<= 1 main_~length2~0) (= 0 |main_#t~malloc11.offset|)), 2050#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0)), 2051#(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)))), 2052#(and (= 0 |subseq_#in~t.offset|) (or (<= 2 (select |#length| |subseq_#in~t.base|)) (= 0 (select (select |#memory_int| |subseq_#in~t.base|) |subseq_#in~t.offset|)))), 2053#(and (= subseq_~pt~0.offset 0) (or (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)) (<= 2 (select |#length| subseq_~pt~0.base)))), 2054#(and (= subseq_~pt~0.offset 0) (or (<= 2 (select |#length| subseq_~pt~0.base)) (and (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)) (= |subseq_#t~mem1| (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset))))), 2055#(and (= subseq_~pt~0.offset 0) (or (<= 2 (select |#length| subseq_~pt~0.base)) (not |subseq_#t~short2|))), 2056#(and (= subseq_~pt~0.offset 0) (<= 2 (select |#length| subseq_~pt~0.base))), 2057#(and (<= 1 subseq_~pt~0.offset) (<= (+ subseq_~pt~0.offset 1) (select |#length| subseq_~pt~0.base))), 2046#true, 2047#false] [2018-02-04 01:53:22,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:22,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 01:53:22,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 01:53:22,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:53:22,192 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 12 states. [2018-02-04 01:53:22,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:22,326 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2018-02-04 01:53:22,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 01:53:22,327 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-02-04 01:53:22,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:22,327 INFO L225 Difference]: With dead ends: 93 [2018-02-04 01:53:22,327 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 01:53:22,327 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-02-04 01:53:22,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 01:53:22,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2018-02-04 01:53:22,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 01:53:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2018-02-04 01:53:22,329 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 32 [2018-02-04 01:53:22,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:22,329 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2018-02-04 01:53:22,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 01:53:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2018-02-04 01:53:22,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 01:53:22,330 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:22,330 INFO L351 BasicCegarLoop]: trace histogram [3, 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 01:53:22,330 INFO L371 AbstractCegarLoop]: === Iteration 15 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:53:22,330 INFO L82 PathProgramCache]: Analyzing trace with hash -553518792, now seen corresponding path program 2 times [2018-02-04 01:53:22,330 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:22,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:22,651 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:22,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:22,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 01:53:22,651 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:22,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:22,652 INFO L182 omatonBuilderFactory]: Interpolants [2251#true, 2252#false, 2253#(and (= 0 |main_#t~malloc10.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc10.base|)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 2254#(and (= 0 main_~nondetString1~0.offset) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= 2 (+ main_~nondetString1~0.offset main_~length1~0))) (= (select |#valid| main_~nondetString1~0.base) 1)), 2255#(and (= 0 main_~nondetString1~0.offset) (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= 2 (+ main_~nondetString1~0.offset main_~length1~0)))), 2256#(and (= 0 main_~nondetString1~0.offset) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= 2 (+ main_~nondetString1~0.offset main_~length1~0))) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 2257#(and (or (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) 1)) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1)) (= 0 main_~nondetString1~0.offset) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 2258#(and (or (<= 3 (select |#length| |subseq_#in~s.base|)) (<= (select |#length| |subseq_#in~s.base|) 1) (= 0 (select (select |#memory_int| |subseq_#in~s.base|) 1))) (= 0 |subseq_#in~s.offset|)), 2259#(and (or (<= (select |#length| subseq_~ps~0.base) 1) (<= 3 (select |#length| subseq_~ps~0.base)) (= 0 (select (select |#memory_int| subseq_~ps~0.base) 1))) (= subseq_~ps~0.offset 0)), 2260#(and (or (<= (+ subseq_~ps~0.offset 2) (select |#length| subseq_~ps~0.base)) (<= (select |#length| subseq_~ps~0.base) subseq_~ps~0.offset) (= 0 (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset))) (= 1 subseq_~ps~0.offset)), 2261#(and (or (<= (+ subseq_~ps~0.offset 2) (select |#length| subseq_~ps~0.base)) (and (= |subseq_#t~mem0| (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)) (= 0 (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)))) (= 1 subseq_~ps~0.offset)), 2262#(and (or (<= (+ subseq_~ps~0.offset 2) (select |#length| subseq_~ps~0.base)) (not |subseq_#t~short2|)) (= 1 subseq_~ps~0.offset)), 2263#(and (<= (+ subseq_~ps~0.offset 2) (select |#length| subseq_~ps~0.base)) (= 1 subseq_~ps~0.offset)), 2264#(and (<= (+ subseq_~ps~0.offset 1) (select |#length| subseq_~ps~0.base)) (<= 2 subseq_~ps~0.offset))] [2018-02-04 01:53:22,652 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:22,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 01:53:22,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 01:53:22,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:53:22,653 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand 14 states. [2018-02-04 01:53:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:22,954 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2018-02-04 01:53:22,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 01:53:22,954 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-02-04 01:53:22,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:22,955 INFO L225 Difference]: With dead ends: 120 [2018-02-04 01:53:22,955 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 01:53:22,955 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2018-02-04 01:53:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 01:53:22,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 97. [2018-02-04 01:53:22,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 01:53:22,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 116 transitions. [2018-02-04 01:53:22,958 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 116 transitions. Word has length 40 [2018-02-04 01:53:22,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:22,958 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 116 transitions. [2018-02-04 01:53:22,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 01:53:22,958 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 116 transitions. [2018-02-04 01:53:22,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 01:53:22,959 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:22,959 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:22,959 INFO L371 AbstractCegarLoop]: === Iteration 16 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:53:22,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1498931688, now seen corresponding path program 2 times [2018-02-04 01:53:22,960 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:22,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:23,346 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:23,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 01:53:23,346 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:23,347 INFO L182 omatonBuilderFactory]: Interpolants [2502#true, 2503#false, 2504#(and (= main_~length2~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 2505#(and (= 0 main_~nondetString2~0.offset) (or (= (+ main_~nondetString2~0.offset main_~length2~0) 2) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))), 2506#(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))))), 2507#(and (= 0 |subseq_#in~t.offset|) (or (= 0 (select (select |#memory_int| |subseq_#in~t.base|) 1)) (<= 3 (select |#length| |subseq_#in~t.base|)) (<= (select |#length| |subseq_#in~t.base|) 1))), 2508#(and (= subseq_~pt~0.offset 0) (or (<= (select |#length| subseq_~pt~0.base) 1) (= 0 (select (select |#memory_int| subseq_~pt~0.base) 1)) (<= 3 (select |#length| subseq_~pt~0.base)))), 2509#(or (and (= 1 subseq_~pt~0.offset) (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset))) (and (<= 1 subseq_~pt~0.offset) (or (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= (select |#length| subseq_~pt~0.base) subseq_~pt~0.offset)))), 2510#(or (and (<= 1 subseq_~pt~0.offset) (or (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= (select |#length| subseq_~pt~0.base) subseq_~pt~0.offset))) (and (= 1 subseq_~pt~0.offset) (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)) (= |subseq_#t~mem0| (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)))), 2511#(or (and (<= 1 subseq_~pt~0.offset) (or (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= (select |#length| subseq_~pt~0.base) subseq_~pt~0.offset))) (and (= 1 subseq_~pt~0.offset) (or (not |subseq_#t~short2|) (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)))))), 2512#(or (and (= 1 subseq_~pt~0.offset) (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)))) (and (<= 1 subseq_~pt~0.offset) (or (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= (select |#length| subseq_~pt~0.base) subseq_~pt~0.offset)))), 2513#(or (and (= 1 subseq_~pt~0.offset) (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)))) (and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 1 subseq_~pt~0.offset))), 2514#(or (and (= 1 subseq_~pt~0.offset) (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) |subseq_#t~mem3|))) (and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 1 subseq_~pt~0.offset))), 2515#(or (and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 1 subseq_~pt~0.offset)) (and (= 1 subseq_~pt~0.offset) (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) |subseq_#t~mem3|)) (= |subseq_#t~mem4| (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)))), 2516#(and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 1 subseq_~pt~0.offset)), 2517#(and (<= (+ subseq_~pt~0.offset 1) (select |#length| subseq_~pt~0.base)) (<= 2 subseq_~pt~0.offset))] [2018-02-04 01:53:23,347 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:23,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 01:53:23,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 01:53:23,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:53:23,348 INFO L87 Difference]: Start difference. First operand 97 states and 116 transitions. Second operand 16 states. [2018-02-04 01:53:23,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:23,812 INFO L93 Difference]: Finished difference Result 128 states and 154 transitions. [2018-02-04 01:53:23,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 01:53:23,812 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-02-04 01:53:23,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:23,813 INFO L225 Difference]: With dead ends: 128 [2018-02-04 01:53:23,813 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 01:53:23,813 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2018-02-04 01:53:23,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 01:53:23,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2018-02-04 01:53:23,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 01:53:23,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2018-02-04 01:53:23,815 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 43 [2018-02-04 01:53:23,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:23,815 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2018-02-04 01:53:23,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 01:53:23,815 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2018-02-04 01:53:23,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 01:53:23,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:23,816 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:23,816 INFO L371 AbstractCegarLoop]: === Iteration 17 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:53:23,817 INFO L82 PathProgramCache]: Analyzing trace with hash 276075674, now seen corresponding path program 1 times [2018-02-04 01:53:23,817 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:23,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:24,119 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:24,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:24,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 01:53:24,120 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:24,121 INFO L182 omatonBuilderFactory]: Interpolants [2800#(or (and (= 1 subseq_~pt~0.offset) (not |subseq_#t~short2|)) (and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 1 subseq_~pt~0.offset))), 2801#(and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 1 subseq_~pt~0.offset)), 2802#(and (<= (+ subseq_~pt~0.offset 1) (select |#length| subseq_~pt~0.base)) (<= 2 subseq_~pt~0.offset)), 2791#true, 2792#false, 2793#(and (= main_~length2~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 2794#(and (= 0 main_~nondetString2~0.offset) (or (= (+ main_~nondetString2~0.offset main_~length2~0) 2) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))), 2795#(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))))), 2796#(and (= 0 |subseq_#in~t.offset|) (or (= 0 (select (select |#memory_int| |subseq_#in~t.base|) 1)) (<= 3 (select |#length| |subseq_#in~t.base|)) (<= (select |#length| |subseq_#in~t.base|) 1))), 2797#(and (= subseq_~pt~0.offset 0) (or (<= (select |#length| subseq_~pt~0.base) 1) (= 0 (select (select |#memory_int| subseq_~pt~0.base) 1)) (<= 3 (select |#length| subseq_~pt~0.base)))), 2798#(or (and (= 1 subseq_~pt~0.offset) (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset))) (and (<= 1 subseq_~pt~0.offset) (or (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= (select |#length| subseq_~pt~0.base) subseq_~pt~0.offset)))), 2799#(or (and (= 1 subseq_~pt~0.offset) (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)) (= |subseq_#t~mem1| (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset))) (and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 1 subseq_~pt~0.offset)))] [2018-02-04 01:53:24,121 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:24,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 01:53:24,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 01:53:24,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:53:24,122 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand 12 states. [2018-02-04 01:53:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:24,497 INFO L93 Difference]: Finished difference Result 148 states and 175 transitions. [2018-02-04 01:53:24,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 01:53:24,498 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-02-04 01:53:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:24,498 INFO L225 Difference]: With dead ends: 148 [2018-02-04 01:53:24,498 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 01:53:24,499 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-02-04 01:53:24,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 01:53:24,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 129. [2018-02-04 01:53:24,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-04 01:53:24,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2018-02-04 01:53:24,502 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 43 [2018-02-04 01:53:24,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:24,502 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2018-02-04 01:53:24,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 01:53:24,502 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2018-02-04 01:53:24,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 01:53:24,503 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:24,503 INFO L351 BasicCegarLoop]: trace histogram [4, 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 01:53:24,503 INFO L371 AbstractCegarLoop]: === Iteration 18 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:53:24,503 INFO L82 PathProgramCache]: Analyzing trace with hash 512551529, now seen corresponding path program 3 times [2018-02-04 01:53:24,503 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:24,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 01:53:24,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:24,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 01:53:24,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:24,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:24,669 INFO L182 omatonBuilderFactory]: Interpolants [3104#(= 0 (select (select |#memory_int| subseq_~ps~0.base) (+ (select |#length| subseq_~ps~0.base) (- 1)))), 3105#(or (<= (+ subseq_~ps~0.offset 2) (select |#length| subseq_~ps~0.base)) (<= (select |#length| subseq_~ps~0.base) subseq_~ps~0.offset) (= 0 (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset))), 3106#(and (<= 0 subseq_~ps~0.offset) (or (<= (+ subseq_~ps~0.offset 2) (select |#length| subseq_~ps~0.base)) (and (= |subseq_#t~mem0| (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)) (= 0 (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset))))), 3107#(and (<= 0 subseq_~ps~0.offset) (or (<= (+ subseq_~ps~0.offset 2) (select |#length| subseq_~ps~0.base)) (not |subseq_#t~short2|))), 3108#(and (<= (+ subseq_~ps~0.offset 2) (select |#length| subseq_~ps~0.base)) (<= 0 subseq_~ps~0.offset)), 3109#(and (<= (+ subseq_~ps~0.offset 1) (select |#length| subseq_~ps~0.base)) (<= 1 subseq_~ps~0.offset)), 3096#true, 3097#false, 3098#(and (= 0 |main_#t~malloc10.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc10.base|)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 3099#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 3100#(and (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 3101#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 3102#(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)), 3103#(= 0 (select (select |#memory_int| |subseq_#in~s.base|) (+ (select |#length| |subseq_#in~s.base|) (- 1))))] [2018-02-04 01:53:24,669 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 01:53:24,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 01:53:24,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 01:53:24,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:53:24,670 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 14 states. [2018-02-04 01:53:24,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:24,928 INFO L93 Difference]: Finished difference Result 155 states and 175 transitions. [2018-02-04 01:53:24,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:53:24,928 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2018-02-04 01:53:24,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:24,929 INFO L225 Difference]: With dead ends: 155 [2018-02-04 01:53:24,929 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 01:53:24,929 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2018-02-04 01:53:24,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 01:53:24,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 63. [2018-02-04 01:53:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 01:53:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-02-04 01:53:24,930 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 51 [2018-02-04 01:53:24,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:24,931 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-02-04 01:53:24,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 01:53:24,931 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-02-04 01:53:24,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 01:53:24,931 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:24,931 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:24,931 INFO L371 AbstractCegarLoop]: === Iteration 19 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:53:24,931 INFO L82 PathProgramCache]: Analyzing trace with hash 813814599, now seen corresponding path program 3 times [2018-02-04 01:53:24,932 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:24,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:25,119 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 01:53:25,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:25,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 01:53:25,120 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:25,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:25,120 INFO L182 omatonBuilderFactory]: Interpolants [3360#(or (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= (select |#length| subseq_~pt~0.base) subseq_~pt~0.offset) (and (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)) (= |subseq_#t~mem0| (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)))), 3361#(or (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= (select |#length| subseq_~pt~0.base) subseq_~pt~0.offset) (not |subseq_#t~short2|) (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)))), 3362#(or (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= (select |#length| subseq_~pt~0.base) subseq_~pt~0.offset) (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset)))), 3363#(or (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) (select (select |#memory_int| subseq_~ps~0.base) subseq_~ps~0.offset))) (and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 0 subseq_~pt~0.offset))), 3364#(or (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) |subseq_#t~mem3|)) (and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 0 subseq_~pt~0.offset))), 3365#(or (and (not (= (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset) |subseq_#t~mem3|)) (= |subseq_#t~mem4| (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset))) (and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 0 subseq_~pt~0.offset))), 3366#(and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 0 subseq_~pt~0.offset)), 3367#(and (<= 1 subseq_~pt~0.offset) (<= (+ subseq_~pt~0.offset 1) (select |#length| subseq_~pt~0.base))), 3352#true, 3353#false, 3354#(and (= main_~length2~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 3355#(and (= main_~nondetString2~0.offset 0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 3356#(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)))))), 3357#(= 0 (select (select |#memory_int| |subseq_#in~t.base|) (+ (select |#length| |subseq_#in~t.base|) (- 1)))), 3358#(= 0 (select (select |#memory_int| subseq_~pt~0.base) (+ (select |#length| subseq_~pt~0.base) (- 1)))), 3359#(or (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= (select |#length| subseq_~pt~0.base) subseq_~pt~0.offset) (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)))] [2018-02-04 01:53:25,120 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 01:53:25,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 01:53:25,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 01:53:25,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:53:25,121 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 16 states. [2018-02-04 01:53:25,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:25,560 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2018-02-04 01:53:25,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 01:53:25,560 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2018-02-04 01:53:25,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:25,560 INFO L225 Difference]: With dead ends: 104 [2018-02-04 01:53:25,560 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 01:53:25,561 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=915, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 01:53:25,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 01:53:25,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 63. [2018-02-04 01:53:25,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 01:53:25,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-02-04 01:53:25,562 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 54 [2018-02-04 01:53:25,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:25,562 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-02-04 01:53:25,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 01:53:25,562 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-02-04 01:53:25,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 01:53:25,563 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:53:25,563 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:53:25,563 INFO L371 AbstractCegarLoop]: === Iteration 20 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:53:25,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1706145335, now seen corresponding path program 2 times [2018-02-04 01:53:25,563 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:53:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:53:25,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:53:25,681 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 01:53:25,681 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:53:25,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 01:53:25,681 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:53:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:53:25,682 INFO L182 omatonBuilderFactory]: Interpolants [3584#(and (<= 1 subseq_~pt~0.offset) (<= (+ subseq_~pt~0.offset 1) (select |#length| subseq_~pt~0.base))), 3573#true, 3574#false, 3575#(and (= main_~length2~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 3576#(and (= main_~nondetString2~0.offset 0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 3577#(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)))))), 3578#(= 0 (select (select |#memory_int| |subseq_#in~t.base|) (+ (select |#length| |subseq_#in~t.base|) (- 1)))), 3579#(= 0 (select (select |#memory_int| subseq_~pt~0.base) (+ (select |#length| subseq_~pt~0.base) (- 1)))), 3580#(or (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= (select |#length| subseq_~pt~0.base) subseq_~pt~0.offset) (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset))), 3581#(or (and (= 0 (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset)) (= |subseq_#t~mem1| (select (select |#memory_int| subseq_~pt~0.base) subseq_~pt~0.offset))) (and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 0 subseq_~pt~0.offset))), 3582#(or (not |subseq_#t~short2|) (and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 0 subseq_~pt~0.offset))), 3583#(and (<= (+ subseq_~pt~0.offset 2) (select |#length| subseq_~pt~0.base)) (<= 0 subseq_~pt~0.offset))] [2018-02-04 01:53:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 01:53:25,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 01:53:25,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 01:53:25,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:53:25,682 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 12 states. [2018-02-04 01:53:25,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:53:25,897 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-02-04 01:53:25,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 01:53:25,897 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-02-04 01:53:25,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:53:25,897 INFO L225 Difference]: With dead ends: 60 [2018-02-04 01:53:25,897 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 01:53:25,898 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2018-02-04 01:53:25,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 01:53:25,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 01:53:25,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 01:53:25,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 01:53:25,898 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-02-04 01:53:25,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:53:25,898 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 01:53:25,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 01:53:25,898 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 01:53:25,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 01:53:25,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:53:25 BoogieIcfgContainer [2018-02-04 01:53:25,901 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:53:25,902 INFO L168 Benchmark]: Toolchain (without parser) took 7438.28 ms. Allocated memory was 382.7 MB in the beginning and 764.4 MB in the end (delta: 381.7 MB). Free memory was 336.8 MB in the beginning and 520.6 MB in the end (delta: -183.8 MB). Peak memory consumption was 197.9 MB. Max. memory is 5.3 GB. [2018-02-04 01:53:25,902 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 382.7 MB. Free memory is still 342.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:53:25,903 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.52 ms. Allocated memory is still 382.7 MB. Free memory was 336.8 MB in the beginning and 326.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:53:25,903 INFO L168 Benchmark]: Boogie Preprocessor took 23.17 ms. Allocated memory is still 382.7 MB. Free memory was 326.2 MB in the beginning and 323.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:53:25,903 INFO L168 Benchmark]: RCFGBuilder took 211.12 ms. Allocated memory is still 382.7 MB. Free memory was 323.6 MB in the beginning and 303.7 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. [2018-02-04 01:53:25,903 INFO L168 Benchmark]: TraceAbstraction took 7046.63 ms. Allocated memory was 382.7 MB in the beginning and 764.4 MB in the end (delta: 381.7 MB). Free memory was 303.7 MB in the beginning and 520.6 MB in the end (delta: -216.8 MB). Peak memory consumption was 164.8 MB. Max. memory is 5.3 GB. [2018-02-04 01:53:25,904 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.13 ms. Allocated memory is still 382.7 MB. Free memory is still 342.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.52 ms. Allocated memory is still 382.7 MB. Free memory was 336.8 MB in the beginning and 326.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.17 ms. Allocated memory is still 382.7 MB. Free memory was 326.2 MB in the beginning and 323.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 211.12 ms. Allocated memory is still 382.7 MB. Free memory was 323.6 MB in the beginning and 303.7 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7046.63 ms. Allocated memory was 382.7 MB in the beginning and 764.4 MB in the end (delta: 381.7 MB). Free memory was 303.7 MB in the beginning and 520.6 MB in the end (delta: -216.8 MB). Peak memory consumption was 164.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 55 locations, 15 error locations. SAFE Result, 7.0s OverallTime, 20 OverallIterations, 4 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 708 SDtfs, 1225 SDslu, 2365 SDs, 0 SdLazy, 2682 SolverSat, 240 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 317 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 41/208 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, 20 MinimizatonAttempts, 227 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 597 NumberOfCodeBlocks, 597 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 577 ConstructedInterpolants, 0 QuantifiedInterpolants, 214396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 41/208 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/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-53-25-911.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_01-53-25-911.csv Received shutdown request...