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/cstrpbrk-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 14:59:01,801 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 14:59:01,804 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 14:59:01,819 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 14:59:01,819 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 14:59:01,820 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 14:59:01,821 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 14:59:01,822 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 14:59:01,824 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 14:59:01,824 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 14:59:01,825 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 14:59:01,825 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 14:59:01,826 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 14:59:01,827 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 14:59:01,828 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 14:59:01,829 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 14:59:01,831 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 14:59:01,832 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 14:59:01,833 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 14:59:01,834 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 14:59:01,836 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 14:59:01,836 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 14:59:01,837 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 14:59:01,837 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 14:59:01,838 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 14:59:01,839 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 14:59:01,839 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 14:59:01,840 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 14:59:01,840 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 14:59:01,840 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 14:59:01,841 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 14:59:01,841 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 14:59:01,850 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 14:59:01,851 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 14:59:01,852 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 14:59:01,852 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 14:59:01,852 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 14:59:01,852 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 14:59:01,852 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 14:59:01,852 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 14:59:01,853 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 14:59:01,853 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 14:59:01,853 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 14:59:01,853 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 14:59:01,853 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 14:59:01,853 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 14:59:01,853 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 14:59:01,854 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 14:59:01,854 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 14:59:01,854 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 14:59:01,854 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 14:59:01,854 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:59:01,854 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 14:59:01,855 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 14:59:01,883 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 14:59:01,892 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 14:59:01,896 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 14:59:01,897 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 14:59:01,897 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 14:59:01,898 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-02-04 14:59:02,040 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 14:59:02,041 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 14:59:02,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 14:59:02,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 14:59:02,045 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 14:59:02,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:59:02" (1/1) ... [2018-02-04 14:59:02,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a67664e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:02, skipping insertion in model container [2018-02-04 14:59:02,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:59:02" (1/1) ... [2018-02-04 14:59:02,057 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:59:02,084 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:59:02,171 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:59:02,188 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:59:02,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:02 WrapperNode [2018-02-04 14:59:02,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 14:59:02,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 14:59:02,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 14:59:02,195 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 14:59:02,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:02" (1/1) ... [2018-02-04 14:59:02,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:02" (1/1) ... [2018-02-04 14:59:02,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:02" (1/1) ... [2018-02-04 14:59:02,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:02" (1/1) ... [2018-02-04 14:59:02,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:02" (1/1) ... [2018-02-04 14:59:02,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:02" (1/1) ... [2018-02-04 14:59:02,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:02" (1/1) ... [2018-02-04 14:59:02,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 14:59:02,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 14:59:02,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 14:59:02,221 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 14:59:02,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:02" (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 14:59:02,258 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 14:59:02,259 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 14:59:02,259 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-02-04 14:59:02,259 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 14:59:02,259 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 14:59:02,259 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 14:59:02,259 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 14:59:02,259 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 14:59:02,259 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 14:59:02,259 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 14:59:02,259 INFO L128 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-02-04 14:59:02,259 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 14:59:02,259 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 14:59:02,259 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 14:59:02,450 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 14:59:02,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:59:02 BoogieIcfgContainer [2018-02-04 14:59:02,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 14:59:02,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 14:59:02,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 14:59:02,452 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 14:59:02,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:59:02" (1/3) ... [2018-02-04 14:59:02,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb4ab77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:59:02, skipping insertion in model container [2018-02-04 14:59:02,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:02" (2/3) ... [2018-02-04 14:59:02,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb4ab77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:59:02, skipping insertion in model container [2018-02-04 14:59:02,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:59:02" (3/3) ... [2018-02-04 14:59:02,456 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-02-04 14:59:02,461 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 14:59:02,468 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 14:59:02,504 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 14:59:02,505 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 14:59:02,505 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 14:59:02,505 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 14:59:02,505 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 14:59:02,505 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 14:59:02,505 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 14:59:02,506 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 14:59:02,506 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 14:59:02,520 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-02-04 14:59:02,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 14:59:02,528 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:02,529 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:02,530 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:59:02,540 INFO L82 PathProgramCache]: Analyzing trace with hash -21044599, now seen corresponding path program 1 times [2018-02-04 14:59:02,576 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:02,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:02,758 INFO 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 14:59:02,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:02,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:59:02,761 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:02,762 INFO 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 14:59:02,762 INFO L182 omatonBuilderFactory]: Interpolants [64#(= 1 (select |#valid| main_~nondetString1~0.base)), 61#true, 62#false, 63#(= 1 (select |#valid| |main_#t~malloc10.base|))] [2018-02-04 14:59:02,762 INFO 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 14:59:02,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:59:02,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:59:02,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:59:02,777 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-02-04 14:59:02,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:02,909 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-02-04 14:59:02,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 14:59:02,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 14:59:02,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:02,916 INFO L225 Difference]: With dead ends: 57 [2018-02-04 14:59:02,916 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 14:59:02,917 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 14:59:02,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 14:59:02,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 14:59:02,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 14:59:02,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-04 14:59:02,941 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-02-04 14:59:02,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:02,942 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-04 14:59:02,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:59:02,942 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-04 14:59:02,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 14:59:02,942 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:02,943 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:02,943 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:59:02,943 INFO L82 PathProgramCache]: Analyzing trace with hash -21044598, now seen corresponding path program 1 times [2018-02-04 14:59:02,944 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:02,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:03,057 INFO 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 14:59:03,058 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:03,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:59:03,058 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:03,058 INFO 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 14:59:03,059 INFO L182 omatonBuilderFactory]: Interpolants [178#true, 179#false, 180#(<= 1 main_~length1~0), 181#(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)), 182#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 183#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0))] [2018-02-04 14:59:03,059 INFO 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 14:59:03,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:59:03,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:59:03,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:59:03,061 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-02-04 14:59:03,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:03,126 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-02-04 14:59:03,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:59:03,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 14:59:03,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:03,128 INFO L225 Difference]: With dead ends: 53 [2018-02-04 14:59:03,128 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 14:59:03,129 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 14:59:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 14:59:03,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 14:59:03,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 14:59:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-02-04 14:59:03,134 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-02-04 14:59:03,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:03,134 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-02-04 14:59:03,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:59:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-02-04 14:59:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 14:59:03,135 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:03,135 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:03,135 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:59:03,135 INFO L82 PathProgramCache]: Analyzing trace with hash -652382516, now seen corresponding path program 1 times [2018-02-04 14:59:03,136 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:03,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:03,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 14:59:03,168 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:03,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:59:03,169 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:03,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 14:59:03,169 INFO L182 omatonBuilderFactory]: Interpolants [292#true, 293#false, 294#(= 1 (select |#valid| |main_#t~malloc11.base|)), 295#(= 1 (select |#valid| main_~nondetString2~0.base))] [2018-02-04 14:59:03,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 14:59:03,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:59:03,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:59:03,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:59:03,169 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-02-04 14:59:03,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:03,214 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-02-04 14:59:03,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 14:59:03,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 14:59:03,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:03,216 INFO L225 Difference]: With dead ends: 52 [2018-02-04 14:59:03,216 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 14:59:03,216 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 14:59:03,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 14:59:03,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 14:59:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 14:59:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-02-04 14:59:03,221 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-02-04 14:59:03,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:03,221 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-02-04 14:59:03,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:59:03,221 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-02-04 14:59:03,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 14:59:03,222 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:03,222 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:03,222 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:59:03,222 INFO L82 PathProgramCache]: Analyzing trace with hash -652382515, now seen corresponding path program 1 times [2018-02-04 14:59:03,223 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:03,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:03,281 INFO 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 14:59:03,281 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:03,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:59:03,281 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:03,281 INFO 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 14:59:03,281 INFO L182 omatonBuilderFactory]: Interpolants [402#true, 403#false, 404#(<= 1 main_~length2~0), 405#(and (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 406#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))] [2018-02-04 14:59:03,281 INFO 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 14:59:03,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:59:03,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:59:03,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:59:03,282 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-02-04 14:59:03,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:03,312 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-02-04 14:59:03,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:59:03,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 14:59:03,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:03,314 INFO L225 Difference]: With dead ends: 51 [2018-02-04 14:59:03,314 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 14:59:03,315 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 14:59:03,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 14:59:03,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 14:59:03,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 14:59:03,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-02-04 14:59:03,318 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-02-04 14:59:03,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:03,318 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-02-04 14:59:03,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:59:03,318 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-02-04 14:59:03,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 14:59:03,318 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:03,319 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 14:59:03,319 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:59:03,319 INFO L82 PathProgramCache]: Analyzing trace with hash 470787565, now seen corresponding path program 1 times [2018-02-04 14:59:03,320 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:03,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:03,358 INFO 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 14:59:03,359 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:03,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:59:03,359 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:03,359 INFO 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 14:59:03,359 INFO L182 omatonBuilderFactory]: Interpolants [512#false, 513#(= 1 (select |#valid| main_~nondetString1~0.base)), 514#(= 1 (select |#valid| |cstrpbrk_#in~s1.base|)), 515#(= 1 (select |#valid| cstrpbrk_~sc1~0.base)), 511#true] [2018-02-04 14:59:03,359 INFO 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 14:59:03,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:59:03,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:59:03,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:59:03,360 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-02-04 14:59:03,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:03,405 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-04 14:59:03,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:59:03,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 14:59:03,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:03,406 INFO L225 Difference]: With dead ends: 49 [2018-02-04 14:59:03,406 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 14:59:03,406 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 14:59:03,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 14:59:03,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 14:59:03,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 14:59:03,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-02-04 14:59:03,409 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2018-02-04 14:59:03,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:03,409 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-02-04 14:59:03,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:59:03,409 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-02-04 14:59:03,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 14:59:03,409 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:03,409 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 14:59:03,409 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:59:03,409 INFO L82 PathProgramCache]: Analyzing trace with hash 470787566, now seen corresponding path program 1 times [2018-02-04 14:59:03,410 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:03,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:03,482 INFO 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 14:59:03,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:03,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:59:03,483 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:03,483 INFO 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 14:59:03,483 INFO L182 omatonBuilderFactory]: Interpolants [616#true, 617#false, 618#(<= 1 main_~length1~0), 619#(and (= 0 |main_#t~malloc10.offset|) (<= 1 main_~length1~0)), 620#(and (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 621#(and (<= (+ main_~nondetString1~0.offset 1) (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 622#(and (= 0 |cstrpbrk_#in~s1.offset|) (<= 1 (select |#length| |cstrpbrk_#in~s1.base|))), 623#(and (= cstrpbrk_~sc1~0.offset 0) (<= 1 (select |#length| cstrpbrk_~sc1~0.base)))] [2018-02-04 14:59:03,483 INFO 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 14:59:03,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:59:03,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:59:03,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:59:03,484 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-02-04 14:59:03,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:03,570 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-02-04 14:59:03,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 14:59:03,571 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-04 14:59:03,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:03,573 INFO L225 Difference]: With dead ends: 73 [2018-02-04 14:59:03,573 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 14:59:03,573 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 14:59:03,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 14:59:03,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2018-02-04 14:59:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 14:59:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-02-04 14:59:03,576 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 18 [2018-02-04 14:59:03,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:03,576 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-02-04 14:59:03,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:59:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-02-04 14:59:03,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 14:59:03,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:03,577 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:03,577 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:59:03,577 INFO L82 PathProgramCache]: Analyzing trace with hash 947097224, now seen corresponding path program 1 times [2018-02-04 14:59:03,578 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:03,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:03,612 INFO 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 14:59:03,613 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:03,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:59:03,613 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:03,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:03,613 INFO L182 omatonBuilderFactory]: Interpolants [758#true, 759#false, 760#(= 1 (select |#valid| main_~nondetString2~0.base)), 761#(= 1 (select |#valid| |cstrpbrk_#in~s2.base|)), 762#(= 1 (select |#valid| cstrpbrk_~s2.base)), 763#(= 1 (select |#valid| cstrpbrk_~s~0.base))] [2018-02-04 14:59:03,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:03,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:59:03,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:59:03,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:59:03,614 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-02-04 14:59:03,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:03,693 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-02-04 14:59:03,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:59:03,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 14:59:03,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:03,694 INFO L225 Difference]: With dead ends: 53 [2018-02-04 14:59:03,694 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 14:59:03,694 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:59:03,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 14:59:03,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-02-04 14:59:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 14:59:03,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-04 14:59:03,697 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-02-04 14:59:03,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:03,697 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-04 14:59:03,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:59:03,697 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-04 14:59:03,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 14:59:03,697 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:03,697 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:03,697 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:59:03,698 INFO L82 PathProgramCache]: Analyzing trace with hash 947097225, now seen corresponding path program 1 times [2018-02-04 14:59:03,698 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:03,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:03,779 INFO 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 14:59:03,779 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:03,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 14:59:03,780 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:03,780 INFO 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 14:59:03,780 INFO L182 omatonBuilderFactory]: Interpolants [871#true, 872#false, 873#(<= 1 main_~length2~0), 874#(and (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 875#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 876#(and (= 0 main_~nondetString2~0.offset) (<= 1 (select |#length| main_~nondetString2~0.base))), 877#(and (<= 1 (select |#length| |cstrpbrk_#in~s2.base|)) (= 0 |cstrpbrk_#in~s2.offset|)), 878#(and (<= 1 (select |#length| cstrpbrk_~s2.base)) (= 0 cstrpbrk_~s2.offset)), 879#(and (= cstrpbrk_~s~0.offset 0) (<= 1 (select |#length| cstrpbrk_~s~0.base)))] [2018-02-04 14:59:03,780 INFO 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 14:59:03,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 14:59:03,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 14:59:03,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:59:03,781 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-02-04 14:59:03,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:03,854 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2018-02-04 14:59:03,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 14:59:03,855 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-02-04 14:59:03,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:03,855 INFO L225 Difference]: With dead ends: 67 [2018-02-04 14:59:03,856 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 14:59:03,856 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:59:03,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 14:59:03,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-02-04 14:59:03,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 14:59:03,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-02-04 14:59:03,859 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 23 [2018-02-04 14:59:03,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:03,859 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-02-04 14:59:03,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 14:59:03,859 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-02-04 14:59:03,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 14:59:03,860 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:03,860 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:03,860 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:59:03,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1236428998, now seen corresponding path program 1 times [2018-02-04 14:59:03,861 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:03,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:03,967 INFO 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 14:59:03,967 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:03,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:59:03,967 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:03,968 INFO 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 14:59:03,968 INFO L182 omatonBuilderFactory]: Interpolants [1011#true, 1012#false, 1013#(= |#valid| |old(#valid)|), 1014#(and (= |old(#valid)| (store |#valid| |main_#t~malloc10.base| 0)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 1015#(and (= main_~nondetString1~0.base |main_#t~malloc10.base|) (= (select |#valid| main_~nondetString1~0.base) 1) (= |old(#valid)| (store |#valid| |main_#t~malloc10.base| 0))), 1016#(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))), 1017#(= |old(#valid)| (store |#valid| |main_#t~malloc11.base| 0))] [2018-02-04 14:59:03,968 INFO 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 14:59:03,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 14:59:03,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 14:59:03,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:59:03,969 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 7 states. [2018-02-04 14:59:04,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:04,067 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-02-04 14:59:04,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 14:59:04,067 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-02-04 14:59:04,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:04,067 INFO L225 Difference]: With dead ends: 57 [2018-02-04 14:59:04,067 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 14:59:04,068 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:59:04,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 14:59:04,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 14:59:04,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 14:59:04,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-02-04 14:59:04,069 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 28 [2018-02-04 14:59:04,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:04,070 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-02-04 14:59:04,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 14:59:04,070 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-02-04 14:59:04,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 14:59:04,070 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:04,070 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:04,070 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:59:04,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1333847614, now seen corresponding path program 1 times [2018-02-04 14:59:04,071 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:04,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:04,100 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 14:59:04,100 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:04,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:59:04,100 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:04,100 INFO 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 14:59:04,100 INFO L182 omatonBuilderFactory]: Interpolants [1127#true, 1128#false, 1129#(not |cstrpbrk_#t~short5|)] [2018-02-04 14:59:04,101 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 14:59:04,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 14:59:04,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 14:59:04,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 14:59:04,101 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 3 states. [2018-02-04 14:59:04,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:04,108 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-02-04 14:59:04,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 14:59:04,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-02-04 14:59:04,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:04,109 INFO L225 Difference]: With dead ends: 50 [2018-02-04 14:59:04,109 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 14:59:04,109 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 14:59:04,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 14:59:04,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 14:59:04,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 14:59:04,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-04 14:59:04,112 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28 [2018-02-04 14:59:04,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:04,112 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-04 14:59:04,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 14:59:04,112 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-04 14:59:04,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 14:59:04,113 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:04,113 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:04,113 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:59:04,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1745742785, now seen corresponding path program 1 times [2018-02-04 14:59:04,114 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:04,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:04,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 14:59:04,293 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:04,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 14:59:04,293 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:04,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:04,293 INFO L182 omatonBuilderFactory]: Interpolants [1232#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 1233#(and (= 0 |main_#t~malloc10.offset|) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= (select |#valid| |main_#t~malloc10.base|) 1)), 1234#(and (= (select |#valid| main_~nondetString1~0.base) 1) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 1235#(and (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 1236#(and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 1237#(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)), 1238#(= 0 (select (select |#memory_int| |cstrpbrk_#in~s1.base|) |cstrpbrk_#in~s1.offset|)), 1239#(= 0 (select (select |#memory_int| cstrpbrk_~sc1~0.base) cstrpbrk_~sc1~0.offset)), 1240#(and (= 0 (select (select |#memory_int| cstrpbrk_~sc1~0.base) cstrpbrk_~sc1~0.offset)) (= |cstrpbrk_#t~mem1| (select (select |#memory_int| cstrpbrk_~sc1~0.base) cstrpbrk_~sc1~0.offset))), 1230#true, 1231#false] [2018-02-04 14:59:04,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 14:59:04,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 14:59:04,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 14:59:04,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 14:59:04,294 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 11 states. [2018-02-04 14:59:04,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:04,446 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-02-04 14:59:04,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 14:59:04,447 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-02-04 14:59:04,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:04,447 INFO L225 Difference]: With dead ends: 62 [2018-02-04 14:59:04,447 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 14:59:04,447 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-02-04 14:59:04,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 14:59:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 14:59:04,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 14:59:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-02-04 14:59:04,449 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 30 [2018-02-04 14:59:04,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:04,449 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-02-04 14:59:04,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 14:59:04,449 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-02-04 14:59:04,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 14:59:04,450 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:04,450 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:04,450 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:59:04,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1611729279, now seen corresponding path program 1 times [2018-02-04 14:59:04,450 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:04,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:04,569 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 14:59:04,569 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:04,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 14:59:04,570 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:04,570 INFO 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 14:59:04,570 INFO L182 omatonBuilderFactory]: Interpolants [1365#true, 1366#false, 1367#(and (<= main_~length2~0 1) (<= 1 main_~length2~0)), 1368#(and (<= main_~length2~0 1) (<= 1 main_~length2~0) (= 0 |main_#t~malloc11.offset|)), 1369#(and (= main_~nondetString2~0.offset 0) (= 1 (+ main_~nondetString2~0.offset main_~length2~0))), 1370#(and (= main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset))), 1371#(= 0 (select (select |#memory_int| |cstrpbrk_#in~s2.base|) |cstrpbrk_#in~s2.offset|)), 1372#(= 0 (select (select |#memory_int| cstrpbrk_~s2.base) cstrpbrk_~s2.offset)), 1373#(= 0 (select (select |#memory_int| cstrpbrk_~s~0.base) cstrpbrk_~s~0.offset)), 1374#(and (= |cstrpbrk_#t~mem3| (select (select |#memory_int| cstrpbrk_~s~0.base) cstrpbrk_~s~0.offset)) (= 0 (select (select |#memory_int| cstrpbrk_~s~0.base) cstrpbrk_~s~0.offset))), 1375#(not |cstrpbrk_#t~short5|)] [2018-02-04 14:59:04,570 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 14:59:04,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 14:59:04,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 14:59:04,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 14:59:04,571 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 11 states. [2018-02-04 14:59:04,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:04,723 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-02-04 14:59:04,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 14:59:04,723 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-02-04 14:59:04,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:04,724 INFO L225 Difference]: With dead ends: 77 [2018-02-04 14:59:04,724 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 14:59:04,724 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-02-04 14:59:04,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 14:59:04,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-02-04 14:59:04,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 14:59:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-02-04 14:59:04,727 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 30 [2018-02-04 14:59:04,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:04,728 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-02-04 14:59:04,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 14:59:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-02-04 14:59:04,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 14:59:04,729 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:04,729 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:04,729 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:59:04,729 INFO L82 PathProgramCache]: Analyzing trace with hash -193709055, now seen corresponding path program 1 times [2018-02-04 14:59:04,730 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:04,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:04,873 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 14:59:04,873 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:59:04,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 14:59:04,873 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:04,873 INFO 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 14:59:04,873 INFO L182 omatonBuilderFactory]: Interpolants [1540#true, 1541#false, 1542#(<= 1 main_~length2~0), 1543#(and (<= 1 main_~length2~0) (= 0 |main_#t~malloc11.offset|)), 1544#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0)), 1545#(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)))), 1546#(and (= 0 |cstrpbrk_#in~s2.offset|) (or (= 0 (select (select |#memory_int| |cstrpbrk_#in~s2.base|) |cstrpbrk_#in~s2.offset|)) (<= 2 (select |#length| |cstrpbrk_#in~s2.base|)))), 1547#(and (or (<= 2 (select |#length| cstrpbrk_~s2.base)) (= 0 (select (select |#memory_int| cstrpbrk_~s2.base) cstrpbrk_~s2.offset))) (= 0 cstrpbrk_~s2.offset)), 1548#(and (= cstrpbrk_~s~0.offset 0) (or (= 0 (select (select |#memory_int| cstrpbrk_~s~0.base) cstrpbrk_~s~0.offset)) (<= 2 (select |#length| cstrpbrk_~s~0.base)))), 1549#(and (= cstrpbrk_~s~0.offset 0) (or (<= 2 (select |#length| cstrpbrk_~s~0.base)) (and (= |cstrpbrk_#t~mem3| (select (select |#memory_int| cstrpbrk_~s~0.base) cstrpbrk_~s~0.offset)) (= 0 (select (select |#memory_int| cstrpbrk_~s~0.base) cstrpbrk_~s~0.offset))))), 1550#(and (= cstrpbrk_~s~0.offset 0) (or (not |cstrpbrk_#t~short5|) (<= 2 (select |#length| cstrpbrk_~s~0.base)))), 1551#(and (= cstrpbrk_~s~0.offset 0) (<= 2 (select |#length| cstrpbrk_~s~0.base))), 1552#(and (<= (+ cstrpbrk_~s~0.offset 1) (select |#length| cstrpbrk_~s~0.base)) (<= 1 cstrpbrk_~s~0.offset))] [2018-02-04 14:59:04,874 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 14:59:04,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 14:59:04,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 14:59:04,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:59:04,874 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 13 states. [2018-02-04 14:59:05,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:05,095 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2018-02-04 14:59:05,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 14:59:05,096 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-02-04 14:59:05,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:05,097 INFO L225 Difference]: With dead ends: 103 [2018-02-04 14:59:05,097 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 14:59:05,098 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-02-04 14:59:05,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 14:59:05,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2018-02-04 14:59:05,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 14:59:05,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-02-04 14:59:05,101 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 30 [2018-02-04 14:59:05,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:05,101 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-02-04 14:59:05,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 14:59:05,101 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-02-04 14:59:05,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 14:59:05,102 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:05,102 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:05,102 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:59:05,102 INFO L82 PathProgramCache]: Analyzing trace with hash -276872451, now seen corresponding path program 1 times [2018-02-04 14:59:05,103 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:05,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:05,157 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 14:59:05,157 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:05,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 14:59:05,157 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:05,158 INFO 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 14:59:05,158 INFO L182 omatonBuilderFactory]: Interpolants [1760#(and (= (select (select |#memory_int| cstrpbrk_~s~0.base) cstrpbrk_~s~0.offset) |cstrpbrk_#t~mem3|) (not (= 0 cstrpbrk_~c~0))), 1761#(or (not (= (select (select |#memory_int| cstrpbrk_~s~0.base) cstrpbrk_~s~0.offset) cstrpbrk_~c~0)) |cstrpbrk_#t~short5|), 1762#(not (= (select (select |#memory_int| cstrpbrk_~s~0.base) cstrpbrk_~s~0.offset) cstrpbrk_~c~0)), 1763#(not (= |cstrpbrk_#t~mem7| cstrpbrk_~c~0)), 1754#true, 1755#false, 1756#(= |cstrpbrk_#t~mem1| (select (select |#memory_int| cstrpbrk_~sc1~0.base) cstrpbrk_~sc1~0.offset)), 1757#(not (= 0 (select (select |#memory_int| cstrpbrk_~sc1~0.base) cstrpbrk_~sc1~0.offset))), 1758#(not (= 0 |cstrpbrk_#t~mem2|)), 1759#(not (= 0 cstrpbrk_~c~0))] [2018-02-04 14:59:05,158 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 14:59:05,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 14:59:05,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 14:59:05,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:59:05,159 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 10 states. [2018-02-04 14:59:05,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:05,259 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-02-04 14:59:05,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 14:59:05,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-02-04 14:59:05,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:05,260 INFO L225 Difference]: With dead ends: 82 [2018-02-04 14:59:05,260 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 14:59:05,260 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-02-04 14:59:05,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 14:59:05,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-02-04 14:59:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 14:59:05,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-02-04 14:59:05,262 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 31 [2018-02-04 14:59:05,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:05,262 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-02-04 14:59:05,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 14:59:05,262 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-02-04 14:59:05,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 14:59:05,262 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:05,263 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:05,263 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:59:05,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1615321176, now seen corresponding path program 1 times [2018-02-04 14:59:05,263 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:05,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:05,473 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 14:59:05,474 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:59:05,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 14:59:05,474 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:05,474 INFO 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 14:59:05,474 INFO L182 omatonBuilderFactory]: Interpolants [1921#true, 1922#false, 1923#(<= 1 main_~length1~0), 1924#(and (= 0 |main_#t~malloc10.offset|) (<= 1 main_~length1~0) (= (select |#valid| |main_#t~malloc10.base|) 1)), 1925#(and (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 1926#(and (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 1927#(and (<= 1 main_~length1~0) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 1928#(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))), 1929#(and (= 0 |cstrpbrk_#in~s1.offset|) (or (<= 2 (select |#length| |cstrpbrk_#in~s1.base|)) (= 0 (select (select |#memory_int| |cstrpbrk_#in~s1.base|) |cstrpbrk_#in~s1.offset|)))), 1930#(and (= cstrpbrk_~sc1~0.offset 0) (or (<= 2 (select |#length| cstrpbrk_~sc1~0.base)) (= 0 (select (select |#memory_int| cstrpbrk_~sc1~0.base) cstrpbrk_~sc1~0.offset)))), 1931#(and (or (<= 2 (select |#length| cstrpbrk_~sc1~0.base)) (and (= 0 (select (select |#memory_int| cstrpbrk_~sc1~0.base) cstrpbrk_~sc1~0.offset)) (= |cstrpbrk_#t~mem1| (select (select |#memory_int| cstrpbrk_~sc1~0.base) cstrpbrk_~sc1~0.offset)))) (= cstrpbrk_~sc1~0.offset 0)), 1932#(and (<= 2 (select |#length| cstrpbrk_~sc1~0.base)) (= cstrpbrk_~sc1~0.offset 0)), 1933#(and (<= (+ cstrpbrk_~sc1~0.offset 1) (select |#length| cstrpbrk_~sc1~0.base)) (<= 1 cstrpbrk_~sc1~0.offset))] [2018-02-04 14:59:05,474 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 14:59:05,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 14:59:05,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 14:59:05,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:59:05,475 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 13 states. [2018-02-04 14:59:05,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:05,653 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2018-02-04 14:59:05,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 14:59:05,653 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-02-04 14:59:05,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:05,654 INFO L225 Difference]: With dead ends: 123 [2018-02-04 14:59:05,654 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 14:59:05,654 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-02-04 14:59:05,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 14:59:05,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 87. [2018-02-04 14:59:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 14:59:05,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2018-02-04 14:59:05,657 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 33 [2018-02-04 14:59:05,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:05,657 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2018-02-04 14:59:05,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 14:59:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2018-02-04 14:59:05,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 14:59:05,657 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:05,658 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:05,658 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:59:05,658 INFO L82 PathProgramCache]: Analyzing trace with hash 149792585, now seen corresponding path program 2 times [2018-02-04 14:59:05,658 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:05,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:05,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:59:05,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 14:59:05,911 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:05,911 INFO 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 14:59:05,911 INFO L182 omatonBuilderFactory]: Interpolants [2160#true, 2161#false, 2162#(and (= main_~length2~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 2163#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 2164#(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))))), 2165#(and (or (= 0 (select (select |#memory_int| |cstrpbrk_#in~s2.base|) 1)) (<= (select |#length| |cstrpbrk_#in~s2.base|) 1) (<= 3 (select |#length| |cstrpbrk_#in~s2.base|))) (= 0 |cstrpbrk_#in~s2.offset|)), 2166#(and (= 0 cstrpbrk_~s2.offset) (or (<= 3 (select |#length| cstrpbrk_~s2.base)) (= 0 (select (select |#memory_int| cstrpbrk_~s2.base) 1)) (<= (select |#length| cstrpbrk_~s2.base) 1))), 2167#(and (= cstrpbrk_~s~0.offset 0) (or (<= (select |#length| cstrpbrk_~s~0.base) 1) (<= 3 (select |#length| cstrpbrk_~s~0.base)) (= 0 (select (select |#memory_int| cstrpbrk_~s~0.base) 1)))), 2168#(and (or (<= (select |#length| cstrpbrk_~s~0.base) cstrpbrk_~s~0.offset) (= 0 (select (select |#memory_int| cstrpbrk_~s~0.base) cstrpbrk_~s~0.offset)) (<= (+ cstrpbrk_~s~0.offset 2) (select |#length| cstrpbrk_~s~0.base))) (= 1 cstrpbrk_~s~0.offset)), 2169#(and (or (<= (+ cstrpbrk_~s~0.offset 2) (select |#length| cstrpbrk_~s~0.base)) (and (= |cstrpbrk_#t~mem3| (select (select |#memory_int| cstrpbrk_~s~0.base) cstrpbrk_~s~0.offset)) (= 0 (select (select |#memory_int| cstrpbrk_~s~0.base) cstrpbrk_~s~0.offset)))) (= 1 cstrpbrk_~s~0.offset)), 2170#(and (or (not |cstrpbrk_#t~short5|) (<= (+ cstrpbrk_~s~0.offset 2) (select |#length| cstrpbrk_~s~0.base))) (= 1 cstrpbrk_~s~0.offset)), 2171#(and (<= (+ cstrpbrk_~s~0.offset 2) (select |#length| cstrpbrk_~s~0.base)) (= 1 cstrpbrk_~s~0.offset)), 2172#(and (<= (+ cstrpbrk_~s~0.offset 1) (select |#length| cstrpbrk_~s~0.base)) (<= 2 cstrpbrk_~s~0.offset))] [2018-02-04 14:59:05,912 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:05,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 14:59:05,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 14:59:05,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:59:05,912 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 13 states. [2018-02-04 14:59:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:06,197 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2018-02-04 14:59:06,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 14:59:06,197 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-02-04 14:59:06,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:06,198 INFO L225 Difference]: With dead ends: 140 [2018-02-04 14:59:06,198 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 14:59:06,198 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2018-02-04 14:59:06,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 14:59:06,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2018-02-04 14:59:06,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 14:59:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2018-02-04 14:59:06,201 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 37 [2018-02-04 14:59:06,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:06,201 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2018-02-04 14:59:06,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 14:59:06,201 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2018-02-04 14:59:06,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 14:59:06,202 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:06,202 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:06,202 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:59:06,202 INFO L82 PathProgramCache]: Analyzing trace with hash -9798911, now seen corresponding path program 3 times [2018-02-04 14:59:06,203 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:06,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 14:59:06,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:59:06,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 14:59:06,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:06,358 INFO 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 14:59:06,359 INFO L182 omatonBuilderFactory]: Interpolants [2432#true, 2433#false, 2434#(and (= main_~length2~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 2435#(and (= main_~nondetString2~0.offset 0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 2436#(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)))))), 2437#(= 0 (select (select |#memory_int| |cstrpbrk_#in~s2.base|) (+ (select |#length| |cstrpbrk_#in~s2.base|) (- 1)))), 2438#(= 0 (select (select |#memory_int| cstrpbrk_~s2.base) (+ (select |#length| cstrpbrk_~s2.base) (- 1)))), 2439#(= 0 (select (select |#memory_int| cstrpbrk_~s~0.base) (+ (select |#length| cstrpbrk_~s~0.base) (- 1)))), 2440#(or (<= (select |#length| cstrpbrk_~s~0.base) cstrpbrk_~s~0.offset) (= 0 (select (select |#memory_int| cstrpbrk_~s~0.base) cstrpbrk_~s~0.offset)) (<= (+ cstrpbrk_~s~0.offset 2) (select |#length| cstrpbrk_~s~0.base))), 2441#(or (and (<= (+ cstrpbrk_~s~0.offset 2) (select |#length| cstrpbrk_~s~0.base)) (<= 0 cstrpbrk_~s~0.offset)) (and (= |cstrpbrk_#t~mem3| (select (select |#memory_int| cstrpbrk_~s~0.base) cstrpbrk_~s~0.offset)) (= 0 (select (select |#memory_int| cstrpbrk_~s~0.base) cstrpbrk_~s~0.offset)))), 2442#(or (and (<= (+ cstrpbrk_~s~0.offset 2) (select |#length| cstrpbrk_~s~0.base)) (<= 0 cstrpbrk_~s~0.offset)) (not |cstrpbrk_#t~short5|)), 2443#(and (<= (+ cstrpbrk_~s~0.offset 2) (select |#length| cstrpbrk_~s~0.base)) (<= 0 cstrpbrk_~s~0.offset)), 2444#(and (<= (+ cstrpbrk_~s~0.offset 1) (select |#length| cstrpbrk_~s~0.base)) (<= 1 cstrpbrk_~s~0.offset))] [2018-02-04 14:59:06,359 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 14:59:06,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 14:59:06,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 14:59:06,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:59:06,359 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 13 states. [2018-02-04 14:59:06,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:06,673 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2018-02-04 14:59:06,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 14:59:06,673 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-02-04 14:59:06,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:06,674 INFO L225 Difference]: With dead ends: 111 [2018-02-04 14:59:06,674 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 14:59:06,674 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-02-04 14:59:06,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 14:59:06,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 52. [2018-02-04 14:59:06,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 14:59:06,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-02-04 14:59:06,676 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 44 [2018-02-04 14:59:06,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:06,677 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-02-04 14:59:06,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 14:59:06,677 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-02-04 14:59:06,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 14:59:06,678 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:06,678 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:06,678 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:59:06,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1837728530, now seen corresponding path program 2 times [2018-02-04 14:59:06,679 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:06,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:06,969 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:06,969 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:59:06,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 14:59:06,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:06,970 INFO 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 14:59:06,970 INFO L182 omatonBuilderFactory]: Interpolants [2630#true, 2631#false, 2632#(and (= 0 |main_#t~malloc10.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc10.base|)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 2633#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 2634#(and (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 2635#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 2636#(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)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 2637#(and (= 0 |cstrpbrk_#in~s1.offset|) (or (= 0 (select (select |#memory_int| |cstrpbrk_#in~s1.base|) 1)) (<= 3 (select |#length| |cstrpbrk_#in~s1.base|)) (<= (select |#length| |cstrpbrk_#in~s1.base|) 1))), 2638#(and (= cstrpbrk_~sc1~0.offset 0) (or (<= 3 (select |#length| cstrpbrk_~sc1~0.base)) (<= (select |#length| cstrpbrk_~sc1~0.base) 1) (= 0 (select (select |#memory_int| cstrpbrk_~sc1~0.base) 1)))), 2639#(or (and (<= (+ cstrpbrk_~sc1~0.offset 2) (select |#length| cstrpbrk_~sc1~0.base)) (<= 1 cstrpbrk_~sc1~0.offset)) (<= (select |#length| cstrpbrk_~sc1~0.base) cstrpbrk_~sc1~0.offset) (and (= 0 (select (select |#memory_int| cstrpbrk_~sc1~0.base) cstrpbrk_~sc1~0.offset)) (= 1 cstrpbrk_~sc1~0.offset))), 2640#(or (and (= 0 (select (select |#memory_int| cstrpbrk_~sc1~0.base) cstrpbrk_~sc1~0.offset)) (= 1 cstrpbrk_~sc1~0.offset) (= |cstrpbrk_#t~mem1| (select (select |#memory_int| cstrpbrk_~sc1~0.base) cstrpbrk_~sc1~0.offset))) (and (<= (+ cstrpbrk_~sc1~0.offset 2) (select |#length| cstrpbrk_~sc1~0.base)) (<= 1 cstrpbrk_~sc1~0.offset))), 2641#(and (<= (+ cstrpbrk_~sc1~0.offset 2) (select |#length| cstrpbrk_~sc1~0.base)) (<= 1 cstrpbrk_~sc1~0.offset)), 2642#(and (<= 2 cstrpbrk_~sc1~0.offset) (<= (+ cstrpbrk_~sc1~0.offset 1) (select |#length| cstrpbrk_~sc1~0.base)))] [2018-02-04 14:59:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:06,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 14:59:06,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 14:59:06,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:59:06,971 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 13 states. [2018-02-04 14:59:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:07,292 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-02-04 14:59:07,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 14:59:07,292 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-04 14:59:07,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:07,293 INFO L225 Difference]: With dead ends: 78 [2018-02-04 14:59:07,293 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 14:59:07,293 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2018-02-04 14:59:07,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 14:59:07,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2018-02-04 14:59:07,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 14:59:07,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-02-04 14:59:07,294 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 48 [2018-02-04 14:59:07,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:07,294 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-02-04 14:59:07,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 14:59:07,295 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-02-04 14:59:07,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 14:59:07,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:07,295 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:07,295 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 14:59:07,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1675404904, now seen corresponding path program 3 times [2018-02-04 14:59:07,296 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:07,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:07,644 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 48 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 14:59:07,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:59:07,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 14:59:07,644 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:07,644 INFO 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 14:59:07,645 INFO L182 omatonBuilderFactory]: Interpolants [2816#(and (= cstrpbrk_~s~0.base cstrpbrk_~s2.base) (= cstrpbrk_~s~0.offset cstrpbrk_~s2.offset) (not (= (select (select |#memory_int| cstrpbrk_~sc1~0.base) (+ (select |#length| cstrpbrk_~sc1~0.base) (- 1))) (select (select |#memory_int| cstrpbrk_~sc1~0.base) cstrpbrk_~sc1~0.offset)))), 2817#(and (= cstrpbrk_~s~0.base cstrpbrk_~s2.base) (= cstrpbrk_~s~0.offset cstrpbrk_~s2.offset) (not (= (select (select |#memory_int| cstrpbrk_~sc1~0.base) (+ (select |#length| cstrpbrk_~sc1~0.base) (- 1))) |cstrpbrk_#t~mem2|))), 2818#(and (= cstrpbrk_~s~0.base cstrpbrk_~s2.base) (= cstrpbrk_~s~0.offset cstrpbrk_~s2.offset) (not (= (select (select |#memory_int| cstrpbrk_~sc1~0.base) (+ (select |#length| cstrpbrk_~sc1~0.base) (- 1))) cstrpbrk_~c~0))), 2819#(and (= |cstrpbrk_#t~mem7| (select (select |#memory_int| cstrpbrk_~s2.base) cstrpbrk_~s2.offset)) (not (= (select (select |#memory_int| cstrpbrk_~sc1~0.base) (+ (select |#length| cstrpbrk_~sc1~0.base) (- 1))) cstrpbrk_~c~0))), 2820#(not (= (select (select |#memory_int| cstrpbrk_~sc1~0.base) (+ (select |#length| cstrpbrk_~sc1~0.base) (- 1))) (select (select |#memory_int| cstrpbrk_~s2.base) cstrpbrk_~s2.offset))), 2821#(or (<= (+ cstrpbrk_~sc1~0.offset 2) (select |#length| cstrpbrk_~sc1~0.base)) (not (= (select (select |#memory_int| cstrpbrk_~sc1~0.base) cstrpbrk_~sc1~0.offset) (select (select |#memory_int| cstrpbrk_~s2.base) cstrpbrk_~s2.offset))) (<= (select |#length| cstrpbrk_~sc1~0.base) cstrpbrk_~sc1~0.offset)), 2822#(or (not (= (select (select |#memory_int| cstrpbrk_~sc1~0.base) cstrpbrk_~sc1~0.offset) (select (select |#memory_int| cstrpbrk_~s2.base) cstrpbrk_~s2.offset))) (and (<= (+ cstrpbrk_~sc1~0.offset 2) (select |#length| cstrpbrk_~sc1~0.base)) (<= 0 cstrpbrk_~sc1~0.offset))), 2823#(or (not (= (select (select |#memory_int| cstrpbrk_~sc1~0.base) cstrpbrk_~sc1~0.offset) (select (select |#memory_int| cstrpbrk_~s~0.base) cstrpbrk_~s~0.offset))) (and (<= (+ cstrpbrk_~sc1~0.offset 2) (select |#length| cstrpbrk_~sc1~0.base)) (<= 0 cstrpbrk_~sc1~0.offset))), 2824#(or (and (<= (+ cstrpbrk_~sc1~0.offset 2) (select |#length| cstrpbrk_~sc1~0.base)) (<= 0 cstrpbrk_~sc1~0.offset)) (and (not (= (select (select |#memory_int| cstrpbrk_~sc1~0.base) cstrpbrk_~sc1~0.offset) (select (select |#memory_int| cstrpbrk_~s~0.base) cstrpbrk_~s~0.offset))) (= |cstrpbrk_#t~mem2| (select (select |#memory_int| cstrpbrk_~sc1~0.base) cstrpbrk_~sc1~0.offset)))), 2825#(or (and (not (= (select (select |#memory_int| cstrpbrk_~sc1~0.base) cstrpbrk_~sc1~0.offset) (select (select |#memory_int| cstrpbrk_~s~0.base) cstrpbrk_~s~0.offset))) (= cstrpbrk_~c~0 (select (select |#memory_int| cstrpbrk_~sc1~0.base) cstrpbrk_~sc1~0.offset))) (and (<= (+ cstrpbrk_~sc1~0.offset 2) (select |#length| cstrpbrk_~sc1~0.base)) (<= 0 cstrpbrk_~sc1~0.offset))), 2826#(or (not (= cstrpbrk_~c~0 |cstrpbrk_#t~mem7|)) (and (<= (+ cstrpbrk_~sc1~0.offset 2) (select |#length| cstrpbrk_~sc1~0.base)) (<= 0 cstrpbrk_~sc1~0.offset))), 2827#(and (<= (+ cstrpbrk_~sc1~0.offset 2) (select |#length| cstrpbrk_~sc1~0.base)) (<= 0 cstrpbrk_~sc1~0.offset)), 2828#(and (<= (+ cstrpbrk_~sc1~0.offset 1) (select |#length| cstrpbrk_~sc1~0.base)) (<= 1 cstrpbrk_~sc1~0.offset)), 2806#true, 2807#false, 2808#(and (= 0 |main_#t~malloc10.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc10.base|)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 2809#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 2810#(and (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 2811#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 2812#(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)), 2813#(= 0 (select (select |#memory_int| |cstrpbrk_#in~s1.base|) (+ (select |#length| |cstrpbrk_#in~s1.base|) (- 1)))), 2814#(= 0 (select (select |#memory_int| cstrpbrk_~sc1~0.base) (+ (select |#length| cstrpbrk_~sc1~0.base) (- 1)))), 2815#(and (= |cstrpbrk_#t~mem1| (select (select |#memory_int| cstrpbrk_~sc1~0.base) cstrpbrk_~sc1~0.offset)) (= 0 (select (select |#memory_int| cstrpbrk_~sc1~0.base) (+ (select |#length| cstrpbrk_~sc1~0.base) (- 1)))))] [2018-02-04 14:59:07,645 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 48 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 14:59:07,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 14:59:07,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 14:59:07,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2018-02-04 14:59:07,646 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 23 states. [2018-02-04 14:59:08,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:08,434 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2018-02-04 14:59:08,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 14:59:08,435 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 63 [2018-02-04 14:59:08,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:08,435 INFO L225 Difference]: With dead ends: 156 [2018-02-04 14:59:08,435 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 14:59:08,436 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=508, Invalid=2144, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 14:59:08,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 14:59:08,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 14:59:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 14:59:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 14:59:08,436 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2018-02-04 14:59:08,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:08,436 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 14:59:08,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 14:59:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 14:59:08,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 14:59:08,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:59:08 BoogieIcfgContainer [2018-02-04 14:59:08,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 14:59:08,441 INFO L168 Benchmark]: Toolchain (without parser) took 6400.23 ms. Allocated memory was 402.7 MB in the beginning and 737.1 MB in the end (delta: 334.5 MB). Free memory was 360.7 MB in the beginning and 539.0 MB in the end (delta: -178.3 MB). Peak memory consumption was 156.2 MB. Max. memory is 5.3 GB. [2018-02-04 14:59:08,441 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 14:59:08,442 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.84 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 348.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 14:59:08,442 INFO L168 Benchmark]: Boogie Preprocessor took 26.44 ms. Allocated memory is still 402.7 MB. Free memory was 348.7 MB in the beginning and 347.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 14:59:08,442 INFO L168 Benchmark]: RCFGBuilder took 228.93 ms. Allocated memory is still 402.7 MB. Free memory was 347.4 MB in the beginning and 326.2 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. [2018-02-04 14:59:08,442 INFO L168 Benchmark]: TraceAbstraction took 5989.66 ms. Allocated memory was 402.7 MB in the beginning and 737.1 MB in the end (delta: 334.5 MB). Free memory was 326.2 MB in the beginning and 539.0 MB in the end (delta: -212.8 MB). Peak memory consumption was 121.7 MB. Max. memory is 5.3 GB. [2018-02-04 14:59:08,443 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 152.84 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 348.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.44 ms. Allocated memory is still 402.7 MB. Free memory was 348.7 MB in the beginning and 347.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 228.93 ms. Allocated memory is still 402.7 MB. Free memory was 347.4 MB in the beginning and 326.2 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5989.66 ms. Allocated memory was 402.7 MB in the beginning and 737.1 MB in the end (delta: 334.5 MB). Free memory was 326.2 MB in the beginning and 539.0 MB in the end (delta: -212.8 MB). Peak memory consumption was 121.7 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: 555]: 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, 58 locations, 15 error locations. SAFE Result, 5.9s OverallTime, 19 OverallIterations, 4 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 704 SDtfs, 1446 SDslu, 2208 SDs, 0 SdLazy, 2371 SolverSat, 198 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 31 SyntacticMatches, 8 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 18/120 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, 19 MinimizatonAttempts, 198 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 538 NumberOfCodeBlocks, 538 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 519 ConstructedInterpolants, 0 QuantifiedInterpolants, 176268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 18/120 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/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_14-59-08-447.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_14-59-08-447.csv Received shutdown request...