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-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:32:54,658 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:32:54,659 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:32:54,675 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:32:54,675 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:32:54,676 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:32:54,678 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:32:54,679 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:32:54,682 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:32:54,683 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:32:54,683 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:32:54,684 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:32:54,685 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:32:54,686 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:32:54,687 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:32:54,690 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:32:54,692 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:32:54,694 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:32:54,696 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:32:54,697 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:32:54,700 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:32:54,700 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:32:54,700 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:32:54,701 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:32:54,702 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:32:54,704 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:32:54,704 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:32:54,705 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:32:54,705 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:32:54,705 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:32:54,706 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:32:54,706 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:32:54,715 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:32:54,715 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:32:54,716 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:32:54,716 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:32:54,716 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:32:54,716 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:32:54,717 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:32:54,717 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:32:54,717 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:32:54,717 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:32:54,717 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:32:54,718 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:32:54,718 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:32:54,718 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:32:54,718 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:32:54,718 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:32:54,718 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:32:54,718 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:32:54,719 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:32:54,719 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:32:54,719 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:32:54,719 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:32:54,719 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:32:54,719 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:32:54,720 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:32:54,720 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:32:54,720 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:32:54,720 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:32:54,720 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:32:54,721 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:32:54,721 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:32:54,721 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:32:54,721 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:32:54,721 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:32:54,721 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:32:54,722 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:32:54,722 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:32:54,758 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:32:54,769 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:32:54,772 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:32:54,774 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:32:54,774 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:32:54,774 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrchr-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:32:55,014 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:32:55,020 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:32:55,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:32:55,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:32:55,026 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:32:55,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:32:55" (1/1) ... [2018-01-25 02:32:55,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96a551d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:55, skipping insertion in model container [2018-01-25 02:32:55,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:32:55" (1/1) ... [2018-01-25 02:32:55,045 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:32:55,106 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:32:55,252 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:32:55,280 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:32:55,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:55 WrapperNode [2018-01-25 02:32:55,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:32:55,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:32:55,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:32:55,291 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:32:55,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:55" (1/1) ... [2018-01-25 02:32:55,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:55" (1/1) ... [2018-01-25 02:32:55,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:55" (1/1) ... [2018-01-25 02:32:55,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:55" (1/1) ... [2018-01-25 02:32:55,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:55" (1/1) ... [2018-01-25 02:32:55,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:55" (1/1) ... [2018-01-25 02:32:55,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:55" (1/1) ... [2018-01-25 02:32:55,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:32:55,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:32:55,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:32:55,328 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:32:55,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:55" (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:32:55,385 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:32:55,385 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:32:55,386 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrchr [2018-01-25 02:32:55,386 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:32:55,386 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:32:55,386 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:32:55,386 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:32:55,386 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:32:55,387 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:32:55,387 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:32:55,387 INFO L128 BoogieDeclarations]: Found specification of procedure cstrchr [2018-01-25 02:32:55,387 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:32:55,387 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:32:55,387 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:32:55,634 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:32:55,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:32:55 BoogieIcfgContainer [2018-01-25 02:32:55,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:32:55,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:32:55,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:32:55,638 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:32:55,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:32:55" (1/3) ... [2018-01-25 02:32:55,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5211117d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:32:55, skipping insertion in model container [2018-01-25 02:32:55,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:55" (2/3) ... [2018-01-25 02:32:55,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5211117d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:32:55, skipping insertion in model container [2018-01-25 02:32:55,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:32:55" (3/3) ... [2018-01-25 02:32:55,642 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrchr-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:32:55,651 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:32:55,657 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-25 02:32:55,696 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:32:55,697 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:32:55,697 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:32:55,697 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:32:55,697 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:32:55,697 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:32:55,697 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:32:55,698 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:32:55,699 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:32:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-01-25 02:32:55,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 02:32:55,730 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:32:55,731 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:32:55,731 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:32:55,737 INFO L82 PathProgramCache]: Analyzing trace with hash 797989968, now seen corresponding path program 1 times [2018-01-25 02:32:55,740 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:32:55,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:55,787 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:32:55,787 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:55,787 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:32:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:32:55,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:32:55,909 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:32:55,911 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:32:55,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:32:55,912 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:32:55,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:32:55,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:32:55,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:32:55,927 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 4 states. [2018-01-25 02:32:56,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:32:56,127 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-01-25 02:32:56,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:32:56,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-25 02:32:56,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:32:56,137 INFO L225 Difference]: With dead ends: 56 [2018-01-25 02:32:56,138 INFO L226 Difference]: Without dead ends: 37 [2018-01-25 02:32:56,141 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:32:56,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-25 02:32:56,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-25 02:32:56,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-25 02:32:56,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-01-25 02:32:56,172 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 10 [2018-01-25 02:32:56,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:32:56,172 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-01-25 02:32:56,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:32:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-01-25 02:32:56,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 02:32:56,173 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:32:56,173 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:32:56,174 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:32:56,174 INFO L82 PathProgramCache]: Analyzing trace with hash 797989969, now seen corresponding path program 1 times [2018-01-25 02:32:56,174 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:32:56,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:56,176 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:32:56,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:56,176 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:32:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:32:56,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:32:56,387 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:32:56,388 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:32:56,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:32:56,388 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:32:56,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:32:56,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:32:56,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:32:56,391 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 5 states. [2018-01-25 02:32:56,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:32:56,453 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-01-25 02:32:56,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:32:56,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-25 02:32:56,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:32:56,454 INFO L225 Difference]: With dead ends: 37 [2018-01-25 02:32:56,455 INFO L226 Difference]: Without dead ends: 36 [2018-01-25 02:32:56,456 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:32:56,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-25 02:32:56,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-25 02:32:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-25 02:32:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-01-25 02:32:56,462 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 10 [2018-01-25 02:32:56,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:32:56,462 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-01-25 02:32:56,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:32:56,463 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-01-25 02:32:56,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 02:32:56,463 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:32:56,463 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:32:56,463 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:32:56,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1840539991, now seen corresponding path program 1 times [2018-01-25 02:32:56,464 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:32:56,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:56,465 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:32:56,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:56,465 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:32:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:32:56,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:32:56,568 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:32:56,568 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:32:56,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:32:56,568 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:32:56,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:32:56,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:32:56,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:32:56,569 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 5 states. [2018-01-25 02:32:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:32:56,685 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-01-25 02:32:56,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:32:56,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-25 02:32:56,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:32:56,687 INFO L225 Difference]: With dead ends: 36 [2018-01-25 02:32:56,687 INFO L226 Difference]: Without dead ends: 33 [2018-01-25 02:32:56,688 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:32:56,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-25 02:32:56,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-01-25 02:32:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-25 02:32:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-01-25 02:32:56,700 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 15 [2018-01-25 02:32:56,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:32:56,701 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-01-25 02:32:56,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:32:56,701 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-01-25 02:32:56,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 02:32:56,702 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:32:56,702 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:32:56,715 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:32:56,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1840539990, now seen corresponding path program 1 times [2018-01-25 02:32:56,716 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:32:56,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:56,717 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:32:56,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:56,717 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:32:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:32:56,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:32:56,876 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:32:56,876 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:32:56,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:32:56,876 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:32:56,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:32:56,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:32:56,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:32:56,877 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 8 states. [2018-01-25 02:32:57,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:32:57,047 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-01-25 02:32:57,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:32:57,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-01-25 02:32:57,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:32:57,051 INFO L225 Difference]: With dead ends: 48 [2018-01-25 02:32:57,051 INFO L226 Difference]: Without dead ends: 45 [2018-01-25 02:32:57,052 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:32:57,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-25 02:32:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-01-25 02:32:57,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 02:32:57,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-25 02:32:57,059 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 15 [2018-01-25 02:32:57,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:32:57,060 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-25 02:32:57,060 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:32:57,060 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-25 02:32:57,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 02:32:57,061 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:32:57,061 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:32:57,061 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:32:57,061 INFO L82 PathProgramCache]: Analyzing trace with hash 985116459, now seen corresponding path program 1 times [2018-01-25 02:32:57,061 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:32:57,062 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:57,063 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:32:57,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:57,063 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:32:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:32:57,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:32:57,114 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:32:57,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:32:57,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:32:57,115 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:32:57,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 02:32:57,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 02:32:57,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:32:57,116 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 3 states. [2018-01-25 02:32:57,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:32:57,127 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-01-25 02:32:57,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 02:32:57,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-25 02:32:57,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:32:57,128 INFO L225 Difference]: With dead ends: 63 [2018-01-25 02:32:57,128 INFO L226 Difference]: Without dead ends: 43 [2018-01-25 02:32:57,129 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:32:57,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-25 02:32:57,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-25 02:32:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-25 02:32:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-25 02:32:57,135 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 20 [2018-01-25 02:32:57,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:32:57,135 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-25 02:32:57,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 02:32:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-25 02:32:57,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 02:32:57,136 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:32:57,136 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] [2018-01-25 02:32:57,137 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:32:57,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1622551342, now seen corresponding path program 1 times [2018-01-25 02:32:57,137 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:32:57,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:57,138 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:32:57,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:57,139 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:32:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:32:57,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:32:57,449 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:32:57,450 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:32:57,450 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:32:57,451 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-01-25 02:32:57,454 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [8], [9], [12], [13], [16], [24], [39], [40], [44], [49], [51], [52], [53], [56], [63], [64], [65], [67] [2018-01-25 02:32:57,504 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:32:57,504 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:33:01,591 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:33:01,593 INFO L268 AbstractInterpreter]: Visited 21 different actions 37 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:33:01,616 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:33:01,617 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:33:01,617 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:33:01,630 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:01,630 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:33:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:01,675 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:33:01,707 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:33:01,710 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:33:01,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:33:01,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:33:01,721 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:33:01,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-25 02:33:01,880 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:33:01,941 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:33:01,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:33:01,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:33:02,011 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:33:02,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-25 02:33:02,173 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 17 DAG size of output 17 [2018-01-25 02:33:02,291 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:33:02,291 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:33:02,543 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:33:02,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:33:02,553 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:33:02,565 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:33:02,565 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 02:33:02,566 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:33:02,572 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:33:02,572 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-25 02:33:02,587 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:33:02,617 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:33:02,617 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:33:02,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:02,621 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:33:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:02,654 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:33:02,665 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:33:02,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:33:02,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:33:02,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 02:33:02,717 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:33:02,719 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:33:02,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:33:02,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:33:02,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:33:02,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 02:33:02,876 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 20 treesize of output 16 [2018-01-25 02:33:02,886 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 16 treesize of output 17 [2018-01-25 02:33:02,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:33:02,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:33:02,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:33:02,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:31 [2018-01-25 02:33:03,012 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:33:03,013 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:33:03,109 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:33:03,119 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:33:03,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:33:03,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:33:03,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:33:03,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-25 02:33:03,181 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:33:03,182 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:33:03,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 11, 11] total 35 [2018-01-25 02:33:03,183 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:33:03,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 02:33:03,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 02:33:03,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1119, Unknown=0, NotChecked=0, Total=1260 [2018-01-25 02:33:03,184 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 18 states. [2018-01-25 02:33:04,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:33:04,015 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-01-25 02:33:04,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 02:33:04,015 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2018-01-25 02:33:04,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:33:04,016 INFO L225 Difference]: With dead ends: 68 [2018-01-25 02:33:04,016 INFO L226 Difference]: Without dead ends: 65 [2018-01-25 02:33:04,017 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=271, Invalid=1799, Unknown=0, NotChecked=0, Total=2070 [2018-01-25 02:33:04,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-25 02:33:04,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2018-01-25 02:33:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 02:33:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-01-25 02:33:04,024 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 22 [2018-01-25 02:33:04,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:33:04,025 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-01-25 02:33:04,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 02:33:04,025 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-01-25 02:33:04,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 02:33:04,026 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:04,026 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] [2018-01-25 02:33:04,026 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:33:04,027 INFO L82 PathProgramCache]: Analyzing trace with hash 112532188, now seen corresponding path program 1 times [2018-01-25 02:33:04,027 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:04,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:04,028 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:04,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:04,028 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:04,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:04,088 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:33:04,088 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:33:04,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:33:04,089 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:33:04,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:33:04,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:33:04,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:33:04,089 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 4 states. [2018-01-25 02:33:04,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:33:04,136 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-01-25 02:33:04,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:33:04,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-25 02:33:04,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:33:04,137 INFO L225 Difference]: With dead ends: 50 [2018-01-25 02:33:04,137 INFO L226 Difference]: Without dead ends: 39 [2018-01-25 02:33:04,138 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:33:04,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-25 02:33:04,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-25 02:33:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-25 02:33:04,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-01-25 02:33:04,142 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 27 [2018-01-25 02:33:04,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:33:04,143 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-01-25 02:33:04,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:33:04,143 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-01-25 02:33:04,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 02:33:04,143 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:04,144 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:33:04,144 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:33:04,144 INFO L82 PathProgramCache]: Analyzing trace with hash 622344746, now seen corresponding path program 2 times [2018-01-25 02:33:04,144 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:04,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:04,145 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:04,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:04,145 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:04,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:04,523 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:33:04,523 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:33:04,524 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:33:04,524 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 02:33:04,524 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 02:33:04,524 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:33:04,524 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:33:04,530 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 02:33:04,531 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 02:33:04,544 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:33:04,550 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:33:04,552 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 02:33:04,555 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:33:04,561 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:33:04,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:33:04,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:33:04,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 02:33:04,612 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:33:04,620 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:33:04,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:33:04,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:33:04,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:33:04,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-25 02:33:04,831 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 20 treesize of output 16 [2018-01-25 02:33:04,844 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 16 treesize of output 13 [2018-01-25 02:33:04,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:33:04,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:33:04,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:33:04,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-25 02:33:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:33:04,954 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:33:05,383 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 41 treesize of output 39 [2018-01-25 02:33:05,435 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:33:05,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:33:05,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:33:05,466 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 39 treesize of output 37 [2018-01-25 02:33:05,485 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:33:05,486 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 02:33:05,492 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:33:05,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:33:05,508 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:98 [2018-01-25 02:33:05,627 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:33:05,661 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:33:05,661 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 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 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:33:05,666 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 02:33:05,666 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 02:33:05,679 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:33:05,692 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:33:05,708 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 02:33:05,714 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:33:05,717 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:33:05,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:33:05,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:33:05,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 02:33:05,756 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:33:05,758 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:33:05,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:33:05,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:33:05,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:33:05,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-25 02:33:05,879 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 20 treesize of output 16 [2018-01-25 02:33:05,914 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 16 treesize of output 13 [2018-01-25 02:33:05,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:33:05,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:33:05,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:33:05,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:49 [2018-01-25 02:33:05,933 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:33:05,933 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:33:06,139 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:33:06,148 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:33:06,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:33:06,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:33:06,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:33:06,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:52 [2018-01-25 02:33:06,263 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:33:06,265 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:33:06,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 11] total 38 [2018-01-25 02:33:06,265 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:33:06,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-25 02:33:06,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-25 02:33:06,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1343, Unknown=0, NotChecked=0, Total=1482 [2018-01-25 02:33:06,266 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 20 states. [2018-01-25 02:33:07,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:33:07,171 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-01-25 02:33:07,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 02:33:07,172 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-01-25 02:33:07,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:33:07,172 INFO L225 Difference]: With dead ends: 40 [2018-01-25 02:33:07,172 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 02:33:07,174 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=347, Invalid=2103, Unknown=0, NotChecked=0, Total=2450 [2018-01-25 02:33:07,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 02:33:07,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 02:33:07,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 02:33:07,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 02:33:07,174 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-01-25 02:33:07,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:33:07,175 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 02:33:07,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-25 02:33:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 02:33:07,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 02:33:07,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 02:33:07,570 WARN L146 SmtUtils]: Spent 358ms on a formula simplification. DAG size of input: 85 DAG size of output 57 [2018-01-25 02:33:07,655 INFO L401 ceAbstractionStarter]: For program point cstrchrErr3RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-25 02:33:07,655 INFO L401 ceAbstractionStarter]: For program point cstrchrEXIT(lines 540 545) no Hoare annotation was computed. [2018-01-25 02:33:07,655 INFO L401 ceAbstractionStarter]: For program point L542(lines 542 543) no Hoare annotation was computed. [2018-01-25 02:33:07,655 INFO L401 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-25 02:33:07,655 INFO L401 ceAbstractionStarter]: For program point cstrchrErr2RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-25 02:33:07,656 INFO L397 ceAbstractionStarter]: At program point L542''''''''(lines 542 543) the Hoare annotation is: (let ((.cse0 (select |#length| cstrchr_~s.base)) (.cse1 (= 1 (select |#valid| cstrchr_~s.base)))) (or (not (= 1 (select |#valid| |cstrchr_#in~s.base|))) (not (exists ((v_main_~nondetString~3.offset_BEFORE_CALL_2 Int) (main_~length~3 Int)) (and (= (select (select |#memory_int| |cstrchr_#in~s.base|) (+ v_main_~nondetString~3.offset_BEFORE_CALL_2 main_~length~3 (- 1))) 0) (<= 1 main_~length~3) (<= |cstrchr_#in~s.offset| v_main_~nondetString~3.offset_BEFORE_CALL_2) (<= (+ v_main_~nondetString~3.offset_BEFORE_CALL_2 main_~length~3) (select |#length| |cstrchr_#in~s.base|))))) (not (= 0 |cstrchr_#in~s.offset|)) (and (exists ((v_main_~nondetString~3.offset_BEFORE_CALL_4 Int)) (and (= 0 (select (select |#memory_int| cstrchr_~s.base) (+ v_main_~nondetString~3.offset_BEFORE_CALL_4 (select |#length| cstrchr_~s.base) (- 1)))) (<= v_main_~nondetString~3.offset_BEFORE_CALL_4 0) (<= 0 v_main_~nondetString~3.offset_BEFORE_CALL_4) (<= v_main_~nondetString~3.offset_BEFORE_CALL_4 cstrchr_~s.offset))) (<= 1 .cse0) .cse1 (= cstrchr_~s.offset 0)) (and (exists ((v_main_~nondetString~3.offset_BEFORE_CALL_4 Int)) (and (<= (+ v_main_~nondetString~3.offset_BEFORE_CALL_4 1) cstrchr_~s.offset) (= 0 (select (select |#memory_int| cstrchr_~s.base) (+ v_main_~nondetString~3.offset_BEFORE_CALL_4 (select |#length| cstrchr_~s.base) (- 1)))) (<= v_main_~nondetString~3.offset_BEFORE_CALL_4 0) (<= 0 v_main_~nondetString~3.offset_BEFORE_CALL_4))) (<= (+ cstrchr_~s.offset 1) .cse0) .cse1) (not (= (select (select |#memory_int| |cstrchr_#in~s.base|) (+ |cstrchr_#in~s.offset| (select |#length| |cstrchr_#in~s.base|) (- 1))) 0)))) [2018-01-25 02:33:07,656 INFO L401 ceAbstractionStarter]: For program point cstrchrErr5RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-25 02:33:07,665 INFO L401 ceAbstractionStarter]: For program point cstrchrFINAL(lines 540 545) no Hoare annotation was computed. [2018-01-25 02:33:07,666 INFO L401 ceAbstractionStarter]: For program point L542'(line 542) no Hoare annotation was computed. [2018-01-25 02:33:07,666 INFO L401 ceAbstractionStarter]: For program point cstrchrErr1RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-25 02:33:07,666 INFO L401 ceAbstractionStarter]: For program point L542'''''''''(lines 542 543) no Hoare annotation was computed. [2018-01-25 02:33:07,666 INFO L401 ceAbstractionStarter]: For program point cstrchrErr4RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-25 02:33:07,666 INFO L401 ceAbstractionStarter]: For program point L542''(line 542) no Hoare annotation was computed. [2018-01-25 02:33:07,666 INFO L401 ceAbstractionStarter]: For program point L542''''(line 542) no Hoare annotation was computed. [2018-01-25 02:33:07,666 INFO L401 ceAbstractionStarter]: For program point L542''''''(line 542) no Hoare annotation was computed. [2018-01-25 02:33:07,666 INFO L404 ceAbstractionStarter]: At program point cstrchrENTRY(lines 540 545) the Hoare annotation is: true [2018-01-25 02:33:07,666 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-25 02:33:07,667 INFO L401 ceAbstractionStarter]: For program point L542'''(line 542) no Hoare annotation was computed. [2018-01-25 02:33:07,667 INFO L401 ceAbstractionStarter]: For program point cstrchrErr0RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-25 02:33:07,667 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 555) no Hoare annotation was computed. [2018-01-25 02:33:07,667 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 555) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 02:33:07,667 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 555) no Hoare annotation was computed. [2018-01-25 02:33:07,667 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 555) the Hoare annotation is: true [2018-01-25 02:33:07,667 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 555) no Hoare annotation was computed. [2018-01-25 02:33:07,667 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 555) the Hoare annotation is: true [2018-01-25 02:33:07,667 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 555) no Hoare annotation was computed. [2018-01-25 02:33:07,668 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-25 02:33:07,668 INFO L397 ceAbstractionStarter]: At program point L553(line 553) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString~3.base))) (and (= 1 (select |#valid| main_~nondetString~3.base)) (= 0 (select (select |#memory_int| main_~nondetString~3.base) (+ .cse0 main_~nondetString~3.offset (- 1)))) (= 0 |main_#t~malloc7.offset|) (exists ((main_~length~3 Int)) (and (<= 1 main_~length~3) (= 0 (select (select |#memory_int| main_~nondetString~3.base) (+ main_~nondetString~3.offset main_~length~3 (- 1)))) (<= (+ main_~nondetString~3.offset main_~length~3) (select |#length| main_~nondetString~3.base)))) (= main_~length~3 (select |#length| |main_#t~malloc7.base|)) (= 1 (select |#valid| |main_#t~malloc7.base|)) (= (store |#valid| |main_#t~malloc7.base| 0) |old(#valid)|) (= main_~nondetString~3.offset 0) (= main_~length~3 .cse0))) [2018-01-25 02:33:07,668 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-25 02:33:07,668 INFO L401 ceAbstractionStarter]: For program point L551'(line 551) no Hoare annotation was computed. [2018-01-25 02:33:07,668 INFO L401 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-01-25 02:33:07,668 INFO L401 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-25 02:33:07,668 INFO L401 ceAbstractionStarter]: For program point L553'(line 553) no Hoare annotation was computed. [2018-01-25 02:33:07,668 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 546 555) no Hoare annotation was computed. [2018-01-25 02:33:07,669 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 546 555) no Hoare annotation was computed. [2018-01-25 02:33:07,669 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-25 02:33:07,669 INFO L401 ceAbstractionStarter]: For program point L548(lines 548 550) no Hoare annotation was computed. [2018-01-25 02:33:07,669 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 546 555) no Hoare annotation was computed. [2018-01-25 02:33:07,675 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 546 555) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 02:33:07,675 INFO L401 ceAbstractionStarter]: For program point L551''(line 551) no Hoare annotation was computed. [2018-01-25 02:33:07,675 INFO L401 ceAbstractionStarter]: For program point L548''(lines 548 550) no Hoare annotation was computed. [2018-01-25 02:33:07,684 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:33:07,685 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-25 02:33:07,686 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-25 02:33:07,686 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:33:07,686 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:33:07,686 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-25 02:33:07,687 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,687 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,687 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,687 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,688 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,688 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,688 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,688 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,691 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:33:07,691 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:33:07,692 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:33:07,692 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:33:07,692 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:33:07,692 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:33:07,693 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:33:07,693 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:33:07,693 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:33:07,693 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:33:07,699 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:33:07,699 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-25 02:33:07,699 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-25 02:33:07,700 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:33:07,700 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:33:07,700 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-25 02:33:07,700 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,701 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,701 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,701 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,701 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,701 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,702 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,702 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,702 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:33:07,703 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:33:07,703 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:33:07,703 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:33:07,703 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:33:07,704 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:33:07,704 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:33:07,704 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:33:07,704 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:33:07,704 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:33:07,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:33:07 BoogieIcfgContainer [2018-01-25 02:33:07,707 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:33:07,708 INFO L168 Benchmark]: Toolchain (without parser) took 12693.84 ms. Allocated memory was 295.7 MB in the beginning and 874.5 MB in the end (delta: 578.8 MB). Free memory was 255.6 MB in the beginning and 723.3 MB in the end (delta: -467.7 MB). Peak memory consumption was 111.1 MB. Max. memory is 5.3 GB. [2018-01-25 02:33:07,709 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 295.7 MB. Free memory is still 261.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:33:07,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.03 ms. Allocated memory is still 295.7 MB. Free memory was 254.6 MB in the beginning and 244.4 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-25 02:33:07,710 INFO L168 Benchmark]: Boogie Preprocessor took 36.71 ms. Allocated memory is still 295.7 MB. Free memory was 244.4 MB in the beginning and 243.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-25 02:33:07,710 INFO L168 Benchmark]: RCFGBuilder took 307.72 ms. Allocated memory is still 295.7 MB. Free memory was 243.4 MB in the beginning and 226.1 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 5.3 GB. [2018-01-25 02:33:07,711 INFO L168 Benchmark]: TraceAbstraction took 12071.34 ms. Allocated memory was 295.7 MB in the beginning and 874.5 MB in the end (delta: 578.8 MB). Free memory was 226.1 MB in the beginning and 723.3 MB in the end (delta: -497.2 MB). Peak memory consumption was 81.6 MB. Max. memory is 5.3 GB. [2018-01-25 02:33:07,713 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.15 ms. Allocated memory is still 295.7 MB. Free memory is still 261.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 268.03 ms. Allocated memory is still 295.7 MB. Free memory was 254.6 MB in the beginning and 244.4 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.71 ms. Allocated memory is still 295.7 MB. Free memory was 244.4 MB in the beginning and 243.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 307.72 ms. Allocated memory is still 295.7 MB. Free memory was 243.4 MB in the beginning and 226.1 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 12071.34 ms. Allocated memory was 295.7 MB in the beginning and 874.5 MB in the end (delta: 578.8 MB). Free memory was 226.1 MB in the beginning and 723.3 MB in the end (delta: -497.2 MB). Peak memory consumption was 81.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 159 LocStat_NO_SUPPORTING_DISEQUALITIES : 17 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 27 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 47 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.931024 RENAME_VARIABLES(MILLISECONDS) : 0.262214 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.882705 PROJECTAWAY(MILLISECONDS) : 0.653237 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.195720 DISJOIN(MILLISECONDS) : 0.334514 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.296411 ADD_EQUALITY(MILLISECONDS) : 0.011440 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016232 #CONJOIN_DISJUNCTIVE : 68 #RENAME_VARIABLES : 119 #UNFREEZE : 0 #CONJOIN : 109 #PROJECTAWAY : 93 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 107 #ADD_EQUALITY : 48 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - InvariantResult [Line: 542]: Loop Invariant [2018-01-25 02:33:07,721 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:33:07,721 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-25 02:33:07,721 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-25 02:33:07,721 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:33:07,721 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:33:07,722 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-25 02:33:07,722 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,722 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,722 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,722 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,723 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,727 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,728 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,728 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,728 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:33:07,729 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:33:07,729 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:33:07,729 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:33:07,729 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:33:07,729 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:33:07,730 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:33:07,730 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:33:07,730 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:33:07,730 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:33:07,737 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:33:07,738 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-25 02:33:07,738 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-25 02:33:07,738 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:33:07,738 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:33:07,738 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-25 02:33:07,739 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,739 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,742 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,742 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,742 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,742 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,743 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,743 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:33:07,743 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:33:07,743 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:33:07,744 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:33:07,744 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:33:07,744 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:33:07,744 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:33:07,744 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:33:07,745 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:33:07,745 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:33:07,745 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((!(1 == \valid[s]) || !(\exists v_main_~nondetString~3.offset_BEFORE_CALL_2 : int, main_~length~3 : int :: ((unknown-#memory_int-unknown[s][v_main_~nondetString~3.offset_BEFORE_CALL_2 + main_~length~3 + -1] == 0 && 1 <= main_~length~3) && s <= v_main_~nondetString~3.offset_BEFORE_CALL_2) && v_main_~nondetString~3.offset_BEFORE_CALL_2 + main_~length~3 <= unknown-#length-unknown[s])) || !(0 == s)) || ((((\exists v_main_~nondetString~3.offset_BEFORE_CALL_4 : int :: ((0 == unknown-#memory_int-unknown[s][v_main_~nondetString~3.offset_BEFORE_CALL_4 + unknown-#length-unknown[s] + -1] && v_main_~nondetString~3.offset_BEFORE_CALL_4 <= 0) && 0 <= v_main_~nondetString~3.offset_BEFORE_CALL_4) && v_main_~nondetString~3.offset_BEFORE_CALL_4 <= s) && 1 <= unknown-#length-unknown[s]) && 1 == \valid[s]) && s == 0)) || (((\exists v_main_~nondetString~3.offset_BEFORE_CALL_4 : int :: ((v_main_~nondetString~3.offset_BEFORE_CALL_4 + 1 <= s && 0 == unknown-#memory_int-unknown[s][v_main_~nondetString~3.offset_BEFORE_CALL_4 + unknown-#length-unknown[s] + -1]) && v_main_~nondetString~3.offset_BEFORE_CALL_4 <= 0) && 0 <= v_main_~nondetString~3.offset_BEFORE_CALL_4) && s + 1 <= unknown-#length-unknown[s]) && 1 == \valid[s])) || !(unknown-#memory_int-unknown[s][s + unknown-#length-unknown[s] + -1] == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 41 locations, 9 error locations. SAFE Result, 11.9s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 232 SDtfs, 420 SDslu, 699 SDs, 0 SdLazy, 702 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 153 SyntacticMatches, 9 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 19 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 201 HoareAnnotationTreeSize, 7 FomulaSimplifications, 11 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 425 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 336 ConstructedInterpolants, 40 QuantifiedInterpolants, 99083 SizeOfPredicates, 42 NumberOfNonLiveVariables, 390 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 4/67 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_02-33-07-753.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_02-33-07-753.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_02-33-07-753.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_02-33-07-753.csv Received shutdown request...