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_RubberTaipan+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 12:45:29,032 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:45:29,034 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:45:29,047 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:45:29,048 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:45:29,049 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:45:29,049 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:45:29,051 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:45:29,052 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:45:29,053 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:45:29,054 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:45:29,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:45:29,055 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:45:29,057 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:45:29,058 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:45:29,061 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:45:29,063 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:45:29,065 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:45:29,066 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:45:29,068 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:45:29,070 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:45:29,070 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:45:29,071 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:45:29,072 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:45:29,072 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:45:29,074 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:45:29,074 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:45:29,075 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:45:29,075 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:45:29,075 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:45:29,076 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:45:29,077 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 12:45:29,087 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:45:29,087 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:45:29,088 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:45:29,088 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:45:29,088 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:45:29,088 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:45:29,089 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:45:29,089 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:45:29,090 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:45:29,090 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:45:29,090 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:45:29,090 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:45:29,090 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:45:29,091 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:45:29,091 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:45:29,091 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:45:29,091 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:45:29,091 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:45:29,092 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:45:29,092 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:45:29,092 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:45:29,092 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:45:29,092 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:45:29,093 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:45:29,093 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:45:29,093 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:45:29,093 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:45:29,093 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:45:29,094 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 12:45:29,094 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:45:29,094 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:45:29,094 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:45:29,095 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:45:29,095 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:45:29,131 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:45:29,143 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:45:29,147 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:45:29,148 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:45:29,148 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:45:29,149 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 12:45:29,309 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:45:29,314 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:45:29,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:45:29,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:45:29,341 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:45:29,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:45:29" (1/1) ... [2018-01-24 12:45:29,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d8c01df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:45:29, skipping insertion in model container [2018-01-24 12:45:29,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:45:29" (1/1) ... [2018-01-24 12:45:29,356 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:45:29,392 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:45:29,505 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:45:29,521 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:45:29,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:45:29 WrapperNode [2018-01-24 12:45:29,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:45:29,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:45:29,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:45:29,529 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:45:29,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:45:29" (1/1) ... [2018-01-24 12:45:29,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:45:29" (1/1) ... [2018-01-24 12:45:29,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:45:29" (1/1) ... [2018-01-24 12:45:29,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:45:29" (1/1) ... [2018-01-24 12:45:29,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:45:29" (1/1) ... [2018-01-24 12:45:29,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:45:29" (1/1) ... [2018-01-24 12:45:29,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:45:29" (1/1) ... [2018-01-24 12:45:29,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:45:29,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:45:29,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:45:29,561 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:45:29,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:45:29" (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 12:45:29,607 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:45:29,608 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:45:29,608 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrchr [2018-01-24 12:45:29,608 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:45:29,608 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:45:29,608 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:45:29,608 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:45:29,608 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:45:29,608 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:45:29,609 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:45:29,609 INFO L128 BoogieDeclarations]: Found specification of procedure cstrchr [2018-01-24 12:45:29,609 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:45:29,609 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:45:29,609 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:45:29,787 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:45:29,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:45:29 BoogieIcfgContainer [2018-01-24 12:45:29,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:45:29,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:45:29,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:45:29,790 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:45:29,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:45:29" (1/3) ... [2018-01-24 12:45:29,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b709f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:45:29, skipping insertion in model container [2018-01-24 12:45:29,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:45:29" (2/3) ... [2018-01-24 12:45:29,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b709f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:45:29, skipping insertion in model container [2018-01-24 12:45:29,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:45:29" (3/3) ... [2018-01-24 12:45:29,793 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrchr-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:45:29,800 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:45:29,806 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 12:45:29,853 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:45:29,853 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:45:29,853 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:45:29,854 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:45:29,854 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:45:29,854 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:45:29,854 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:45:29,854 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:45:29,855 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:45:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-01-24 12:45:29,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 12:45:29,878 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:45:29,879 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:45:29,880 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:45:29,883 INFO L82 PathProgramCache]: Analyzing trace with hash 797989968, now seen corresponding path program 1 times [2018-01-24 12:45:29,885 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:45:29,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:29,927 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:45:29,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:29,928 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:45:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:45:29,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:45:30,047 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 12:45:30,049 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:45:30,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:45:30,049 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:45:30,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:45:30,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:45:30,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:45:30,068 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 4 states. [2018-01-24 12:45:30,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:45:30,241 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-01-24 12:45:30,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:45:30,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 12:45:30,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:45:30,252 INFO L225 Difference]: With dead ends: 56 [2018-01-24 12:45:30,253 INFO L226 Difference]: Without dead ends: 37 [2018-01-24 12:45:30,255 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:45:30,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-24 12:45:30,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-24 12:45:30,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 12:45:30,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-01-24 12:45:30,283 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 10 [2018-01-24 12:45:30,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:45:30,283 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-01-24 12:45:30,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:45:30,284 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-01-24 12:45:30,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 12:45:30,284 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:45:30,284 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:45:30,285 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:45:30,285 INFO L82 PathProgramCache]: Analyzing trace with hash 797989969, now seen corresponding path program 1 times [2018-01-24 12:45:30,285 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:45:30,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:30,286 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:45:30,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:30,287 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:45:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:45:30,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:45:30,433 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 12:45:30,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:45:30,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:45:30,433 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:45:30,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:45:30,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:45:30,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:45:30,436 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 5 states. [2018-01-24 12:45:30,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:45:30,516 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-01-24 12:45:30,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:45:30,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-24 12:45:30,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:45:30,517 INFO L225 Difference]: With dead ends: 37 [2018-01-24 12:45:30,518 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 12:45:30,518 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 12:45:30,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 12:45:30,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 12:45:30,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 12:45:30,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-01-24 12:45:30,525 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 10 [2018-01-24 12:45:30,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:45:30,525 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-01-24 12:45:30,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:45:30,525 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-01-24 12:45:30,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 12:45:30,526 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:45:30,526 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:45:30,526 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:45:30,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1840539991, now seen corresponding path program 1 times [2018-01-24 12:45:30,526 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:45:30,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:30,527 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:45:30,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:30,528 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:45:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:45:30,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:45:30,581 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 12:45:30,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:45:30,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:45:30,581 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:45:30,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:45:30,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:45:30,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:45:30,583 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 5 states. [2018-01-24 12:45:30,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:45:30,638 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-01-24 12:45:30,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:45:30,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 12:45:30,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:45:30,639 INFO L225 Difference]: With dead ends: 36 [2018-01-24 12:45:30,640 INFO L226 Difference]: Without dead ends: 33 [2018-01-24 12:45:30,640 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 12:45:30,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-24 12:45:30,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-01-24 12:45:30,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-24 12:45:30,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-01-24 12:45:30,644 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 15 [2018-01-24 12:45:30,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:45:30,644 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-01-24 12:45:30,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:45:30,644 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-01-24 12:45:30,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 12:45:30,645 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:45:30,645 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:45:30,645 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:45:30,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1840539990, now seen corresponding path program 1 times [2018-01-24 12:45:30,645 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:45:30,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:30,646 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:45:30,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:30,646 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:45:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:45:30,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:45:30,743 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 12:45:30,743 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:45:30,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:45:30,744 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:45:30,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:45:30,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:45:30,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:45:30,745 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 8 states. [2018-01-24 12:45:30,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:45:30,851 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-01-24 12:45:30,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:45:30,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-01-24 12:45:30,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:45:30,854 INFO L225 Difference]: With dead ends: 48 [2018-01-24 12:45:30,854 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 12:45:30,854 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:45:30,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 12:45:30,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-01-24 12:45:30,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 12:45:30,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-24 12:45:30,860 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 15 [2018-01-24 12:45:30,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:45:30,860 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-24 12:45:30,860 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:45:30,860 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-24 12:45:30,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:45:30,860 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:45:30,861 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 12:45:30,861 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:45:30,861 INFO L82 PathProgramCache]: Analyzing trace with hash 985116459, now seen corresponding path program 1 times [2018-01-24 12:45:30,861 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:45:30,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:30,862 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:45:30,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:30,862 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:45:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:45:30,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:45:30,893 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 12:45:30,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:45:30,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:45:30,893 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:45:30,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:45:30,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:45:30,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:45:30,895 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 3 states. [2018-01-24 12:45:30,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:45:30,904 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-01-24 12:45:30,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:45:30,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-24 12:45:30,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:45:30,906 INFO L225 Difference]: With dead ends: 63 [2018-01-24 12:45:30,906 INFO L226 Difference]: Without dead ends: 43 [2018-01-24 12:45:30,906 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 12:45:30,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-24 12:45:30,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-24 12:45:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 12:45:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-24 12:45:30,913 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 20 [2018-01-24 12:45:30,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:45:30,913 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-24 12:45:30,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:45:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-24 12:45:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:45:30,914 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:45:30,915 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 12:45:30,915 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:45:30,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1622551342, now seen corresponding path program 1 times [2018-01-24 12:45:30,915 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:45:30,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:30,916 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:45:30,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:30,917 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:45:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:45:30,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:45:31,266 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 12:45:31,266 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:45:31,267 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 12:45:31,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:45:31,287 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:45:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:45:31,327 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:45:31,363 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 12:45:31,366 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 12:45:31,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:45:31,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:45:31,374 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 12:45:31,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 12:45:31,480 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 12:45:31,489 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 12:45:31,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:45:31,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:45:31,519 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 12:45:31,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 12:45:31,648 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 12:45:31,648 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:45:31,866 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 12:45:31,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:45:31,874 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 12:45:31,885 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 12:45:31,885 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:45:31,887 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:45:31,892 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 12:45:31,892 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 12:45:31,899 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 12:45:31,919 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:45:31,920 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 12:45:31,923 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:45:31,923 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:45:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:45:31,954 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:45:31,958 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 12:45:31,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:45:31,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:45:31,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 12:45:31,987 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 12:45:31,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 12:45:31,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:45:31,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:45:31,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:45:31,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 12:45:32,111 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 12:45:32,119 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 12:45:32,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:45:32,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:45:32,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:45:32,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:31 [2018-01-24 12:45:32,260 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 12:45:32,260 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:45:32,373 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 12:45:32,382 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 12:45:32,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:45:32,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:45:32,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:45:32,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 12:45:32,447 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 12:45:32,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:45:32,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 11, 11] total 35 [2018-01-24 12:45:32,449 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:45:32,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 12:45:32,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 12:45:32,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1119, Unknown=0, NotChecked=0, Total=1260 [2018-01-24 12:45:32,450 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 18 states. [2018-01-24 12:45:33,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:45:33,155 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-01-24 12:45:33,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:45:33,155 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2018-01-24 12:45:33,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:45:33,156 INFO L225 Difference]: With dead ends: 68 [2018-01-24 12:45:33,157 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 12:45:33,158 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=271, Invalid=1799, Unknown=0, NotChecked=0, Total=2070 [2018-01-24 12:45:33,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 12:45:33,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2018-01-24 12:45:33,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 12:45:33,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-01-24 12:45:33,165 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 22 [2018-01-24 12:45:33,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:45:33,166 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-01-24 12:45:33,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 12:45:33,166 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-01-24 12:45:33,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 12:45:33,167 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:45:33,167 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 12:45:33,167 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:45:33,167 INFO L82 PathProgramCache]: Analyzing trace with hash 112532188, now seen corresponding path program 1 times [2018-01-24 12:45:33,167 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:45:33,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:33,168 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:45:33,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:33,168 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:45:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:45:33,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:45:33,237 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 12:45:33,238 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:45:33,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:45:33,238 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:45:33,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:45:33,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:45:33,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:45:33,239 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 4 states. [2018-01-24 12:45:33,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:45:33,280 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-01-24 12:45:33,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:45:33,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-24 12:45:33,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:45:33,281 INFO L225 Difference]: With dead ends: 50 [2018-01-24 12:45:33,281 INFO L226 Difference]: Without dead ends: 39 [2018-01-24 12:45:33,281 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 12:45:33,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-24 12:45:33,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-24 12:45:33,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 12:45:33,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-01-24 12:45:33,286 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 27 [2018-01-24 12:45:33,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:45:33,286 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-01-24 12:45:33,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:45:33,286 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-01-24 12:45:33,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:45:33,286 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:45:33,286 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 12:45:33,287 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:45:33,287 INFO L82 PathProgramCache]: Analyzing trace with hash 622344746, now seen corresponding path program 2 times [2018-01-24 12:45:33,287 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:45:33,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:33,288 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:45:33,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:45:33,288 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:45:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:45:33,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:45:33,704 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 12:45:33,705 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:45:33,705 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 12:45:33,710 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:45:33,710 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:45:33,719 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:45:33,724 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:45:33,726 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:45:33,728 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:45:33,732 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 12:45:33,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:45:33,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:45:33,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:45:33,762 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 12:45:33,764 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 12:45:33,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:45:33,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:45:33,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:45:33,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-24 12:45:33,894 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 12:45:33,910 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 12:45:33,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:45:33,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:45:33,923 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 12:45:33,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-24 12:45:34,033 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 12:45:34,033 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:45:34,356 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 12:45:34,380 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 12:45:34,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:45:34,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:45:34,401 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 12:45:34,419 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 12:45:34,420 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:45:34,427 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:45:34,442 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 12:45:34,442 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:98 [2018-01-24 12:45:34,558 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 12:45:34,579 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:45:34,579 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 12:45:34,589 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:45:34,589 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:45:34,606 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:45:34,618 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:45:34,633 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:45:34,640 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:45:34,644 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 12:45:34,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:45:34,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:45:34,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:45:34,701 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 12:45:34,703 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 12:45:34,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:45:34,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:45:34,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:45:34,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-24 12:45:34,808 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 12:45:34,815 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 12:45:34,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:45:34,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:45:34,828 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 12:45:34,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:49 [2018-01-24 12:45:34,833 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 12:45:34,833 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:45:35,011 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 12:45:35,019 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 12:45:35,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:45:35,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:45:35,028 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 12:45:35,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:52 [2018-01-24 12:45:35,125 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 12:45:35,127 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:45:35,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 11] total 38 [2018-01-24 12:45:35,127 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:45:35,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 12:45:35,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 12:45:35,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1343, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 12:45:35,128 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 20 states. [2018-01-24 12:45:35,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:45:35,771 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-01-24 12:45:35,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:45:35,772 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-01-24 12:45:35,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:45:35,772 INFO L225 Difference]: With dead ends: 40 [2018-01-24 12:45:35,772 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 12:45:35,773 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=347, Invalid=2103, Unknown=0, NotChecked=0, Total=2450 [2018-01-24 12:45:35,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 12:45:35,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 12:45:35,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 12:45:35,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 12:45:35,773 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-01-24 12:45:35,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:45:35,774 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 12:45:35,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 12:45:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 12:45:35,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 12:45:35,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 12:45:36,573 WARN L146 SmtUtils]: Spent 761ms on a formula simplification. DAG size of input: 88 DAG size of output 54 [2018-01-24 12:45:36,618 INFO L401 ceAbstractionStarter]: For program point cstrchrErr3RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 12:45:36,619 INFO L401 ceAbstractionStarter]: For program point cstrchrEXIT(lines 540 545) no Hoare annotation was computed. [2018-01-24 12:45:36,619 INFO L401 ceAbstractionStarter]: For program point L542(lines 542 543) no Hoare annotation was computed. [2018-01-24 12:45:36,619 INFO L401 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-24 12:45:36,619 INFO L401 ceAbstractionStarter]: For program point cstrchrErr2RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 12:45:36,619 INFO L397 ceAbstractionStarter]: At program point L542''''''''(lines 542 543) the Hoare annotation is: (or (not (= 1 (select |#valid| |cstrchr_#in~s.base|))) (not (exists ((main_~length~3 Int) (v_main_~nondetString~3.offset_BEFORE_CALL_1 Int)) (and (<= 1 main_~length~3) (= (select (select |#memory_int| |cstrchr_#in~s.base|) (+ main_~length~3 v_main_~nondetString~3.offset_BEFORE_CALL_1 (- 1))) 0) (<= (+ main_~length~3 v_main_~nondetString~3.offset_BEFORE_CALL_1) (select |#length| |cstrchr_#in~s.base|)) (<= |cstrchr_#in~s.offset| v_main_~nondetString~3.offset_BEFORE_CALL_1)))) (not (= 0 |cstrchr_#in~s.offset|)) (and (exists ((v_main_~nondetString~3.offset_BEFORE_CALL_3 Int)) (and (= 0 (select (select |#memory_int| cstrchr_~s.base) (+ v_main_~nondetString~3.offset_BEFORE_CALL_3 (select |#length| cstrchr_~s.base) (- 1)))) (<= 0 v_main_~nondetString~3.offset_BEFORE_CALL_3) (<= v_main_~nondetString~3.offset_BEFORE_CALL_3 0) (<= v_main_~nondetString~3.offset_BEFORE_CALL_3 cstrchr_~s.offset))) (exists ((main_~length~3 Int) (v_main_~nondetString~3.offset_BEFORE_CALL_1 Int)) (and (<= (+ main_~length~3 v_main_~nondetString~3.offset_BEFORE_CALL_1) (select |#length| cstrchr_~s.base)) (<= 1 main_~length~3) (<= cstrchr_~s.offset v_main_~nondetString~3.offset_BEFORE_CALL_1) (= (select (select |#memory_int| cstrchr_~s.base) (+ main_~length~3 v_main_~nondetString~3.offset_BEFORE_CALL_1 (- 1))) 0))) (= 1 (select |#valid| cstrchr_~s.base))) (not (= (select (select |#memory_int| |cstrchr_#in~s.base|) (+ |cstrchr_#in~s.offset| (select |#length| |cstrchr_#in~s.base|) (- 1))) 0))) [2018-01-24 12:45:36,619 INFO L401 ceAbstractionStarter]: For program point cstrchrErr5RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 12:45:36,619 INFO L401 ceAbstractionStarter]: For program point cstrchrFINAL(lines 540 545) no Hoare annotation was computed. [2018-01-24 12:45:36,619 INFO L401 ceAbstractionStarter]: For program point L542'(line 542) no Hoare annotation was computed. [2018-01-24 12:45:36,619 INFO L401 ceAbstractionStarter]: For program point cstrchrErr1RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 12:45:36,620 INFO L401 ceAbstractionStarter]: For program point L542'''''''''(lines 542 543) no Hoare annotation was computed. [2018-01-24 12:45:36,620 INFO L401 ceAbstractionStarter]: For program point cstrchrErr4RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 12:45:36,620 INFO L401 ceAbstractionStarter]: For program point L542''(line 542) no Hoare annotation was computed. [2018-01-24 12:45:36,620 INFO L401 ceAbstractionStarter]: For program point L542''''(line 542) no Hoare annotation was computed. [2018-01-24 12:45:36,620 INFO L401 ceAbstractionStarter]: For program point L542''''''(line 542) no Hoare annotation was computed. [2018-01-24 12:45:36,620 INFO L404 ceAbstractionStarter]: At program point cstrchrENTRY(lines 540 545) the Hoare annotation is: true [2018-01-24 12:45:36,620 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-24 12:45:36,620 INFO L401 ceAbstractionStarter]: For program point L542'''(line 542) no Hoare annotation was computed. [2018-01-24 12:45:36,620 INFO L401 ceAbstractionStarter]: For program point cstrchrErr0RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 12:45:36,620 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 555) no Hoare annotation was computed. [2018-01-24 12:45:36,620 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 555) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:45:36,620 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 555) no Hoare annotation was computed. [2018-01-24 12:45:36,620 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 555) the Hoare annotation is: true [2018-01-24 12:45:36,620 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 555) no Hoare annotation was computed. [2018-01-24 12:45:36,621 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 555) the Hoare annotation is: true [2018-01-24 12:45:36,621 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 555) no Hoare annotation was computed. [2018-01-24 12:45:36,621 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 12:45:36,621 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 12:45:36,621 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-24 12:45:36,621 INFO L401 ceAbstractionStarter]: For program point L551'(line 551) no Hoare annotation was computed. [2018-01-24 12:45:36,621 INFO L401 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-01-24 12:45:36,621 INFO L401 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-24 12:45:36,621 INFO L401 ceAbstractionStarter]: For program point L553'(line 553) no Hoare annotation was computed. [2018-01-24 12:45:36,621 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 546 555) no Hoare annotation was computed. [2018-01-24 12:45:36,621 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 546 555) no Hoare annotation was computed. [2018-01-24 12:45:36,621 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 12:45:36,621 INFO L401 ceAbstractionStarter]: For program point L548(lines 548 550) no Hoare annotation was computed. [2018-01-24 12:45:36,621 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 546 555) no Hoare annotation was computed. [2018-01-24 12:45:36,622 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 546 555) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:45:36,622 INFO L401 ceAbstractionStarter]: For program point L551''(line 551) no Hoare annotation was computed. [2018-01-24 12:45:36,622 INFO L401 ceAbstractionStarter]: For program point L548''(lines 548 550) no Hoare annotation was computed. [2018-01-24 12:45:36,628 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,629 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,629 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,629 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,629 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,630 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,630 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:45:36,630 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:45:36,630 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:45:36,630 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:45:36,630 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,630 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,631 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,631 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,631 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,631 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,633 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:45:36,633 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:36,633 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:45:36,633 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:36,633 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:36,634 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:45:36,634 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:45:36,634 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:36,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,640 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,640 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,640 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,641 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:45:36,641 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:45:36,641 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:45:36,641 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:45:36,641 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,641 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,642 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,642 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,642 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,642 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:45:36,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:36,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:45:36,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:36,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:36,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:45:36,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:45:36,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:36,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:45:36 BoogieIcfgContainer [2018-01-24 12:45:36,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:45:36,646 INFO L168 Benchmark]: Toolchain (without parser) took 7336.67 ms. Allocated memory was 308.8 MB in the beginning and 553.1 MB in the end (delta: 244.3 MB). Free memory was 267.7 MB in the beginning and 470.2 MB in the end (delta: -202.5 MB). Peak memory consumption was 41.8 MB. Max. memory is 5.3 GB. [2018-01-24 12:45:36,647 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 308.8 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:45:36,647 INFO L168 Benchmark]: CACSL2BoogieTranslator took 192.59 ms. Allocated memory is still 308.8 MB. Free memory was 267.7 MB in the beginning and 257.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:45:36,648 INFO L168 Benchmark]: Boogie Preprocessor took 30.80 ms. Allocated memory is still 308.8 MB. Free memory was 257.7 MB in the beginning and 255.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:45:36,648 INFO L168 Benchmark]: RCFGBuilder took 227.23 ms. Allocated memory is still 308.8 MB. Free memory was 255.7 MB in the beginning and 238.7 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:45:36,648 INFO L168 Benchmark]: TraceAbstraction took 6856.92 ms. Allocated memory was 308.8 MB in the beginning and 553.1 MB in the end (delta: 244.3 MB). Free memory was 238.7 MB in the beginning and 470.2 MB in the end (delta: -231.5 MB). Peak memory consumption was 12.8 MB. Max. memory is 5.3 GB. [2018-01-24 12:45:36,650 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 308.8 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 192.59 ms. Allocated memory is still 308.8 MB. Free memory was 267.7 MB in the beginning and 257.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.80 ms. Allocated memory is still 308.8 MB. Free memory was 257.7 MB in the beginning and 255.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 227.23 ms. Allocated memory is still 308.8 MB. Free memory was 255.7 MB in the beginning and 238.7 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6856.92 ms. Allocated memory was 308.8 MB in the beginning and 553.1 MB in the end (delta: 244.3 MB). Free memory was 238.7 MB in the beginning and 470.2 MB in the end (delta: -231.5 MB). Peak memory consumption was 12.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - 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_1,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_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_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_1,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_1,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_1,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_1,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_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_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_1,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_1,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_1,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 #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 #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 12:45:36,656 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,656 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,657 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,657 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,657 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,657 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,657 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:45:36,658 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:45:36,658 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:45:36,658 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:45:36,658 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,658 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,659 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,659 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,659 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,659 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,660 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:45:36,660 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:36,660 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:45:36,660 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:36,660 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:36,661 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:45:36,661 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:45:36,661 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:36,663 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,663 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,663 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,664 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,664 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,664 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,664 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:45:36,665 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:45:36,665 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:45:36,665 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:45:36,665 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,665 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,665 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,666 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,666 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-24 12:45:36,666 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:45:36,666 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:45:36,667 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:36,667 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:45:36,667 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:36,667 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:45:36,667 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:45:36,668 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:45:36,668 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((!(1 == \valid[s]) || !(\exists main_~length~3 : int, v_main_~nondetString~3.offset_BEFORE_CALL_1 : int :: ((1 <= main_~length~3 && unknown-#memory_int-unknown[s][main_~length~3 + v_main_~nondetString~3.offset_BEFORE_CALL_1 + -1] == 0) && main_~length~3 + v_main_~nondetString~3.offset_BEFORE_CALL_1 <= unknown-#length-unknown[s]) && s <= v_main_~nondetString~3.offset_BEFORE_CALL_1)) || !(0 == s)) || (((\exists v_main_~nondetString~3.offset_BEFORE_CALL_3 : int :: ((0 == unknown-#memory_int-unknown[s][v_main_~nondetString~3.offset_BEFORE_CALL_3 + unknown-#length-unknown[s] + -1] && 0 <= v_main_~nondetString~3.offset_BEFORE_CALL_3) && v_main_~nondetString~3.offset_BEFORE_CALL_3 <= 0) && v_main_~nondetString~3.offset_BEFORE_CALL_3 <= s) && (\exists main_~length~3 : int, v_main_~nondetString~3.offset_BEFORE_CALL_1 : int :: ((main_~length~3 + v_main_~nondetString~3.offset_BEFORE_CALL_1 <= unknown-#length-unknown[s] && 1 <= main_~length~3) && s <= v_main_~nondetString~3.offset_BEFORE_CALL_1) && unknown-#memory_int-unknown[s][main_~length~3 + v_main_~nondetString~3.offset_BEFORE_CALL_1 + -1] == 0)) && 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, 6.7s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s 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.5s 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.0s AbstIntTime, 0 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, 180 HoareAnnotationTreeSize, 7 FomulaSimplifications, 11 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 446 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s 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_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-45-36-673.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_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-45-36-673.csv Received shutdown request...