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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:37:08,123 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:37:08,124 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:37:08,135 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:37:08,135 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:37:08,136 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:37:08,137 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:37:08,139 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:37:08,140 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:37:08,141 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:37:08,142 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:37:08,142 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:37:08,143 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:37:08,144 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:37:08,145 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:37:08,146 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:37:08,148 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:37:08,149 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:37:08,150 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:37:08,151 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:37:08,153 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:37:08,153 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:37:08,153 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:37:08,154 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:37:08,155 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:37:08,156 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:37:08,156 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:37:08,157 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:37:08,157 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:37:08,157 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:37:08,158 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:37:08,158 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 10:37:08,167 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:37:08,167 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:37:08,168 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:37:08,168 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:37:08,169 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:37:08,169 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:37:08,169 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:37:08,169 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:37:08,169 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:37:08,169 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:37:08,169 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:37:08,170 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:37:08,170 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:37:08,170 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:37:08,170 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:37:08,170 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:37:08,170 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:37:08,170 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:37:08,171 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:37:08,171 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:37:08,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:37:08,171 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:37:08,171 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:37:08,171 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:37:08,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:37:08,209 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:37:08,212 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:37:08,213 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:37:08,214 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:37:08,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i [2018-02-02 10:37:08,356 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:37:08,358 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:37:08,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:37:08,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:37:08,364 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:37:08,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:37:08" (1/1) ... [2018-02-02 10:37:08,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eeddf32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:08, skipping insertion in model container [2018-02-02 10:37:08,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:37:08" (1/1) ... [2018-02-02 10:37:08,382 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:37:08,410 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:37:08,501 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:37:08,513 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:37:08,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:08 WrapperNode [2018-02-02 10:37:08,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:37:08,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:37:08,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:37:08,519 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:37:08,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:08" (1/1) ... [2018-02-02 10:37:08,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:08" (1/1) ... [2018-02-02 10:37:08,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:08" (1/1) ... [2018-02-02 10:37:08,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:08" (1/1) ... [2018-02-02 10:37:08,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:08" (1/1) ... [2018-02-02 10:37:08,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:08" (1/1) ... [2018-02-02 10:37:08,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:08" (1/1) ... [2018-02-02 10:37:08,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:37:08,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:37:08,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:37:08,545 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:37:08,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:08" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-02 10:37:08,581 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:37:08,582 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:37:08,582 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrreplace [2018-02-02 10:37:08,582 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:37:08,582 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:37:08,582 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:37:08,582 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:37:08,582 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:37:08,582 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:37:08,582 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:37:08,582 INFO L128 BoogieDeclarations]: Found specification of procedure cstrreplace [2018-02-02 10:37:08,582 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:37:08,582 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:37:08,583 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:37:08,716 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:37:08,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:37:08 BoogieIcfgContainer [2018-02-02 10:37:08,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:37:08,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:37:08,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:37:08,718 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:37:08,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:37:08" (1/3) ... [2018-02-02 10:37:08,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b0c448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:37:08, skipping insertion in model container [2018-02-02 10:37:08,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:08" (2/3) ... [2018-02-02 10:37:08,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b0c448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:37:08, skipping insertion in model container [2018-02-02 10:37:08,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:37:08" (3/3) ... [2018-02-02 10:37:08,721 INFO L107 eAbstractionObserver]: Analyzing ICFG strreplace-alloca_true-valid-memsafety_true-termination.i [2018-02-02 10:37:08,727 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:37:08,731 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-02 10:37:08,761 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:37:08,761 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:37:08,761 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:37:08,761 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:37:08,761 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:37:08,762 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:37:08,762 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:37:08,762 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:37:08,762 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:37:08,770 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-02-02 10:37:08,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 10:37:08,779 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:08,780 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:08,780 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:37:08,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1004390414, now seen corresponding path program 1 times [2018-02-02 10:37:08,816 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:08,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:08,909 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:37:08,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:37:08,910 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:08,910 INFO L182 omatonBuilderFactory]: Interpolants [43#true, 44#false, 45#(= 1 (select |#valid| |main_#t~malloc6.base|)), 46#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-02-02 10:37:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:08,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:37:08,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:37:08,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:37:08,921 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-02-02 10:37:09,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:09,000 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-02-02 10:37:09,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:37:09,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-02 10:37:09,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:09,057 INFO L225 Difference]: With dead ends: 39 [2018-02-02 10:37:09,057 INFO L226 Difference]: Without dead ends: 36 [2018-02-02 10:37:09,059 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:37:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-02 10:37:09,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-02 10:37:09,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-02 10:37:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-02 10:37:09,083 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 10 [2018-02-02 10:37:09,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:09,083 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-02 10:37:09,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:37:09,083 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-02 10:37:09,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 10:37:09,084 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:09,084 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:09,084 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:37:09,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1004390413, now seen corresponding path program 1 times [2018-02-02 10:37:09,085 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:09,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:09,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:09,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:37:09,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:37:09,178 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:09,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:09,179 INFO L182 omatonBuilderFactory]: Interpolants [128#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 124#true, 125#false, 126#(<= 1 main_~length1~0), 127#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (<= 1 main_~length1~0))] [2018-02-02 10:37:09,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:09,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:37:09,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:37:09,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:37:09,181 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-02-02 10:37:09,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:09,237 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-02 10:37:09,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:37:09,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-02 10:37:09,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:09,239 INFO L225 Difference]: With dead ends: 35 [2018-02-02 10:37:09,239 INFO L226 Difference]: Without dead ends: 35 [2018-02-02 10:37:09,240 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:37:09,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-02 10:37:09,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-02 10:37:09,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-02 10:37:09,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-02-02 10:37:09,244 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 10 [2018-02-02 10:37:09,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:09,244 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-02-02 10:37:09,244 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:37:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-02-02 10:37:09,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:37:09,245 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:09,245 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:09,245 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:37:09,245 INFO L82 PathProgramCache]: Analyzing trace with hash -104566583, now seen corresponding path program 1 times [2018-02-02 10:37:09,246 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:09,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:09,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:09,297 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:37:09,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:37:09,297 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:09,298 INFO L182 omatonBuilderFactory]: Interpolants [201#true, 202#false, 203#(= 1 (select |#valid| main_~nondetString1~0.base)), 204#(= 1 (select |#valid| |cstrreplace_#in~s.base|)), 205#(= 1 (select |#valid| cstrreplace_~p~0.base))] [2018-02-02 10:37:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:09,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:37:09,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:37:09,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:37:09,299 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-02-02 10:37:09,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:09,366 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-02-02 10:37:09,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:37:09,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 10:37:09,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:09,368 INFO L225 Difference]: With dead ends: 32 [2018-02-02 10:37:09,368 INFO L226 Difference]: Without dead ends: 32 [2018-02-02 10:37:09,369 INFO L554 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-02-02 10:37:09,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-02 10:37:09,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-02-02 10:37:09,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-02 10:37:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-02-02 10:37:09,372 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15 [2018-02-02 10:37:09,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:09,373 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-02-02 10:37:09,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:37:09,373 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-02-02 10:37:09,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:37:09,373 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:09,374 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:09,374 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:37:09,374 INFO L82 PathProgramCache]: Analyzing trace with hash -104566582, now seen corresponding path program 1 times [2018-02-02 10:37:09,375 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:09,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:09,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:09,455 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:37:09,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:37:09,455 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:09,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:09,456 INFO L182 omatonBuilderFactory]: Interpolants [272#true, 273#false, 274#(<= 1 main_~length1~0), 275#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (<= 1 main_~length1~0)), 276#(and (= 0 main_~nondetString1~0.offset) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0)), 277#(and (= 0 main_~nondetString1~0.offset) (<= 1 (select |#length| main_~nondetString1~0.base))), 278#(and (= 0 |cstrreplace_#in~s.offset|) (<= 1 (select |#length| |cstrreplace_#in~s.base|))), 279#(and (<= 1 (select |#length| cstrreplace_~p~0.base)) (= cstrreplace_~p~0.offset 0))] [2018-02-02 10:37:09,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:09,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:37:09,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:37:09,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:37:09,457 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2018-02-02 10:37:09,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:09,536 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-02-02 10:37:09,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:37:09,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-02-02 10:37:09,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:09,538 INFO L225 Difference]: With dead ends: 43 [2018-02-02 10:37:09,538 INFO L226 Difference]: Without dead ends: 43 [2018-02-02 10:37:09,539 INFO L554 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-02-02 10:37:09,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-02 10:37:09,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-02-02 10:37:09,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 10:37:09,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-02-02 10:37:09,541 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2018-02-02 10:37:09,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:09,541 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-02-02 10:37:09,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:37:09,541 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-02-02 10:37:09,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:37:09,541 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:09,541 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:09,542 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:37:09,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1089103921, now seen corresponding path program 1 times [2018-02-02 10:37:09,542 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:09,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:09,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:09,651 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:37:09,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:37:09,651 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:09,652 INFO L182 omatonBuilderFactory]: Interpolants [368#(and (= 0 |main_#t~malloc6.offset|) (<= 1 main_~length1~0) (<= main_~length1~0 1)), 369#(and (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 370#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset)) (= main_~nondetString1~0.offset 0)), 371#(= 0 (select (select |#memory_int| |cstrreplace_#in~s.base|) |cstrreplace_#in~s.offset|)), 372#(= 0 (select (select |#memory_int| cstrreplace_~p~0.base) cstrreplace_~p~0.offset)), 373#(and (= 0 (select (select |#memory_int| cstrreplace_~p~0.base) cstrreplace_~p~0.offset)) (= |cstrreplace_#t~mem0| (select (select |#memory_int| cstrreplace_~p~0.base) cstrreplace_~p~0.offset))), 365#true, 366#false, 367#(and (<= 1 main_~length1~0) (<= main_~length1~0 1))] [2018-02-02 10:37:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:09,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:37:09,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:37:09,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:37:09,652 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 9 states. [2018-02-02 10:37:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:09,724 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-02-02 10:37:09,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:37:09,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-02 10:37:09,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:09,725 INFO L225 Difference]: With dead ends: 55 [2018-02-02 10:37:09,725 INFO L226 Difference]: Without dead ends: 55 [2018-02-02 10:37:09,725 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:37:09,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-02 10:37:09,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-02-02 10:37:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 10:37:09,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-02 10:37:09,728 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 21 [2018-02-02 10:37:09,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:09,728 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-02 10:37:09,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:37:09,728 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-02 10:37:09,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:37:09,729 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:09,729 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:09,729 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:37:09,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1925999697, now seen corresponding path program 1 times [2018-02-02 10:37:09,730 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:09,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:09,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:09,909 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:09,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:37:09,910 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:09,910 INFO L182 omatonBuilderFactory]: Interpolants [496#(and (= cstrreplace_~p~0.offset 0) (or (<= 2 (select |#length| cstrreplace_~p~0.base)) (= 0 (select (select |#memory_int| cstrreplace_~p~0.base) cstrreplace_~p~0.offset)))), 497#(and (or (<= 2 (select |#length| cstrreplace_~p~0.base)) (and (= 0 (select (select |#memory_int| cstrreplace_~p~0.base) cstrreplace_~p~0.offset)) (= |cstrreplace_#t~mem0| (select (select |#memory_int| cstrreplace_~p~0.base) cstrreplace_~p~0.offset)))) (= cstrreplace_~p~0.offset 0)), 498#(and (<= 2 (select |#length| cstrreplace_~p~0.base)) (= cstrreplace_~p~0.offset 0)), 499#(and (<= 1 cstrreplace_~p~0.offset) (<= (+ cstrreplace_~p~0.offset 1) (select |#length| cstrreplace_~p~0.base))), 489#true, 490#false, 491#(<= 1 main_~length1~0), 492#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (<= 1 main_~length1~0)), 493#(and (or (= (+ main_~nondetString1~0.offset main_~length1~0) 1) (and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0))) (= main_~nondetString1~0.offset 0)), 494#(and (or (<= 2 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset))) (= main_~nondetString1~0.offset 0)), 495#(and (or (= 0 (select (select |#memory_int| |cstrreplace_#in~s.base|) |cstrreplace_#in~s.offset|)) (<= 2 (select |#length| |cstrreplace_#in~s.base|))) (= 0 |cstrreplace_#in~s.offset|))] [2018-02-02 10:37:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:09,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:37:09,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:37:09,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:37:09,911 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 11 states. [2018-02-02 10:37:10,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:10,162 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2018-02-02 10:37:10,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:37:10,163 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2018-02-02 10:37:10,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:10,163 INFO L225 Difference]: With dead ends: 84 [2018-02-02 10:37:10,163 INFO L226 Difference]: Without dead ends: 84 [2018-02-02 10:37:10,164 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:37:10,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-02 10:37:10,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2018-02-02 10:37:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 10:37:10,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-02-02 10:37:10,167 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 21 [2018-02-02 10:37:10,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:10,167 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-02-02 10:37:10,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:37:10,167 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-02-02 10:37:10,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:37:10,168 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:10,168 INFO L351 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] [2018-02-02 10:37:10,168 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:37:10,168 INFO L82 PathProgramCache]: Analyzing trace with hash 292485851, now seen corresponding path program 1 times [2018-02-02 10:37:10,169 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:10,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:10,190 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:37:10,193 INFO L168 Benchmark]: Toolchain (without parser) took 1836.17 ms. Allocated memory was 385.9 MB in the beginning and 604.0 MB in the end (delta: 218.1 MB). Free memory was 344.1 MB in the beginning and 562.1 MB in the end (delta: -218.1 MB). Peak memory consumption was 51.1 kB. Max. memory is 5.3 GB. [2018-02-02 10:37:10,194 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 385.9 MB. Free memory is still 349.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:37:10,194 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.91 ms. Allocated memory is still 385.9 MB. Free memory was 342.7 MB in the beginning and 333.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:37:10,195 INFO L168 Benchmark]: Boogie Preprocessor took 25.75 ms. Allocated memory is still 385.9 MB. Free memory was 333.5 MB in the beginning and 330.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:37:10,195 INFO L168 Benchmark]: RCFGBuilder took 171.45 ms. Allocated memory is still 385.9 MB. Free memory was 330.9 MB in the beginning and 314.1 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:37:10,195 INFO L168 Benchmark]: TraceAbstraction took 1475.97 ms. Allocated memory was 385.9 MB in the beginning and 604.0 MB in the end (delta: 218.1 MB). Free memory was 314.1 MB in the beginning and 562.1 MB in the end (delta: -248.0 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:37:10,197 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 385.9 MB. Free memory is still 349.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 159.91 ms. Allocated memory is still 385.9 MB. Free memory was 342.7 MB in the beginning and 333.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.75 ms. Allocated memory is still 385.9 MB. Free memory was 333.5 MB in the beginning and 330.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 171.45 ms. Allocated memory is still 385.9 MB. Free memory was 330.9 MB in the beginning and 314.1 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1475.97 ms. Allocated memory was 385.9 MB in the beginning and 604.0 MB in the end (delta: 218.1 MB). Free memory was 314.1 MB in the beginning and 562.1 MB in the end (delta: -248.0 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-37-10-203.csv Received shutdown request...