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.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrchr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:12:10,022 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:12:10,024 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:12:10,036 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:12:10,037 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:12:10,038 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:12:10,039 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:12:10,040 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:12:10,043 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:12:10,043 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:12:10,044 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:12:10,044 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:12:10,045 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:12:10,045 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:12:10,046 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:12:10,049 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:12:10,051 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:12:10,053 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:12:10,054 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:12:10,055 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:12:10,058 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:12:10,058 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:12:10,058 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:12:10,059 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:12:10,060 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:12:10,061 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:12:10,061 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:12:10,062 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:12:10,062 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:12:10,062 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:12:10,063 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:12:10,063 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.epf [2018-01-24 15:12:10,073 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:12:10,073 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:12:10,074 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:12:10,074 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:12:10,075 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:12:10,075 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:12:10,075 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:12:10,076 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:12:10,076 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:12:10,076 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:12:10,076 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:12:10,076 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:12:10,077 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:12:10,077 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:12:10,077 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:12:10,077 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:12:10,077 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:12:10,078 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:12:10,078 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:12:10,078 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:12:10,078 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:12:10,078 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:12:10,079 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:12:10,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:12:10,079 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:12:10,079 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:12:10,079 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:12:10,080 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:12:10,080 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:12:10,080 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:12:10,080 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:12:10,080 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:12:10,080 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:12:10,081 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:12:10,081 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:12:10,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:12:10,130 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:12:10,134 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:12:10,135 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:12:10,136 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:12:10,136 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-24 15:12:10,299 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:12:10,305 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:12:10,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:12:10,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:12:10,311 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:12:10,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:12:10" (1/1) ... [2018-01-24 15:12:10,314 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 24.01 03:12:10, skipping insertion in model container [2018-01-24 15:12:10,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:12:10" (1/1) ... [2018-01-24 15:12:10,328 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:12:10,365 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:12:10,483 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:12:10,500 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:12:10,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:12:10 WrapperNode [2018-01-24 15:12:10,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:12:10,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:12:10,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:12:10,509 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:12:10,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:12:10" (1/1) ... [2018-01-24 15:12:10,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:12:10" (1/1) ... [2018-01-24 15:12:10,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:12:10" (1/1) ... [2018-01-24 15:12:10,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:12:10" (1/1) ... [2018-01-24 15:12:10,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:12:10" (1/1) ... [2018-01-24 15:12:10,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:12:10" (1/1) ... [2018-01-24 15:12:10,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:12:10" (1/1) ... [2018-01-24 15:12:10,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:12:10,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:12:10,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:12:10,542 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:12:10,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:12:10" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:12:10,587 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:12:10,587 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:12:10,587 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrchr [2018-01-24 15:12:10,587 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:12:10,588 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:12:10,588 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:12:10,588 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:12:10,588 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:12:10,588 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:12:10,588 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:12:10,588 INFO L128 BoogieDeclarations]: Found specification of procedure cstrchr [2018-01-24 15:12:10,588 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:12:10,588 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:12:10,588 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:12:10,785 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:12:10,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:12:10 BoogieIcfgContainer [2018-01-24 15:12:10,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:12:10,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:12:10,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:12:10,788 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:12:10,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:12:10" (1/3) ... [2018-01-24 15:12:10,789 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 24.01 03:12:10, skipping insertion in model container [2018-01-24 15:12:10,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:12:10" (2/3) ... [2018-01-24 15:12:10,790 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 24.01 03:12:10, skipping insertion in model container [2018-01-24 15:12:10,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:12:10" (3/3) ... [2018-01-24 15:12:10,792 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrchr-alloca_true-valid-memsafety_true-termination.i [2018-01-24 15:12:10,799 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:12:10,807 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 15:12:10,847 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:12:10,847 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:12:10,847 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:12:10,848 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:12:10,848 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:12:10,848 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:12:10,848 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:12:10,848 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:12:10,849 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:12:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-01-24 15:12:10,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 15:12:10,879 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:12:10,881 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:12:10,881 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:12:10,887 INFO L82 PathProgramCache]: Analyzing trace with hash 797989968, now seen corresponding path program 1 times [2018-01-24 15:12:10,890 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:12:10,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:10,936 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:10,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:10,936 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:12:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:10,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:12:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:11,072 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:12:11,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:12:11,073 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:12:11,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:12:11,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:12:11,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:12:11,088 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 4 states. [2018-01-24 15:12:11,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:12:11,268 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-01-24 15:12:11,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:12:11,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 15:12:11,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:12:11,279 INFO L225 Difference]: With dead ends: 56 [2018-01-24 15:12:11,279 INFO L226 Difference]: Without dead ends: 37 [2018-01-24 15:12:11,283 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:12:11,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-24 15:12:11,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-24 15:12:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 15:12:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-01-24 15:12:11,315 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 10 [2018-01-24 15:12:11,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:12:11,315 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-01-24 15:12:11,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:12:11,316 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-01-24 15:12:11,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 15:12:11,316 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:12:11,316 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:12:11,316 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:12:11,316 INFO L82 PathProgramCache]: Analyzing trace with hash 797989969, now seen corresponding path program 1 times [2018-01-24 15:12:11,317 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:12:11,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:11,318 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:11,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:11,318 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:12:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:11,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:12:11,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:11,470 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:12:11,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:12:11,470 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:12:11,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:12:11,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:12:11,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:12:11,472 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 5 states. [2018-01-24 15:12:11,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:12:11,552 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-01-24 15:12:11,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:12:11,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-24 15:12:11,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:12:11,553 INFO L225 Difference]: With dead ends: 37 [2018-01-24 15:12:11,554 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 15:12:11,555 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:12:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 15:12:11,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 15:12:11,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 15:12:11,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-01-24 15:12:11,560 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 10 [2018-01-24 15:12:11,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:12:11,561 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-01-24 15:12:11,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:12:11,561 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-01-24 15:12:11,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 15:12:11,561 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:12:11,562 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:12:11,562 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:12:11,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1840539991, now seen corresponding path program 1 times [2018-01-24 15:12:11,562 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:12:11,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:11,563 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:11,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:11,564 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:12:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:11,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:12:11,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:11,618 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:12:11,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:12:11,618 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:12:11,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:12:11,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:12:11,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:12:11,619 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 5 states. [2018-01-24 15:12:11,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:12:11,698 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-01-24 15:12:11,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:12:11,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 15:12:11,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:12:11,699 INFO L225 Difference]: With dead ends: 36 [2018-01-24 15:12:11,699 INFO L226 Difference]: Without dead ends: 33 [2018-01-24 15:12:11,700 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-24 15:12:11,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-24 15:12:11,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-01-24 15:12:11,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-24 15:12:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-01-24 15:12:11,704 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 15 [2018-01-24 15:12:11,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:12:11,704 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-01-24 15:12:11,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:12:11,704 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-01-24 15:12:11,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 15:12:11,705 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:12:11,705 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:12:11,705 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:12:11,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1840539990, now seen corresponding path program 1 times [2018-01-24 15:12:11,705 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:12:11,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:11,706 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:11,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:11,706 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:12:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:11,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:12:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:11,855 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:12:11,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:12:11,856 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:12:11,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:12:11,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:12:11,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:12:11,857 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 8 states. [2018-01-24 15:12:11,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:12:11,988 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-01-24 15:12:11,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:12:11,989 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-01-24 15:12:11,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:12:11,991 INFO L225 Difference]: With dead ends: 48 [2018-01-24 15:12:11,991 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 15:12:11,992 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-24 15:12:11,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 15:12:11,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-01-24 15:12:11,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 15:12:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-24 15:12:11,999 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 15 [2018-01-24 15:12:11,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:12:11,999 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-24 15:12:11,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:12:12,000 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-24 15:12:12,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 15:12:12,000 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:12:12,001 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-24 15:12:12,001 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:12:12,001 INFO L82 PathProgramCache]: Analyzing trace with hash 985116459, now seen corresponding path program 1 times [2018-01-24 15:12:12,001 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:12:12,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:12,002 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:12,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:12,003 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:12:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:12,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:12:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:12,038 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:12:12,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:12:12,038 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:12:12,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:12:12,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:12:12,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:12:12,039 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 3 states. [2018-01-24 15:12:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:12:12,049 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-01-24 15:12:12,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:12:12,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-24 15:12:12,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:12:12,051 INFO L225 Difference]: With dead ends: 63 [2018-01-24 15:12:12,051 INFO L226 Difference]: Without dead ends: 43 [2018-01-24 15:12:12,052 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:12:12,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-24 15:12:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-24 15:12:12,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 15:12:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-24 15:12:12,059 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 20 [2018-01-24 15:12:12,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:12:12,059 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-24 15:12:12,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:12:12,059 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-24 15:12:12,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 15:12:12,060 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:12:12,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, 1, 1] [2018-01-24 15:12:12,061 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:12:12,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1622551342, now seen corresponding path program 1 times [2018-01-24 15:12:12,061 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:12:12,062 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:12,062 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:12,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:12,063 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:12:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:12,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:12:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:12,392 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:12:12,392 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:12:12,393 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-01-24 15:12:12,395 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-24 15:12:12,440 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:12:12,441 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:12:12,968 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:12:12,969 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-24 15:12:12,985 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:12:12,985 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:12:12,985 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:12:13,010 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:13,010 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:12:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:13,048 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:12:13,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 15:12:13,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 15:12:13,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:13,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:13,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 15:12:13,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 15:12:13,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-24 15:12:13,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 15:12:13,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:12:13,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:12:13,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:12:13,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 15:12:13,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:13,475 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:12:13,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 15:12:13,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:13,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 15:12:13,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:12:13,765 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:13,767 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:13,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:13,773 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 15:12:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:13,821 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:12:13,821 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:12:13,828 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:13,828 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:12:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:13,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:12:13,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:12:13,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:13,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:13,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 15:12:13,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 15:12:13,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 15:12:13,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:13,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:13,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:13,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 15:12:14,041 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-24 15:12:14,048 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-24 15:12:14,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:12:14,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:12:14,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:12:14,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:31 [2018-01-24 15:12:14,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:14,163 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:12:14,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 15:12:14,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:12:14,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:14,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:14,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:14,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 15:12:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:14,324 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:12:14,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 11, 11] total 35 [2018-01-24 15:12:14,324 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:12:14,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 15:12:14,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 15:12:14,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1119, Unknown=0, NotChecked=0, Total=1260 [2018-01-24 15:12:14,325 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 18 states. [2018-01-24 15:12:14,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:12:15,000 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-01-24 15:12:15,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 15:12:15,000 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2018-01-24 15:12:15,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:12:15,001 INFO L225 Difference]: With dead ends: 68 [2018-01-24 15:12:15,001 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 15:12:15,002 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=271, Invalid=1799, Unknown=0, NotChecked=0, Total=2070 [2018-01-24 15:12:15,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 15:12:15,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2018-01-24 15:12:15,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 15:12:15,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-01-24 15:12:15,010 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 22 [2018-01-24 15:12:15,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:12:15,010 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-01-24 15:12:15,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 15:12:15,010 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-01-24 15:12:15,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 15:12:15,011 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:12:15,011 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-24 15:12:15,011 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:12:15,011 INFO L82 PathProgramCache]: Analyzing trace with hash 112532188, now seen corresponding path program 1 times [2018-01-24 15:12:15,012 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:12:15,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:15,013 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:15,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:15,013 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:12:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:15,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:12:15,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:15,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:12:15,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:12:15,075 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:12:15,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:12:15,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:12:15,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:12:15,076 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 4 states. [2018-01-24 15:12:15,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:12:15,117 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-01-24 15:12:15,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:12:15,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-24 15:12:15,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:12:15,118 INFO L225 Difference]: With dead ends: 50 [2018-01-24 15:12:15,118 INFO L226 Difference]: Without dead ends: 39 [2018-01-24 15:12:15,119 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-24 15:12:15,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-24 15:12:15,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-24 15:12:15,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 15:12:15,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-01-24 15:12:15,125 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 27 [2018-01-24 15:12:15,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:12:15,126 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-01-24 15:12:15,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:12:15,126 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-01-24 15:12:15,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 15:12:15,126 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:12:15,126 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-24 15:12:15,126 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:12:15,127 INFO L82 PathProgramCache]: Analyzing trace with hash 622344746, now seen corresponding path program 2 times [2018-01-24 15:12:15,127 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:12:15,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:15,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:15,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:15,128 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:12:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:15,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:12:15,504 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-24 15:12:15,505 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:12:15,505 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:12:15,505 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:12:15,505 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:12:15,505 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:12:15,505 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-24 15:12:15,511 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:12:15,512 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:12:15,523 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:12:15,530 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:12:15,533 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:12:15,536 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:12:15,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:12:15,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:15,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:15,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:12:15,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 15:12:15,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 15:12:15,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:15,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:15,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:15,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-24 15:12:15,751 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-24 15:12:15,763 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-24 15:12:15,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:12:15,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:12:15,776 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-24 15:12:15,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-24 15:12:15,856 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-24 15:12:15,856 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:12:16,151 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-24 15:12:16,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:12:16,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:16,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:16,221 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-24 15:12:16,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:12:16,241 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:16,248 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:16,263 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-24 15:12:16,263 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:98 [2018-01-24 15:12:16,374 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-24 15:12:16,396 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:12:16,396 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-24 15:12:16,407 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:12:16,407 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:12:16,424 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:12:16,437 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:12:16,452 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:12:16,459 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:12:16,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:12:16,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:16,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:16,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:12:16,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 15:12:16,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 15:12:16,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:16,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:16,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:16,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-24 15:12:16,646 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-24 15:12:16,652 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-24 15:12:16,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:12:16,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:12:16,664 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-24 15:12:16,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:49 [2018-01-24 15:12:16,668 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-24 15:12:16,668 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:12:16,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 15:12:16,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:12:16,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:16,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:16,892 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-24 15:12:16,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:52 [2018-01-24 15:12:16,993 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-24 15:12:16,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:12:16,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 11] total 38 [2018-01-24 15:12:16,994 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:12:16,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 15:12:16,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 15:12:16,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1343, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 15:12:16,995 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 20 states. [2018-01-24 15:12:17,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:12:17,684 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-01-24 15:12:17,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 15:12:17,685 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-01-24 15:12:17,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:12:17,685 INFO L225 Difference]: With dead ends: 40 [2018-01-24 15:12:17,685 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 15:12:17,687 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=347, Invalid=2103, Unknown=0, NotChecked=0, Total=2450 [2018-01-24 15:12:17,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 15:12:17,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 15:12:17,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 15:12:17,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 15:12:17,688 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-01-24 15:12:17,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:12:17,688 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 15:12:17,688 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 15:12:17,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 15:12:17,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 15:12:17,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 15:12:18,074 WARN L146 SmtUtils]: Spent 349ms on a formula simplification. DAG size of input: 85 DAG size of output 57 [2018-01-24 15:12:18,161 INFO L401 ceAbstractionStarter]: For program point cstrchrErr3RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 15:12:18,161 INFO L401 ceAbstractionStarter]: For program point cstrchrEXIT(lines 540 545) no Hoare annotation was computed. [2018-01-24 15:12:18,162 INFO L401 ceAbstractionStarter]: For program point L542(lines 542 543) no Hoare annotation was computed. [2018-01-24 15:12:18,162 INFO L401 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-24 15:12:18,162 INFO L401 ceAbstractionStarter]: For program point cstrchrErr2RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 15:12:18,162 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-24 15:12:18,163 INFO L401 ceAbstractionStarter]: For program point cstrchrErr5RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 15:12:18,163 INFO L401 ceAbstractionStarter]: For program point cstrchrFINAL(lines 540 545) no Hoare annotation was computed. [2018-01-24 15:12:18,163 INFO L401 ceAbstractionStarter]: For program point L542'(line 542) no Hoare annotation was computed. [2018-01-24 15:12:18,163 INFO L401 ceAbstractionStarter]: For program point cstrchrErr1RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 15:12:18,163 INFO L401 ceAbstractionStarter]: For program point L542'''''''''(lines 542 543) no Hoare annotation was computed. [2018-01-24 15:12:18,163 INFO L401 ceAbstractionStarter]: For program point cstrchrErr4RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 15:12:18,163 INFO L401 ceAbstractionStarter]: For program point L542''(line 542) no Hoare annotation was computed. [2018-01-24 15:12:18,163 INFO L401 ceAbstractionStarter]: For program point L542''''(line 542) no Hoare annotation was computed. [2018-01-24 15:12:18,163 INFO L401 ceAbstractionStarter]: For program point L542''''''(line 542) no Hoare annotation was computed. [2018-01-24 15:12:18,163 INFO L404 ceAbstractionStarter]: At program point cstrchrENTRY(lines 540 545) the Hoare annotation is: true [2018-01-24 15:12:18,164 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-24 15:12:18,164 INFO L401 ceAbstractionStarter]: For program point L542'''(line 542) no Hoare annotation was computed. [2018-01-24 15:12:18,164 INFO L401 ceAbstractionStarter]: For program point cstrchrErr0RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 15:12:18,164 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 555) no Hoare annotation was computed. [2018-01-24 15:12:18,164 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 555) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 15:12:18,165 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 555) no Hoare annotation was computed. [2018-01-24 15:12:18,165 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 555) the Hoare annotation is: true [2018-01-24 15:12:18,165 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 555) no Hoare annotation was computed. [2018-01-24 15:12:18,165 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 555) the Hoare annotation is: true [2018-01-24 15:12:18,165 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 555) no Hoare annotation was computed. [2018-01-24 15:12:18,165 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 15:12:18,165 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-24 15:12:18,166 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-24 15:12:18,166 INFO L401 ceAbstractionStarter]: For program point L551'(line 551) no Hoare annotation was computed. [2018-01-24 15:12:18,166 INFO L401 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-01-24 15:12:18,166 INFO L401 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-24 15:12:18,166 INFO L401 ceAbstractionStarter]: For program point L553'(line 553) no Hoare annotation was computed. [2018-01-24 15:12:18,166 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 546 555) no Hoare annotation was computed. [2018-01-24 15:12:18,166 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 546 555) no Hoare annotation was computed. [2018-01-24 15:12:18,166 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 15:12:18,166 INFO L401 ceAbstractionStarter]: For program point L548(lines 548 550) no Hoare annotation was computed. [2018-01-24 15:12:18,166 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 546 555) no Hoare annotation was computed. [2018-01-24 15:12:18,167 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 546 555) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 15:12:18,167 INFO L401 ceAbstractionStarter]: For program point L551''(line 551) no Hoare annotation was computed. [2018-01-24 15:12:18,167 INFO L401 ceAbstractionStarter]: For program point L548''(lines 548 550) no Hoare annotation was computed. [2018-01-24 15:12:18,175 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:12:18,176 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 15:12:18,176 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 15:12:18,176 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:12:18,176 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:12:18,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 15:12:18,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,178 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,178 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,178 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,178 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,179 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,179 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,179 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:12:18,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:12:18,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:12:18,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:12:18,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:12:18,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:12:18,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:12:18,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:12:18,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:12:18,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:12:18,189 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:12:18,189 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 15:12:18,189 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 15:12:18,189 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:12:18,190 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:12:18,190 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 15:12:18,190 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,190 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,190 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,191 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,191 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,191 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,191 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,191 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,192 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:12:18,192 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:12:18,192 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:12:18,193 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:12:18,193 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:12:18,193 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:12:18,193 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:12:18,194 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:12:18,194 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:12:18,194 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:12:18,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:12:18 BoogieIcfgContainer [2018-01-24 15:12:18,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:12:18,198 INFO L168 Benchmark]: Toolchain (without parser) took 7897.69 ms. Allocated memory was 308.3 MB in the beginning and 556.8 MB in the end (delta: 248.5 MB). Free memory was 268.3 MB in the beginning and 329.4 MB in the end (delta: -61.1 MB). Peak memory consumption was 187.5 MB. Max. memory is 5.3 GB. [2018-01-24 15:12:18,199 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 308.3 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:12:18,199 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.57 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 257.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 15:12:18,200 INFO L168 Benchmark]: Boogie Preprocessor took 31.80 ms. Allocated memory is still 308.3 MB. Free memory was 257.2 MB in the beginning and 256.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-24 15:12:18,200 INFO L168 Benchmark]: RCFGBuilder took 244.19 ms. Allocated memory is still 308.3 MB. Free memory was 256.2 MB in the beginning and 239.3 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 5.3 GB. [2018-01-24 15:12:18,200 INFO L168 Benchmark]: TraceAbstraction took 7410.50 ms. Allocated memory was 308.3 MB in the beginning and 556.8 MB in the end (delta: 248.5 MB). Free memory was 239.3 MB in the beginning and 329.4 MB in the end (delta: -90.1 MB). Peak memory consumption was 158.4 MB. Max. memory is 5.3 GB. [2018-01-24 15:12:18,202 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.18 ms. Allocated memory is still 308.3 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 203.57 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 257.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.80 ms. Allocated memory is still 308.3 MB. Free memory was 257.2 MB in the beginning and 256.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 244.19 ms. Allocated memory is still 308.3 MB. Free memory was 256.2 MB in the beginning and 239.3 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7410.50 ms. Allocated memory was 308.3 MB in the beginning and 556.8 MB in the end (delta: 248.5 MB). Free memory was 239.3 MB in the beginning and 329.4 MB in the end (delta: -90.1 MB). Peak memory consumption was 158.4 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.982953 RENAME_VARIABLES(MILLISECONDS) : 0.247033 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.932725 PROJECTAWAY(MILLISECONDS) : 0.451655 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.199179 DISJOIN(MILLISECONDS) : 0.420235 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.274225 ADD_EQUALITY(MILLISECONDS) : 0.037215 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016057 #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-24 15:12:18,211 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:12:18,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 15:12:18,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 15:12:18,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:12:18,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:12:18,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 15:12:18,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,215 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:12:18,215 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:12:18,215 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:12:18,215 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:12:18,215 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:12:18,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:12:18,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:12:18,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:12:18,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:12:18,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:12:18,231 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:12:18,234 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 15:12:18,234 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 15:12:18,235 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:12:18,235 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:12:18,235 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 15:12:18,235 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,235 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,235 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,235 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,236 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,236 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,236 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,236 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 15:12:18,236 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:12:18,237 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:12:18,237 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:12:18,237 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:12:18,237 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:12:18,237 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:12:18,238 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:12:18,238 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:12:18,238 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:12:18,238 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, 7.3s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 1.9s 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.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 153 SyntacticMatches, 9 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 3.7s 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, 0.5s 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, 3.7s 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.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-12-18-243.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.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-12-18-243.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.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-12-18-243.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-12-18-243.csv Received shutdown request...