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_mostprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrchr_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 19:41:44,489 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 19:41:44,491 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 19:41:44,505 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 19:41:44,505 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 19:41:44,506 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 19:41:44,508 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 19:41:44,509 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 19:41:44,511 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 19:41:44,511 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 19:41:44,512 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 19:41:44,512 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 19:41:44,513 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 19:41:44,513 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 19:41:44,514 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 19:41:44,517 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 19:41:44,519 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 19:41:44,522 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 19:41:44,523 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 19:41:44,524 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 19:41:44,527 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 19:41:44,527 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 19:41:44,527 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 19:41:44,529 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 19:41:44,529 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 19:41:44,531 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 19:41:44,531 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 19:41:44,532 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 19:41:44,532 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 19:41:44,532 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 19:41:44,533 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 19:41:44,533 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_mostprecise.epf [2018-01-24 19:41:44,543 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 19:41:44,544 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 19:41:44,544 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 19:41:44,545 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 19:41:44,545 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 19:41:44,545 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 19:41:44,545 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 19:41:44,545 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 19:41:44,546 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 19:41:44,546 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 19:41:44,547 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 19:41:44,547 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 19:41:44,547 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 19:41:44,547 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 19:41:44,547 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 19:41:44,548 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 19:41:44,548 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 19:41:44,548 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 19:41:44,548 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 19:41:44,548 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 19:41:44,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 19:41:44,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 19:41:44,549 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 19:41:44,549 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 19:41:44,549 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 19:41:44,549 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 19:41:44,550 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 19:41:44,550 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 19:41:44,550 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 19:41:44,550 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 19:41:44,550 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 19:41:44,551 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 19:41:44,551 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 19:41:44,551 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 19:41:44,551 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 19:41:44,552 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 19:41:44,553 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 19:41:44,588 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 19:41:44,601 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 19:41:44,606 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 19:41:44,608 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 19:41:44,609 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 19:41:44,609 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-24 19:41:44,798 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 19:41:44,804 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 19:41:44,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 19:41:44,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 19:41:44,810 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 19:41:44,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:41:44" (1/1) ... [2018-01-24 19:41:44,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53cecf25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:41:44, skipping insertion in model container [2018-01-24 19:41:44,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:41:44" (1/1) ... [2018-01-24 19:41:44,828 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:41:44,865 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:41:44,980 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:41:44,998 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:41:45,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:41:45 WrapperNode [2018-01-24 19:41:45,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 19:41:45,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 19:41:45,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 19:41:45,007 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 19:41:45,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:41:45" (1/1) ... [2018-01-24 19:41:45,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:41:45" (1/1) ... [2018-01-24 19:41:45,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:41:45" (1/1) ... [2018-01-24 19:41:45,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:41:45" (1/1) ... [2018-01-24 19:41:45,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:41:45" (1/1) ... [2018-01-24 19:41:45,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:41:45" (1/1) ... [2018-01-24 19:41:45,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:41:45" (1/1) ... [2018-01-24 19:41:45,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 19:41:45,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 19:41:45,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 19:41:45,046 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 19:41:45,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:41:45" (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-24 19:41:45,094 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 19:41:45,094 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 19:41:45,095 INFO L136 BoogieDeclarations]: Found implementation of procedure build_nondet_String [2018-01-24 19:41:45,095 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrchr [2018-01-24 19:41:45,095 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 19:41:45,095 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 19:41:45,095 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 19:41:45,095 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 19:41:45,096 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 19:41:45,096 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 19:41:45,096 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 19:41:45,096 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 19:41:45,096 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 19:41:45,096 INFO L128 BoogieDeclarations]: Found specification of procedure build_nondet_String [2018-01-24 19:41:45,097 INFO L128 BoogieDeclarations]: Found specification of procedure cstrchr [2018-01-24 19:41:45,097 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 19:41:45,097 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 19:41:45,097 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 19:41:45,301 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 19:41:45,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:41:45 BoogieIcfgContainer [2018-01-24 19:41:45,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 19:41:45,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 19:41:45,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 19:41:45,305 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 19:41:45,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 07:41:44" (1/3) ... [2018-01-24 19:41:45,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c06b921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:41:45, skipping insertion in model container [2018-01-24 19:41:45,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:41:45" (2/3) ... [2018-01-24 19:41:45,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c06b921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:41:45, skipping insertion in model container [2018-01-24 19:41:45,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:41:45" (3/3) ... [2018-01-24 19:41:45,309 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrchr_unsafe_false-valid-deref.i [2018-01-24 19:41:45,317 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 19:41:45,325 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-24 19:41:45,377 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 19:41:45,377 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 19:41:45,377 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 19:41:45,377 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 19:41:45,377 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 19:41:45,377 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 19:41:45,378 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 19:41:45,378 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 19:41:45,379 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 19:41:45,399 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-01-24 19:41:45,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 19:41:45,405 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:41:45,406 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:41:45,407 INFO L371 AbstractCegarLoop]: === Iteration 1 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:41:45,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1462965141, now seen corresponding path program 1 times [2018-01-24 19:41:45,413 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:41:45,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:41:45,454 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:41:45,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:41:45,454 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:41:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:41:45,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:41:45,595 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-24 19:41:45,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:41:45,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:41:45,598 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:41:45,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:41:45,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:41:45,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:41:45,617 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 4 states. [2018-01-24 19:41:45,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:41:45,807 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-01-24 19:41:45,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 19:41:45,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-01-24 19:41:45,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:41:45,821 INFO L225 Difference]: With dead ends: 70 [2018-01-24 19:41:45,822 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 19:41:45,826 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-24 19:41:45,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 19:41:45,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 19:41:45,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 19:41:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-01-24 19:41:45,863 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 11 [2018-01-24 19:41:45,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:41:45,864 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-01-24 19:41:45,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:41:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-01-24 19:41:45,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 19:41:45,864 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:41:45,864 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:41:45,864 INFO L371 AbstractCegarLoop]: === Iteration 2 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:41:45,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1462965140, now seen corresponding path program 1 times [2018-01-24 19:41:45,865 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:41:45,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:41:45,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:41:45,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:41:45,866 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:41:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:41:45,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:41:46,026 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-24 19:41:46,027 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:41:46,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:41:46,027 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:41:46,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:41:46,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:41:46,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:41:46,029 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 5 states. [2018-01-24 19:41:46,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:41:46,069 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-01-24 19:41:46,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 19:41:46,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-01-24 19:41:46,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:41:46,072 INFO L225 Difference]: With dead ends: 46 [2018-01-24 19:41:46,072 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 19:41:46,073 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-24 19:41:46,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 19:41:46,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-24 19:41:46,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-24 19:41:46,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-01-24 19:41:46,079 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 11 [2018-01-24 19:41:46,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:41:46,079 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-01-24 19:41:46,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:41:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-01-24 19:41:46,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 19:41:46,080 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:41:46,080 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-24 19:41:46,080 INFO L371 AbstractCegarLoop]: === Iteration 3 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:41:46,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1548925183, now seen corresponding path program 1 times [2018-01-24 19:41:46,081 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:41:46,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:41:46,082 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:41:46,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:41:46,082 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:41:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:41:46,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:41:46,180 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-24 19:41:46,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:41:46,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 19:41:46,181 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:41:46,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 19:41:46,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 19:41:46,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:41:46,182 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 8 states. [2018-01-24 19:41:46,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:41:46,328 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-01-24 19:41:46,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 19:41:46,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 19:41:46,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:41:46,330 INFO L225 Difference]: With dead ends: 45 [2018-01-24 19:41:46,330 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 19:41:46,331 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 19:41:46,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 19:41:46,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-24 19:41:46,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 19:41:46,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-24 19:41:46,337 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 19 [2018-01-24 19:41:46,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:41:46,338 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-24 19:41:46,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 19:41:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-24 19:41:46,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 19:41:46,339 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:41:46,339 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-24 19:41:46,339 INFO L371 AbstractCegarLoop]: === Iteration 4 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:41:46,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1548925182, now seen corresponding path program 1 times [2018-01-24 19:41:46,340 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:41:46,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:41:46,341 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:41:46,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:41:46,341 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:41:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:41:46,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:41:46,571 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-24 19:41:46,571 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:41:46,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 19:41:46,571 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:41:46,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 19:41:46,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 19:41:46,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-24 19:41:46,573 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 11 states. [2018-01-24 19:41:46,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:41:46,764 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-01-24 19:41:46,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 19:41:46,765 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-01-24 19:41:46,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:41:46,768 INFO L225 Difference]: With dead ends: 56 [2018-01-24 19:41:46,768 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 19:41:46,768 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-24 19:41:46,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 19:41:46,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-01-24 19:41:46,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 19:41:46,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-01-24 19:41:46,774 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 19 [2018-01-24 19:41:46,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:41:46,774 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-01-24 19:41:46,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 19:41:46,774 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-01-24 19:41:46,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 19:41:46,775 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:41:46,775 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-24 19:41:46,775 INFO L371 AbstractCegarLoop]: === Iteration 5 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:41:46,775 INFO L82 PathProgramCache]: Analyzing trace with hash -908438943, now seen corresponding path program 1 times [2018-01-24 19:41:46,776 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:41:46,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:41:46,776 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:41:46,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:41:46,777 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:41:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:41:46,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:41:46,817 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-24 19:41:46,817 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:41:46,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:41:46,817 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:41:46,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 19:41:46,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 19:41:46,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 19:41:46,818 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 3 states. [2018-01-24 19:41:46,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:41:46,832 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-01-24 19:41:46,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 19:41:46,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-01-24 19:41:46,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:41:46,834 INFO L225 Difference]: With dead ends: 73 [2018-01-24 19:41:46,834 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 19:41:46,834 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-24 19:41:46,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 19:41:46,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 19:41:46,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 19:41:46,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-24 19:41:46,842 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 24 [2018-01-24 19:41:46,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:41:46,842 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-24 19:41:46,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 19:41:46,842 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-24 19:41:46,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 19:41:46,843 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:41:46,843 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-24 19:41:46,844 INFO L371 AbstractCegarLoop]: === Iteration 6 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:41:46,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1313023324, now seen corresponding path program 1 times [2018-01-24 19:41:46,844 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:41:46,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:41:46,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:41:46,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:41:46,845 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:41:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:41:46,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:41:47,063 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-24 19:41:47,084 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:41:47,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 19:41:47,085 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:41:47,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 19:41:47,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 19:41:47,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-01-24 19:41:47,086 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 13 states. [2018-01-24 19:41:47,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:41:47,274 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-01-24 19:41:47,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 19:41:47,274 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-01-24 19:41:47,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:41:47,275 INFO L225 Difference]: With dead ends: 105 [2018-01-24 19:41:47,276 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 19:41:47,276 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-01-24 19:41:47,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 19:41:47,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2018-01-24 19:41:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-24 19:41:47,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-01-24 19:41:47,282 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 26 [2018-01-24 19:41:47,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:41:47,283 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-01-24 19:41:47,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 19:41:47,283 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-01-24 19:41:47,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 19:41:47,284 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:41:47,284 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-24 19:41:47,284 INFO L371 AbstractCegarLoop]: === Iteration 7 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:41:47,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1293000230, now seen corresponding path program 1 times [2018-01-24 19:41:47,284 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:41:47,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:41:47,285 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:41:47,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:41:47,285 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:41:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:41:47,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:41:47,619 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-24 19:41:47,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:41:47,619 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:41:47,622 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-24 19:41:47,623 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-24 19:41:47,681 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:41:47,681 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 19:41:53,269 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 19:41:53,270 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-24 19:41:53,306 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 19:41:53,306 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:41:53,306 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-24 19:41:53,318 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:41:53,319 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:41:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:41:53,354 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:41:53,399 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-24 19:41:53,402 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-24 19:41:53,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:41:53,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:41:53,415 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-24 19:41:53,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 19:41:53,746 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-24 19:41:53,758 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-24 19:41:53,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:41:53,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:41:53,782 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-24 19:41:53,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 19:41:53,974 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-24 19:41:53,974 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:41:54,430 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-24 19:41:54,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:41:54,441 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-24 19:41:54,469 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-24 19:41:54,469 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 19:41:54,471 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:41:54,477 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-24 19:41:54,478 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 19:41:54,487 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-24 19:41:54,509 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:41:54,510 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-24 19:41:54,515 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:41:54,515 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:41:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:41:54,550 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:41:54,555 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-24 19:41:54,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:41:54,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:41:54,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 19:41:54,569 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-24 19:41:54,570 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-24 19:41:54,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:41:54,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:41:54,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:41:54,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 19:41:54,802 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-24 19:41:54,823 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-24 19:41:54,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:41:54,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:41:54,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:41:54,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:30 [2018-01-24 19:41:55,003 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-24 19:41:55,003 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:41:55,232 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-24 19:41:55,242 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-24 19:41:55,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:41:55,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:41:55,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:41:55,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 19:41:55,344 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-24 19:41:55,346 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 19:41:55,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12, 14, 14] total 49 [2018-01-24 19:41:55,346 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 19:41:55,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-24 19:41:55,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-24 19:41:55,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2257, Unknown=0, NotChecked=0, Total=2450 [2018-01-24 19:41:55,347 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 24 states. [2018-01-24 19:41:56,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:41:56,891 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2018-01-24 19:41:56,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 19:41:56,892 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2018-01-24 19:41:56,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:41:56,893 INFO L225 Difference]: With dead ends: 94 [2018-01-24 19:41:56,893 INFO L226 Difference]: Without dead ends: 91 [2018-01-24 19:41:56,894 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=344, Invalid=3438, Unknown=0, NotChecked=0, Total=3782 [2018-01-24 19:41:56,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-24 19:41:56,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 76. [2018-01-24 19:41:56,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-24 19:41:56,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2018-01-24 19:41:56,902 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 26 [2018-01-24 19:41:56,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:41:56,902 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2018-01-24 19:41:56,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-24 19:41:56,902 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2018-01-24 19:41:56,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 19:41:56,903 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:41:56,903 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-24 19:41:56,903 INFO L371 AbstractCegarLoop]: === Iteration 8 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:41:56,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1770747854, now seen corresponding path program 1 times [2018-01-24 19:41:56,904 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:41:56,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:41:56,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:41:56,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:41:56,905 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:41:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 19:41:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 19:41:56,955 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-24 19:41:56,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 07:41:56 BoogieIcfgContainer [2018-01-24 19:41:56,983 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 19:41:56,984 INFO L168 Benchmark]: Toolchain (without parser) took 12185.38 ms. Allocated memory was 307.2 MB in the beginning and 1.0 GB in the end (delta: 722.5 MB). Free memory was 265.6 MB in the beginning and 693.6 MB in the end (delta: -428.0 MB). Peak memory consumption was 294.5 MB. Max. memory is 5.3 GB. [2018-01-24 19:41:56,985 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 307.2 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 19:41:56,985 INFO L168 Benchmark]: CACSL2BoogieTranslator took 202.09 ms. Allocated memory is still 307.2 MB. Free memory was 264.6 MB in the beginning and 254.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 19:41:56,985 INFO L168 Benchmark]: Boogie Preprocessor took 38.03 ms. Allocated memory is still 307.2 MB. Free memory was 254.6 MB in the beginning and 252.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 19:41:56,986 INFO L168 Benchmark]: RCFGBuilder took 256.63 ms. Allocated memory is still 307.2 MB. Free memory was 252.6 MB in the beginning and 235.0 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. [2018-01-24 19:41:56,986 INFO L168 Benchmark]: TraceAbstraction took 11680.58 ms. Allocated memory was 307.2 MB in the beginning and 1.0 GB in the end (delta: 722.5 MB). Free memory was 235.0 MB in the beginning and 693.6 MB in the end (delta: -458.5 MB). Peak memory consumption was 263.9 MB. Max. memory is 5.3 GB. [2018-01-24 19:41:56,987 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.24 ms. Allocated memory is still 307.2 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 202.09 ms. Allocated memory is still 307.2 MB. Free memory was 264.6 MB in the beginning and 254.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.03 ms. Allocated memory is still 307.2 MB. Free memory was 254.6 MB in the beginning and 252.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 256.63 ms. Allocated memory is still 307.2 MB. Free memory was 252.6 MB in the beginning and 235.0 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 11680.58 ms. Allocated memory was 307.2 MB in the beginning and 1.0 GB in the end (delta: 722.5 MB). Free memory was 235.0 MB in the beginning and 693.6 MB in the end (delta: -458.5 MB). Peak memory consumption was 263.9 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.719325 RENAME_VARIABLES(MILLISECONDS) : 0.199853 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.682345 PROJECTAWAY(MILLISECONDS) : 0.545195 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.152798 DISJOIN(MILLISECONDS) : 0.277267 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.226462 ADD_EQUALITY(MILLISECONDS) : 0.028068 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.020646 #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, 11.6s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 2.3s 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.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 72 SyntacticMatches, 6 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 2.9s 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, 5.6s 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.1s SatisfiabilityAnalysisTime, 3.0s 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_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_19-41-56-994.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_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_19-41-56-994.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_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_19-41-56-994.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_19-41-56-994.csv Received shutdown request...