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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrchr_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:30:06,193 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:30:06,195 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:30:06,211 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:30:06,212 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:30:06,214 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:30:06,215 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:30:06,216 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:30:06,218 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:30:06,219 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:30:06,219 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:30:06,220 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:30:06,220 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:30:06,221 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:30:06,222 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:30:06,224 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:30:06,227 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:30:06,229 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:30:06,230 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:30:06,232 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:30:06,235 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:30:06,235 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:30:06,235 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:30:06,236 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:30:06,238 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:30:06,239 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:30:06,239 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:30:06,240 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:30:06,241 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:30:06,241 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:30:06,242 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:30:06,242 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 02:30:06,254 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:30:06,254 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:30:06,255 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:30:06,255 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:30:06,256 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:30:06,256 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:30:06,256 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:30:06,256 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:30:06,256 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:30:06,257 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:30:06,257 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:30:06,258 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:30:06,258 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:30:06,258 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:30:06,258 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:30:06,258 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:30:06,258 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:30:06,258 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:30:06,258 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:30:06,259 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:30:06,259 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:30:06,259 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:30:06,259 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:30:06,259 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:30:06,259 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:30:06,260 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:30:06,260 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:30:06,260 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:30:06,260 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:30:06,260 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:30:06,261 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:30:06,261 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:30:06,261 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:30:06,261 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:30:06,261 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:30:06,262 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:30:06,262 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:30:06,297 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:30:06,311 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:30:06,315 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:30:06,317 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:30:06,318 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:30:06,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrchr_unsafe_false-valid-deref.i [2018-01-25 02:30:06,531 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:30:06,537 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:30:06,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:30:06,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:30:06,547 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:30:06,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:30:06" (1/1) ... [2018-01-25 02:30:06,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb77e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:30:06, skipping insertion in model container [2018-01-25 02:30:06,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:30:06" (1/1) ... [2018-01-25 02:30:06,572 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:30:06,613 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:30:06,762 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:30:06,779 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:30:06,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:30:06 WrapperNode [2018-01-25 02:30:06,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:30:06,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:30:06,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:30:06,791 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:30:06,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:30:06" (1/1) ... [2018-01-25 02:30:06,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:30:06" (1/1) ... [2018-01-25 02:30:06,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:30:06" (1/1) ... [2018-01-25 02:30:06,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:30:06" (1/1) ... [2018-01-25 02:30:06,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:30:06" (1/1) ... [2018-01-25 02:30:06,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:30:06" (1/1) ... [2018-01-25 02:30:06,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:30:06" (1/1) ... [2018-01-25 02:30:06,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:30:06,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:30:06,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:30:06,823 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:30:06,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:30:06" (1/1) ... No working directory specified, using /storage/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-01-25 02:30:06,888 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:30:06,888 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:30:06,888 INFO L136 BoogieDeclarations]: Found implementation of procedure build_nondet_String [2018-01-25 02:30:06,888 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrchr [2018-01-25 02:30:06,888 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:30:06,889 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:30:06,889 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:30:06,889 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:30:06,889 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:30:06,889 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:30:06,889 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 02:30:06,890 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 02:30:06,890 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:30:06,890 INFO L128 BoogieDeclarations]: Found specification of procedure build_nondet_String [2018-01-25 02:30:06,890 INFO L128 BoogieDeclarations]: Found specification of procedure cstrchr [2018-01-25 02:30:06,890 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:30:06,890 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:30:06,891 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:30:07,265 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:30:07,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:30:07 BoogieIcfgContainer [2018-01-25 02:30:07,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:30:07,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:30:07,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:30:07,277 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:30:07,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:30:06" (1/3) ... [2018-01-25 02:30:07,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5875979b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:30:07, skipping insertion in model container [2018-01-25 02:30:07,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:30:06" (2/3) ... [2018-01-25 02:30:07,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5875979b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:30:07, skipping insertion in model container [2018-01-25 02:30:07,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:30:07" (3/3) ... [2018-01-25 02:30:07,291 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrchr_unsafe_false-valid-deref.i [2018-01-25 02:30:07,306 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:30:07,316 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-25 02:30:07,391 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:30:07,391 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:30:07,391 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:30:07,392 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:30:07,392 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:30:07,392 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:30:07,392 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:30:07,392 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:30:07,395 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:30:07,468 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-01-25 02:30:07,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-25 02:30:07,480 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:30:07,483 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:30:07,484 INFO L371 AbstractCegarLoop]: === Iteration 1 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:30:07,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1462965141, now seen corresponding path program 1 times [2018-01-25 02:30:07,495 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:30:07,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:07,560 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:30:07,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:07,560 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:30:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:30:07,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:30:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:30:07,832 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:30:07,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:30:07,833 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:30:07,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:30:07,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:30:07,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:30:07,850 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 4 states. [2018-01-25 02:30:08,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:30:08,081 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-01-25 02:30:08,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:30:08,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-01-25 02:30:08,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:30:08,096 INFO L225 Difference]: With dead ends: 70 [2018-01-25 02:30:08,097 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 02:30:08,101 INFO L525 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-01-25 02:30:08,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 02:30:08,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-25 02:30:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 02:30:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-01-25 02:30:08,143 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 11 [2018-01-25 02:30:08,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:30:08,143 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-01-25 02:30:08,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:30:08,144 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-01-25 02:30:08,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-25 02:30:08,144 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:30:08,144 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:30:08,145 INFO L371 AbstractCegarLoop]: === Iteration 2 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:30:08,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1462965140, now seen corresponding path program 1 times [2018-01-25 02:30:08,145 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:30:08,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:08,147 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:30:08,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:08,148 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:30:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:30:08,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:30:08,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:30:08,317 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:30:08,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:30:08,318 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:30:08,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:30:08,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:30:08,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:30:08,323 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 5 states. [2018-01-25 02:30:08,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:30:08,387 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-01-25 02:30:08,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:30:08,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-01-25 02:30:08,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:30:08,389 INFO L225 Difference]: With dead ends: 46 [2018-01-25 02:30:08,389 INFO L226 Difference]: Without dead ends: 45 [2018-01-25 02:30:08,391 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:30:08,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-25 02:30:08,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-25 02:30:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-25 02:30:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-01-25 02:30:08,397 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 11 [2018-01-25 02:30:08,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:30:08,398 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-01-25 02:30:08,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:30:08,398 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-01-25 02:30:08,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 02:30:08,399 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:30:08,399 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:30:08,399 INFO L371 AbstractCegarLoop]: === Iteration 3 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:30:08,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1548925183, now seen corresponding path program 1 times [2018-01-25 02:30:08,400 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:30:08,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:08,401 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:30:08,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:08,401 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:30:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:30:08,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:30:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:30:08,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:30:08,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:30:08,563 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:30:08,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:30:08,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:30:08,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:30:08,564 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 8 states. [2018-01-25 02:30:08,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:30:08,766 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-01-25 02:30:08,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:30:08,766 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-25 02:30:08,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:30:08,768 INFO L225 Difference]: With dead ends: 45 [2018-01-25 02:30:08,768 INFO L226 Difference]: Without dead ends: 41 [2018-01-25 02:30:08,769 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:30:08,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-25 02:30:08,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-25 02:30:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 02:30:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-25 02:30:08,776 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 19 [2018-01-25 02:30:08,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:30:08,777 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-25 02:30:08,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:30:08,777 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-25 02:30:08,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 02:30:08,778 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:30:08,778 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:30:08,778 INFO L371 AbstractCegarLoop]: === Iteration 4 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:30:08,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1548925182, now seen corresponding path program 1 times [2018-01-25 02:30:08,779 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:30:08,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:08,780 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:30:08,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:08,780 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:30:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:30:08,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:30:08,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:30:08,979 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:30:08,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 02:30:08,980 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:30:08,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 02:30:08,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 02:30:08,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-25 02:30:08,981 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 11 states. [2018-01-25 02:30:09,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:30:09,200 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-01-25 02:30:09,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 02:30:09,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-01-25 02:30:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:30:09,205 INFO L225 Difference]: With dead ends: 56 [2018-01-25 02:30:09,205 INFO L226 Difference]: Without dead ends: 52 [2018-01-25 02:30:09,206 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-25 02:30:09,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-25 02:30:09,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-01-25 02:30:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 02:30:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-01-25 02:30:09,214 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 19 [2018-01-25 02:30:09,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:30:09,214 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-01-25 02:30:09,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 02:30:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-01-25 02:30:09,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 02:30:09,216 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:30:09,216 INFO L322 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] [2018-01-25 02:30:09,216 INFO L371 AbstractCegarLoop]: === Iteration 5 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:30:09,217 INFO L82 PathProgramCache]: Analyzing trace with hash -908438943, now seen corresponding path program 1 times [2018-01-25 02:30:09,217 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:30:09,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:09,218 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:30:09,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:09,218 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:30:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:30:09,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:30:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:30:09,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:30:09,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:30:09,285 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:30:09,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 02:30:09,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 02:30:09,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:30:09,286 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 3 states. [2018-01-25 02:30:09,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:30:09,318 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-01-25 02:30:09,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 02:30:09,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-01-25 02:30:09,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:30:09,320 INFO L225 Difference]: With dead ends: 73 [2018-01-25 02:30:09,320 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 02:30:09,321 INFO L525 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-01-25 02:30:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 02:30:09,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-25 02:30:09,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 02:30:09,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-25 02:30:09,327 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 24 [2018-01-25 02:30:09,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:30:09,328 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-25 02:30:09,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 02:30:09,328 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-25 02:30:09,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 02:30:09,328 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:30:09,328 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:30:09,328 INFO L371 AbstractCegarLoop]: === Iteration 6 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:30:09,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1313023324, now seen corresponding path program 1 times [2018-01-25 02:30:09,329 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:30:09,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:09,330 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:30:09,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:09,330 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:30:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:30:09,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:30:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:30:09,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:30:09,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-25 02:30:09,798 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:30:09,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 02:30:09,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 02:30:09,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-01-25 02:30:09,799 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 13 states. [2018-01-25 02:30:10,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:30:10,051 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-01-25 02:30:10,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 02:30:10,052 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-01-25 02:30:10,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:30:10,053 INFO L225 Difference]: With dead ends: 105 [2018-01-25 02:30:10,053 INFO L226 Difference]: Without dead ends: 77 [2018-01-25 02:30:10,054 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-01-25 02:30:10,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-25 02:30:10,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2018-01-25 02:30:10,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-25 02:30:10,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-01-25 02:30:10,060 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 26 [2018-01-25 02:30:10,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:30:10,061 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-01-25 02:30:10,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 02:30:10,061 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-01-25 02:30:10,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 02:30:10,061 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:30:10,062 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:30:10,062 INFO L371 AbstractCegarLoop]: === Iteration 7 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:30:10,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1293000230, now seen corresponding path program 1 times [2018-01-25 02:30:10,062 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:30:10,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:10,063 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:30:10,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:10,063 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:30:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:30:10,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:30:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:30:10,461 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:30:10,461 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:30:10,462 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-25 02:30:10,464 INFO L201 CegarAbsIntRunner]: [0], [5], [7], [8], [9], [12], [13], [14], [18], [20], [22], [23], [26], [27], [30], [38], [54], [66], [67], [71], [72], [73], [75], [76], [77] [2018-01-25 02:30:10,531 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:30:10,531 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:30:17,443 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:30:17,445 INFO L268 AbstractInterpreter]: Visited 25 different actions 41 times. Merged at 8 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-01-25 02:30:17,459 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:30:17,459 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:30:17,459 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:30:17,476 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:30:17,476 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:30:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:30:17,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:30:17,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-25 02:30:17,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-25 02:30:17,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:30:17,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:30:17,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 02:30:17,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-25 02:30:17,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-25 02:30:17,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-25 02:30:17,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:30:17,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:30:18,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:30:18,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-25 02:30:18,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:30:18,185 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:30:18,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-25 02:30:18,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:30:18,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 02:30:18,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 02:30:18,852 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 02:30:18,868 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:30:18,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:30:18,874 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-25 02:30:18,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:30:18,902 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:30:18,903 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:30:18,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:30:18,924 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:30:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:30:18,959 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:30:18,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 02:30:18,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:30:18,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:30:18,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 02:30:18,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 02:30:18,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 02:30:18,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:30:18,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:30:18,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:30:18,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 02:30:19,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-25 02:30:19,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 16 [2018-01-25 02:30:19,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:30:19,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:30:19,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:30:19,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:30 [2018-01-25 02:30:19,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:30:19,389 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:30:19,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 02:30:19,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 02:30:19,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:30:19,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:30:19,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:30:19,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-25 02:30:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:30:19,808 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:30:19,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12, 14, 14] total 49 [2018-01-25 02:30:19,808 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:30:19,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-25 02:30:19,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-25 02:30:19,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2257, Unknown=0, NotChecked=0, Total=2450 [2018-01-25 02:30:19,809 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 24 states. [2018-01-25 02:30:21,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:30:21,832 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2018-01-25 02:30:21,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 02:30:21,833 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2018-01-25 02:30:21,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:30:21,834 INFO L225 Difference]: With dead ends: 94 [2018-01-25 02:30:21,834 INFO L226 Difference]: Without dead ends: 91 [2018-01-25 02:30:21,835 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=344, Invalid=3438, Unknown=0, NotChecked=0, Total=3782 [2018-01-25 02:30:21,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-25 02:30:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 76. [2018-01-25 02:30:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-25 02:30:21,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2018-01-25 02:30:21,847 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 26 [2018-01-25 02:30:21,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:30:21,847 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2018-01-25 02:30:21,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-25 02:30:21,848 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2018-01-25 02:30:21,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 02:30:21,849 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:30:21,849 INFO L322 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-01-25 02:30:21,849 INFO L371 AbstractCegarLoop]: === Iteration 8 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:30:21,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1770747854, now seen corresponding path program 1 times [2018-01-25 02:30:21,849 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:30:21,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:21,850 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:30:21,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:30:21,851 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:30:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 02:30:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 02:30:21,914 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-25 02:30:21,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:30:21 BoogieIcfgContainer [2018-01-25 02:30:21,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:30:21,974 INFO L168 Benchmark]: Toolchain (without parser) took 15442.46 ms. Allocated memory was 305.7 MB in the beginning and 1.0 GB in the end (delta: 727.7 MB). Free memory was 264.0 MB in the beginning and 578.9 MB in the end (delta: -314.9 MB). Peak memory consumption was 412.8 MB. Max. memory is 5.3 GB. [2018-01-25 02:30:21,975 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 305.7 MB. Free memory is still 269.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:30:21,975 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.23 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 253.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:30:21,976 INFO L168 Benchmark]: Boogie Preprocessor took 30.90 ms. Allocated memory is still 305.7 MB. Free memory was 253.0 MB in the beginning and 251.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:30:21,976 INFO L168 Benchmark]: RCFGBuilder took 450.34 ms. Allocated memory is still 305.7 MB. Free memory was 251.0 MB in the beginning and 233.4 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. [2018-01-25 02:30:21,976 INFO L168 Benchmark]: TraceAbstraction took 14699.65 ms. Allocated memory was 305.7 MB in the beginning and 1.0 GB in the end (delta: 727.7 MB). Free memory was 233.4 MB in the beginning and 578.9 MB in the end (delta: -345.5 MB). Peak memory consumption was 382.3 MB. Max. memory is 5.3 GB. [2018-01-25 02:30:21,978 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.20 ms. Allocated memory is still 305.7 MB. Free memory is still 269.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 252.23 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 253.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.90 ms. Allocated memory is still 305.7 MB. Free memory was 253.0 MB in the beginning and 251.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 450.34 ms. Allocated memory is still 305.7 MB. Free memory was 251.0 MB in the beginning and 233.4 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 14699.65 ms. Allocated memory was 305.7 MB in the beginning and 1.0 GB in the end (delta: 727.7 MB). Free memory was 233.4 MB in the beginning and 578.9 MB in the end (delta: -345.5 MB). Peak memory consumption was 382.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 187 LocStat_NO_SUPPORTING_DISEQUALITIES : 21 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 59 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 36 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.504814 RENAME_VARIABLES(MILLISECONDS) : 0.127371 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.480051 PROJECTAWAY(MILLISECONDS) : 0.410938 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.137024 DISJOIN(MILLISECONDS) : 0.167144 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.147254 ADD_EQUALITY(MILLISECONDS) : 0.016651 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.050999 #CONJOIN_DISJUNCTIVE : 76 #RENAME_VARIABLES : 132 #UNFREEZE : 0 #CONJOIN : 127 #PROJECTAWAY : 108 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 120 #ADD_EQUALITY : 60 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L556] CALL, EXPR build_nondet_String() [L541] int length = __VERIFIER_nondet_int(); [L542] COND TRUE length < 1 [L543] length = 1 VAL [length=1] [L545] EXPR, FCALL malloc(length * sizeof(char)) VAL [length=1, malloc(length * sizeof(char))={3:0}] [L545] char* nondetString = (char*) malloc(length * sizeof(char)); VAL [length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L546] FCALL nondetString[length-1] = '\0' VAL [length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L547] RET return nondetString; VAL [\result={3:0}, length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L556] EXPR build_nondet_String() VAL [build_nondet_String()={3:0}] [L556] char* s = build_nondet_String(); [L557] CALL cstrchr(s,__VERIFIER_nondet_int()) VAL [\old(c)=1, s={3:0}] [L551] EXPR, FCALL \read(*s) VAL [\old(c)=1, \read(*s)=0, c=1, s={3:0}, s={3:0}] [L551] *s != '\0' && *s != (char)c VAL [*s != '\0' && *s != (char)c=0, \old(c)=1, \read(*s)=0, c=1, s={3:0}, s={3:0}] [L551] COND FALSE !(*s != '\0' && *s != (char)c) [L553] EXPR, FCALL \read(*s) VAL [\old(c)=1, \read(*s)=0, c=1, s={3:0}, s={3:0}] [L553] COND FALSE, EXPR !((*s == c) ? (char *) s : 0) VAL [(*s == c) ? (char *) s : 0={0:0}, \old(c)=1, \read(*s)=0, c=1, s={3:0}, s={3:0}] [L553] RET return ( (*s == c) ? (char *) s : 0 ); [L557] cstrchr(s,__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=1, cstrchr(s,__VERIFIER_nondet_int())={0:0}, s={3:0}] [L557] FCALL cstrchr(s,__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=1, cstrchr(s,__VERIFIER_nondet_int())={0:0}, s={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 50 locations, 13 error locations. UNSAFE Result, 14.6s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 250 SDtfs, 348 SDslu, 1048 SDs, 0 SdLazy, 974 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 72 SyntacticMatches, 6 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.9s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 27 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 229 ConstructedInterpolants, 14 QuantifiedInterpolants, 42830 SizeOfPredicates, 25 NumberOfNonLiveVariables, 214 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 4/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrchr_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_02-30-21-989.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrchr_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_02-30-21-989.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrchr_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_02-30-21-989.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrchr_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_02-30-21-989.csv Received shutdown request...