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/cade18-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-a74eeac-m [2018-02-02 21:00:07,177 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 21:00:07,178 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 21:00:07,190 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 21:00:07,190 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 21:00:07,191 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 21:00:07,191 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 21:00:07,193 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 21:00:07,194 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 21:00:07,195 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 21:00:07,196 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 21:00:07,196 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 21:00:07,197 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 21:00:07,197 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 21:00:07,198 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 21:00:07,200 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 21:00:07,201 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 21:00:07,203 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 21:00:07,204 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 21:00:07,205 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 21:00:07,206 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 21:00:07,207 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 21:00:07,207 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 21:00:07,208 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 21:00:07,208 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 21:00:07,209 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 21:00:07,209 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 21:00:07,210 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 21:00:07,210 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 21:00:07,210 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 21:00:07,211 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 21:00:07,211 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 21:00:07,220 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 21:00:07,220 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 21:00:07,221 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 21:00:07,221 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 21:00:07,221 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 21:00:07,221 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 21:00:07,222 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 21:00:07,222 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 21:00:07,222 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 21:00:07,222 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 21:00:07,222 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 21:00:07,222 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 21:00:07,222 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 21:00:07,222 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 21:00:07,222 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 21:00:07,222 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 21:00:07,222 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 21:00:07,223 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 21:00:07,223 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 21:00:07,223 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 21:00:07,223 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 21:00:07,223 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 21:00:07,223 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 21:00:07,223 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 21:00:07,223 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-02 21:00:07,249 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 21:00:07,257 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 21:00:07,260 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 21:00:07,261 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 21:00:07,261 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 21:00:07,262 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 21:00:07,389 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 21:00:07,391 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 21:00:07,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 21:00:07,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 21:00:07,398 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 21:00:07,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:00:07" (1/1) ... [2018-02-02 21:00:07,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab297d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:07, skipping insertion in model container [2018-02-02 21:00:07,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:00:07" (1/1) ... [2018-02-02 21:00:07,418 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:00:07,450 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:00:07,537 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:00:07,548 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:00:07,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:07 WrapperNode [2018-02-02 21:00:07,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 21:00:07,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 21:00:07,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 21:00:07,553 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 21:00:07,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:07" (1/1) ... [2018-02-02 21:00:07,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:07" (1/1) ... [2018-02-02 21:00:07,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:07" (1/1) ... [2018-02-02 21:00:07,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:07" (1/1) ... [2018-02-02 21:00:07,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:07" (1/1) ... [2018-02-02 21:00:07,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:07" (1/1) ... [2018-02-02 21:00:07,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:07" (1/1) ... [2018-02-02 21:00:07,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 21:00:07,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 21:00:07,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 21:00:07,577 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 21:00:07,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:07" (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 21:00:07,611 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 21:00:07,611 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 21:00:07,611 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrreplace [2018-02-02 21:00:07,611 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 21:00:07,611 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 21:00:07,611 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 21:00:07,611 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 21:00:07,611 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 21:00:07,611 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 21:00:07,611 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 21:00:07,611 INFO L128 BoogieDeclarations]: Found specification of procedure cstrreplace [2018-02-02 21:00:07,612 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 21:00:07,612 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 21:00:07,612 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 21:00:07,763 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 21:00:07,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:00:07 BoogieIcfgContainer [2018-02-02 21:00:07,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 21:00:07,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 21:00:07,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 21:00:07,766 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 21:00:07,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:00:07" (1/3) ... [2018-02-02 21:00:07,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8145b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:00:07, skipping insertion in model container [2018-02-02 21:00:07,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:07" (2/3) ... [2018-02-02 21:00:07,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8145b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:00:07, skipping insertion in model container [2018-02-02 21:00:07,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:00:07" (3/3) ... [2018-02-02 21:00:07,769 INFO L107 eAbstractionObserver]: Analyzing ICFG strreplace-alloca_true-valid-memsafety_true-termination.i [2018-02-02 21:00:07,774 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 21:00:07,779 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-02 21:00:07,812 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 21:00:07,813 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 21:00:07,813 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 21:00:07,813 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 21:00:07,813 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 21:00:07,813 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 21:00:07,813 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 21:00:07,813 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 21:00:07,814 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 21:00:07,823 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-02-02 21:00:07,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 21:00:07,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:07,832 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:07,832 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 21:00:07,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1004390414, now seen corresponding path program 1 times [2018-02-02 21:00:07,838 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:07,838 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:07,885 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:07,885 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:07,885 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:07,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:07,983 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 21:00:07,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:00:07,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 21:00:07,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 21:00:07,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 21:00:07,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 21:00:07,995 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-02-02 21:00:08,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:08,060 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-02-02 21:00:08,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 21:00:08,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-02 21:00:08,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:08,069 INFO L225 Difference]: With dead ends: 39 [2018-02-02 21:00:08,070 INFO L226 Difference]: Without dead ends: 36 [2018-02-02 21:00:08,071 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 21:00:08,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-02 21:00:08,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-02 21:00:08,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-02 21:00:08,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-02 21:00:08,141 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 10 [2018-02-02 21:00:08,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:08,141 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-02 21:00:08,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 21:00:08,141 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-02 21:00:08,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 21:00:08,142 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:08,142 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:08,142 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 21:00:08,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1004390413, now seen corresponding path program 1 times [2018-02-02 21:00:08,142 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:08,142 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:08,143 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:08,143 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:08,143 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:08,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:08,232 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 21:00:08,233 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:00:08,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 21:00:08,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:00:08,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:00:08,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:00:08,235 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-02-02 21:00:08,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:08,282 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-02 21:00:08,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:00:08,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-02 21:00:08,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:08,283 INFO L225 Difference]: With dead ends: 35 [2018-02-02 21:00:08,283 INFO L226 Difference]: Without dead ends: 35 [2018-02-02 21:00:08,284 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 21:00:08,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-02 21:00:08,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-02 21:00:08,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-02 21:00:08,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-02-02 21:00:08,286 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 10 [2018-02-02 21:00:08,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:08,286 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-02-02 21:00:08,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:00:08,286 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-02-02 21:00:08,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 21:00:08,286 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:08,287 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:08,287 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 21:00:08,287 INFO L82 PathProgramCache]: Analyzing trace with hash -104566583, now seen corresponding path program 1 times [2018-02-02 21:00:08,287 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:08,287 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:08,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:08,288 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:08,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:08,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:08,332 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 21:00:08,335 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:00:08,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 21:00:08,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:00:08,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:00:08,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:00:08,336 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-02-02 21:00:08,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:08,391 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-02-02 21:00:08,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:00:08,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 21:00:08,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:08,393 INFO L225 Difference]: With dead ends: 32 [2018-02-02 21:00:08,393 INFO L226 Difference]: Without dead ends: 32 [2018-02-02 21:00:08,394 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 21:00:08,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-02 21:00:08,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-02-02 21:00:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-02 21:00:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-02-02 21:00:08,397 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15 [2018-02-02 21:00:08,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:08,397 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-02-02 21:00:08,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:00:08,397 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-02-02 21:00:08,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 21:00:08,398 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:08,398 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:08,398 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 21:00:08,398 INFO L82 PathProgramCache]: Analyzing trace with hash -104566582, now seen corresponding path program 1 times [2018-02-02 21:00:08,399 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:08,399 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:08,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:08,400 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:08,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:08,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:08,501 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 21:00:08,501 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:00:08,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 21:00:08,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 21:00:08,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 21:00:08,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 21:00:08,502 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2018-02-02 21:00:08,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:08,571 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-02-02 21:00:08,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 21:00:08,572 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-02-02 21:00:08,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:08,574 INFO L225 Difference]: With dead ends: 43 [2018-02-02 21:00:08,574 INFO L226 Difference]: Without dead ends: 43 [2018-02-02 21:00:08,575 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 21:00:08,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-02 21:00:08,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-02-02 21:00:08,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 21:00:08,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-02-02 21:00:08,579 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2018-02-02 21:00:08,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:08,579 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-02-02 21:00:08,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 21:00:08,579 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-02-02 21:00:08,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 21:00:08,580 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:08,580 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 21:00:08,580 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 21:00:08,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1089103921, now seen corresponding path program 1 times [2018-02-02 21:00:08,580 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:08,580 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:08,581 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:08,581 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:08,581 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:08,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:08,694 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 21:00:08,694 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:00:08,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 21:00:08,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 21:00:08,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 21:00:08,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 21:00:08,695 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 9 states. [2018-02-02 21:00:08,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:08,795 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-02-02 21:00:08,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 21:00:08,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-02 21:00:08,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:08,796 INFO L225 Difference]: With dead ends: 55 [2018-02-02 21:00:08,796 INFO L226 Difference]: Without dead ends: 55 [2018-02-02 21:00:08,796 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-02-02 21:00:08,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-02 21:00:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-02-02 21:00:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 21:00:08,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-02 21:00:08,804 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 21 [2018-02-02 21:00:08,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:08,804 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-02 21:00:08,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 21:00:08,804 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-02 21:00:08,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 21:00:08,805 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:08,805 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 21:00:08,805 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 21:00:08,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1925999697, now seen corresponding path program 1 times [2018-02-02 21:00:08,805 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:08,805 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:08,806 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:08,806 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:08,806 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:08,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:08,961 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 21:00:08,961 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:08,961 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:08,962 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:09,009 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:09,037 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-02-02 21:00:09,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:00:09,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:00:09,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 21:00:09,072 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-02-02 21:00:09,074 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-02-02 21:00:09,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 21:00:09,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:00:09,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:00:09,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-02 21:00:09,169 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-02-02 21:00:09,175 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-02-02 21:00:09,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 21:00:09,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:00:09,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:00:09,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-02-02 21:00:09,251 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 21:00:09,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:09,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-02-02 21:00:09,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 21:00:09,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 21:00:09,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-02-02 21:00:09,252 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 18 states. [2018-02-02 21:00:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:09,697 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2018-02-02 21:00:09,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 21:00:09,697 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-02-02 21:00:09,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:09,698 INFO L225 Difference]: With dead ends: 103 [2018-02-02 21:00:09,698 INFO L226 Difference]: Without dead ends: 103 [2018-02-02 21:00:09,698 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2018-02-02 21:00:09,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-02 21:00:09,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 58. [2018-02-02 21:00:09,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 21:00:09,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-02-02 21:00:09,704 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 21 [2018-02-02 21:00:09,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:09,704 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-02-02 21:00:09,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 21:00:09,705 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-02-02 21:00:09,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 21:00:09,705 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:09,705 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 21:00:09,705 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 21:00:09,706 INFO L82 PathProgramCache]: Analyzing trace with hash 292485851, now seen corresponding path program 1 times [2018-02-02 21:00:09,706 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:09,706 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:09,707 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:09,707 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:09,707 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:09,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:09,730 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.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) 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 21:00:09,733 INFO L168 Benchmark]: Toolchain (without parser) took 2343.02 ms. Allocated memory was 400.0 MB in the beginning and 621.3 MB in the end (delta: 221.2 MB). Free memory was 358.0 MB in the beginning and 468.9 MB in the end (delta: -110.9 MB). Peak memory consumption was 110.4 MB. Max. memory is 5.3 GB. [2018-02-02 21:00:09,734 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 400.0 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 21:00:09,734 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.03 ms. Allocated memory is still 400.0 MB. Free memory was 356.7 MB in the beginning and 347.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-02 21:00:09,735 INFO L168 Benchmark]: Boogie Preprocessor took 24.41 ms. Allocated memory is still 400.0 MB. Free memory was 347.5 MB in the beginning and 344.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. [2018-02-02 21:00:09,735 INFO L168 Benchmark]: RCFGBuilder took 186.49 ms. Allocated memory is still 400.0 MB. Free memory was 344.8 MB in the beginning and 327.5 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 5.3 GB. [2018-02-02 21:00:09,735 INFO L168 Benchmark]: TraceAbstraction took 1968.06 ms. Allocated memory was 400.0 MB in the beginning and 621.3 MB in the end (delta: 221.2 MB). Free memory was 327.5 MB in the beginning and 468.9 MB in the end (delta: -141.4 MB). Peak memory consumption was 79.9 MB. Max. memory is 5.3 GB. [2018-02-02 21:00:09,736 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.13 ms. Allocated memory is still 400.0 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 161.03 ms. Allocated memory is still 400.0 MB. Free memory was 356.7 MB in the beginning and 347.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.41 ms. Allocated memory is still 400.0 MB. Free memory was 347.5 MB in the beginning and 344.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 186.49 ms. Allocated memory is still 400.0 MB. Free memory was 344.8 MB in the beginning and 327.5 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1968.06 ms. Allocated memory was 400.0 MB in the beginning and 621.3 MB in the end (delta: 221.2 MB). Free memory was 327.5 MB in the beginning and 468.9 MB in the end (delta: -141.4 MB). Peak memory consumption was 79.9 MB. 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_21-00-09-743.csv Received shutdown request...