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/rec_strlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:59:58,033 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:59:58,035 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:59:58,045 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:59:58,046 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:59:58,046 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:59:58,047 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:59:58,049 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:59:58,050 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:59:58,051 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:59:58,051 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:59:58,052 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:59:58,052 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:59:58,053 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:59:58,054 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:59:58,056 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:59:58,057 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:59:58,059 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:59:58,060 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:59:58,061 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:59:58,062 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:59:58,062 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:59:58,063 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:59:58,063 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:59:58,064 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:59:58,065 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:59:58,065 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:59:58,066 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:59:58,066 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:59:58,066 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:59:58,066 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:59:58,067 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 20:59:58,076 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:59:58,076 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:59:58,077 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:59:58,077 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:59:58,077 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:59:58,078 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:59:58,078 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:59:58,078 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:59:58,078 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:59:58,078 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:59:58,078 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:59:58,079 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:59:58,079 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:59:58,079 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:59:58,079 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:59:58,079 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:59:58,079 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:59:58,080 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:59:58,080 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:59:58,080 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:59:58,080 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:59:58,080 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:59:58,080 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 20:59:58,080 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 20:59:58,081 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-02 20:59:58,111 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:59:58,123 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:59:58,126 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:59:58,128 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:59:58,128 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:59:58,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/rec_strlen-alloca_true-valid-memsafety_true-termination.i [2018-02-02 20:59:58,247 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:59:58,248 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:59:58,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:59:58,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:59:58,253 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:59:58,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:59:58" (1/1) ... [2018-02-02 20:59:58,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f3da0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:58, skipping insertion in model container [2018-02-02 20:59:58,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:59:58" (1/1) ... [2018-02-02 20:59:58,265 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:59:58,293 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:59:58,377 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:59:58,389 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:59:58,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:58 WrapperNode [2018-02-02 20:59:58,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:59:58,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:59:58,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:59:58,394 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:59:58,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:58" (1/1) ... [2018-02-02 20:59:58,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:58" (1/1) ... [2018-02-02 20:59:58,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:58" (1/1) ... [2018-02-02 20:59:58,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:58" (1/1) ... [2018-02-02 20:59:58,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:58" (1/1) ... [2018-02-02 20:59:58,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:58" (1/1) ... [2018-02-02 20:59:58,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:58" (1/1) ... [2018-02-02 20:59:58,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:59:58,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:59:58,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:59:58,414 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:59:58,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:58" (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 20:59:58,449 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:59:58,449 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:59:58,449 INFO L136 BoogieDeclarations]: Found implementation of procedure strlen_rec [2018-02-02 20:59:58,449 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:59:58,450 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:59:58,450 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:59:58,450 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:59:58,450 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:59:58,450 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:59:58,450 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:59:58,450 INFO L128 BoogieDeclarations]: Found specification of procedure strlen_rec [2018-02-02 20:59:58,450 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:59:58,450 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:59:58,450 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:59:58,550 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:59:58,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:59:58 BoogieIcfgContainer [2018-02-02 20:59:58,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:59:58,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:59:58,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:59:58,553 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:59:58,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:59:58" (1/3) ... [2018-02-02 20:59:58,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7681f5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:59:58, skipping insertion in model container [2018-02-02 20:59:58,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:58" (2/3) ... [2018-02-02 20:59:58,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7681f5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:59:58, skipping insertion in model container [2018-02-02 20:59:58,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:59:58" (3/3) ... [2018-02-02 20:59:58,556 INFO L107 eAbstractionObserver]: Analyzing ICFG rec_strlen-alloca_true-valid-memsafety_true-termination.i [2018-02-02 20:59:58,561 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:59:58,566 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-02 20:59:58,596 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:59:58,596 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:59:58,596 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 20:59:58,596 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 20:59:58,597 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:59:58,597 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:59:58,597 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:59:58,597 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:59:58,598 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:59:58,608 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-02-02 20:59:58,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 20:59:58,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:58,617 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:58,618 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-02 20:59:58,622 INFO L82 PathProgramCache]: Analyzing trace with hash -407257815, now seen corresponding path program 1 times [2018-02-02 20:59:58,623 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:58,624 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:58,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:58,664 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:58,664 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:58,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:58,853 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 20:59:58,855 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:58,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:59:58,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:59:58,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:59:58,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:59:58,870 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2018-02-02 20:59:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:58,968 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-02-02 20:59:58,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:59:58,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-02 20:59:58,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:58,977 INFO L225 Difference]: With dead ends: 29 [2018-02-02 20:59:58,978 INFO L226 Difference]: Without dead ends: 26 [2018-02-02 20:59:58,979 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:59:58,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-02 20:59:59,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-02-02 20:59:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-02 20:59:59,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-02-02 20:59:59,008 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2018-02-02 20:59:59,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:59,008 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-02-02 20:59:59,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:59:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-02-02 20:59:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 20:59:59,008 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:59,008 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:59,009 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-02 20:59:59,009 INFO L82 PathProgramCache]: Analyzing trace with hash -407257816, now seen corresponding path program 1 times [2018-02-02 20:59:59,009 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:59,009 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:59,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:59,010 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:59,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:59,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:59,039 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 20:59:59,039 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:59,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:59:59,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:59:59,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:59:59,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:59:59,041 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 4 states. [2018-02-02 20:59:59,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:59,063 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-02-02 20:59:59,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:59:59,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-02 20:59:59,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:59,064 INFO L225 Difference]: With dead ends: 25 [2018-02-02 20:59:59,064 INFO L226 Difference]: Without dead ends: 25 [2018-02-02 20:59:59,065 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 20:59:59,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-02 20:59:59,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-02 20:59:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-02 20:59:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-02-02 20:59:59,068 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 10 [2018-02-02 20:59:59,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:59,068 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-02-02 20:59:59,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:59:59,069 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-02-02 20:59:59,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 20:59:59,069 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:59,069 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:59,069 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-02 20:59:59,069 INFO L82 PathProgramCache]: Analyzing trace with hash 665022209, now seen corresponding path program 1 times [2018-02-02 20:59:59,069 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:59,069 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:59,070 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:59,070 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:59,070 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:59,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:59,108 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 20:59:59,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:59,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:59:59,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:59:59,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:59:59,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:59:59,109 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2018-02-02 20:59:59,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:59,142 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-02-02 20:59:59,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:59:59,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-02 20:59:59,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:59,143 INFO L225 Difference]: With dead ends: 24 [2018-02-02 20:59:59,143 INFO L226 Difference]: Without dead ends: 24 [2018-02-02 20:59:59,143 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 20:59:59,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-02-02 20:59:59,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-02-02 20:59:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-02-02 20:59:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-02-02 20:59:59,145 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 13 [2018-02-02 20:59:59,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:59,146 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-02-02 20:59:59,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:59:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-02-02 20:59:59,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 20:59:59,146 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:59,146 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:59,146 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-02 20:59:59,146 INFO L82 PathProgramCache]: Analyzing trace with hash 665022210, now seen corresponding path program 1 times [2018-02-02 20:59:59,146 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:59,146 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:59,147 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:59,147 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:59,147 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:59,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:59,228 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 20:59:59,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:59,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:59:59,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:59:59,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:59:59,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:59:59,230 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 8 states. [2018-02-02 20:59:59,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:59,314 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-02-02 20:59:59,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:59:59,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-02-02 20:59:59,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:59,315 INFO L225 Difference]: With dead ends: 31 [2018-02-02 20:59:59,315 INFO L226 Difference]: Without dead ends: 31 [2018-02-02 20:59:59,316 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 20:59:59,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-02 20:59:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-02 20:59:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-02 20:59:59,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-02-02 20:59:59,319 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 13 [2018-02-02 20:59:59,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:59,320 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-02-02 20:59:59,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:59:59,320 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-02-02 20:59:59,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 20:59:59,320 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:59,320 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:59,321 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-02 20:59:59,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1167971539, now seen corresponding path program 1 times [2018-02-02 20:59:59,321 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:59,321 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:59,322 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:59,322 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:59,322 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:59,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:59,436 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 20:59:59,436 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:59,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:59:59,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:59:59,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:59:59,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:59:59,437 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 9 states. [2018-02-02 20:59:59,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:59,527 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-02-02 20:59:59,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:59:59,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-02 20:59:59,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:59,528 INFO L225 Difference]: With dead ends: 45 [2018-02-02 20:59:59,528 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 20:59:59,529 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:59:59,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 20:59:59,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-02-02 20:59:59,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-02 20:59:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-02 20:59:59,536 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 17 [2018-02-02 20:59:59,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:59,536 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-02 20:59:59,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:59:59,537 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-02 20:59:59,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 20:59:59,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:59,537 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:59,537 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-02 20:59:59,537 INFO L82 PathProgramCache]: Analyzing trace with hash -466906961, now seen corresponding path program 1 times [2018-02-02 20:59:59,537 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:59,537 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:59,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:59,538 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:59,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:59,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:59,699 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 20:59:59,699 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 20:59:59,699 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 20:59:59,700 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:59,731 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 20:59:59,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 20:59:59,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 20:59:59,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 20:59:59,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 20:59:59,808 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 20:59:59,810 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 20:59:59,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 20:59:59,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 20:59:59,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 20:59:59,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-02 20:59:59,898 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 20:59:59,905 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 20:59:59,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 20:59:59,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 20:59:59,919 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 20:59:59,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-02-02 21:00:00,075 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:00,075 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:00,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-02-02 21:00:00,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 21:00:00,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 21:00:00,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-02-02 21:00:00,077 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 20 states. [2018-02-02 21:00:00,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:00,427 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-02-02 21:00:00,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 21:00:00,428 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 17 [2018-02-02 21:00:00,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:00,429 INFO L225 Difference]: With dead ends: 49 [2018-02-02 21:00:00,430 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 21:00:00,430 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2018-02-02 21:00:00,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 21:00:00,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-02-02 21:00:00,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 21:00:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-02-02 21:00:00,433 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 17 [2018-02-02 21:00:00,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:00,433 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-02-02 21:00:00,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 21:00:00,433 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-02-02 21:00:00,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 21:00:00,434 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:00,434 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:00,434 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-02 21:00:00,434 INFO L82 PathProgramCache]: Analyzing trace with hash -847794598, now seen corresponding path program 2 times [2018-02-02 21:00:00,434 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:00,434 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:00,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:00,435 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:00,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:00,445 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:00,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:00,664 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:00,664 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:00,665 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:00:00,698 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:00:00,698 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:00,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:00,708 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:00,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:00:00,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:00:00,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 21:00:00,718 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:00,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-02 21:00:00,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 21:00:00,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:00:00,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:00:00,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-02 21:00:00,795 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 19 treesize of output 15 [2018-02-02 21:00:00,801 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 15 treesize of output 12 [2018-02-02 21:00:00,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 21:00:00,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:00:00,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:00:00,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:34 [2018-02-02 21:00:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:00,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:00,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-02 21:00:00,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 21:00:00,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 21:00:00,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-02-02 21:00:00,885 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 22 states. [2018-02-02 21:00:01,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:01,165 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-02-02 21:00:01,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 21:00:01,166 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-02-02 21:00:01,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:01,167 INFO L225 Difference]: With dead ends: 56 [2018-02-02 21:00:01,167 INFO L226 Difference]: Without dead ends: 56 [2018-02-02 21:00:01,167 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2018-02-02 21:00:01,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-02 21:00:01,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-02-02 21:00:01,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 21:00:01,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-02 21:00:01,173 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 21 [2018-02-02 21:00:01,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:01,173 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-02 21:00:01,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 21:00:01,173 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-02 21:00:01,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 21:00:01,174 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:01,174 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] [2018-02-02 21:00:01,174 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-02 21:00:01,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1711563014, now seen corresponding path program 1 times [2018-02-02 21:00:01,174 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:01,175 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:01,175 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:01,175 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:01,175 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:01,184 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:01,188 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:01,190 INFO L168 Benchmark]: Toolchain (without parser) took 2943.11 ms. Allocated memory was 401.6 MB in the beginning and 669.0 MB in the end (delta: 267.4 MB). Free memory was 358.3 MB in the beginning and 579.3 MB in the end (delta: -221.0 MB). Peak memory consumption was 46.3 MB. Max. memory is 5.3 GB. [2018-02-02 21:00:01,191 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 401.6 MB. Free memory is still 363.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 21:00:01,191 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.69 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 347.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 21:00:01,191 INFO L168 Benchmark]: Boogie Preprocessor took 19.41 ms. Allocated memory is still 401.6 MB. Free memory was 347.7 MB in the beginning and 345.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 21:00:01,191 INFO L168 Benchmark]: RCFGBuilder took 137.01 ms. Allocated memory is still 401.6 MB. Free memory was 345.1 MB in the beginning and 330.5 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-02 21:00:01,192 INFO L168 Benchmark]: TraceAbstraction took 2638.76 ms. Allocated memory was 401.6 MB in the beginning and 669.0 MB in the end (delta: 267.4 MB). Free memory was 330.5 MB in the beginning and 579.3 MB in the end (delta: -248.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-02-02 21:00:01,192 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.14 ms. Allocated memory is still 401.6 MB. Free memory is still 363.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 145.69 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 347.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 19.41 ms. Allocated memory is still 401.6 MB. Free memory was 347.7 MB in the beginning and 345.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 137.01 ms. Allocated memory is still 401.6 MB. Free memory was 345.1 MB in the beginning and 330.5 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2638.76 ms. Allocated memory was 401.6 MB in the beginning and 669.0 MB in the end (delta: 267.4 MB). Free memory was 330.5 MB in the beginning and 579.3 MB in the end (delta: -248.8 MB). Peak memory consumption was 18.6 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/rec_strlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_21-00-01-198.csv Received shutdown request...