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/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:03:48,773 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:03:48,774 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:03:48,783 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:03:48,783 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:03:48,784 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:03:48,785 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:03:48,786 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:03:48,787 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:03:48,788 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:03:48,789 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:03:48,789 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:03:48,790 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:03:48,791 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:03:48,791 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:03:48,793 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:03:48,795 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:03:48,796 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:03:48,797 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:03:48,798 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:03:48,800 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:03:48,800 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:03:48,800 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:03:48,801 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:03:48,802 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:03:48,802 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:03:48,803 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:03:48,803 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:03:48,803 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:03:48,803 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:03:48,804 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:03:48,804 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-04 04:03:48,814 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:03:48,814 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:03:48,815 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:03:48,815 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:03:48,815 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:03:48,815 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:03:48,815 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:03:48,816 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:03:48,816 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:03:48,816 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:03:48,816 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:03:48,816 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:03:48,816 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:03:48,817 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:03:48,817 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:03:48,817 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:03:48,817 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:03:48,817 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:03:48,817 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:03:48,818 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:03:48,818 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:03:48,818 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:03:48,818 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:03:48,818 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:03:48,818 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:03:48,850 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:03:48,859 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:03:48,861 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:03:48,862 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:03:48,862 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:03:48,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-02-04 04:03:48,974 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:03:48,975 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:03:48,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:03:48,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:03:48,979 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:03:48,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:03:48" (1/1) ... [2018-02-04 04:03:48,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4762d03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:03:48, skipping insertion in model container [2018-02-04 04:03:48,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:03:48" (1/1) ... [2018-02-04 04:03:48,992 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:03:49,018 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:03:49,104 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:03:49,116 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:03:49,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:03:49 WrapperNode [2018-02-04 04:03:49,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:03:49,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:03:49,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:03:49,122 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:03:49,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:03:49" (1/1) ... [2018-02-04 04:03:49,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:03:49" (1/1) ... [2018-02-04 04:03:49,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:03:49" (1/1) ... [2018-02-04 04:03:49,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:03:49" (1/1) ... [2018-02-04 04:03:49,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:03:49" (1/1) ... [2018-02-04 04:03:49,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:03:49" (1/1) ... [2018-02-04 04:03:49,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:03:49" (1/1) ... [2018-02-04 04:03:49,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:03:49,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:03:49,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:03:49,144 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:03:49,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:03:49" (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-04 04:03:49,185 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:03:49,185 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:03:49,185 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-02-04 04:03:49,185 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:03:49,185 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 04:03:49,185 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 04:03:49,186 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:03:49,186 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:03:49,186 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:03:49,186 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 04:03:49,186 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-02-04 04:03:49,186 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:03:49,186 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:03:49,186 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:03:49,292 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:03:49,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:03:49 BoogieIcfgContainer [2018-02-04 04:03:49,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:03:49,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:03:49,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:03:49,296 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:03:49,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:03:48" (1/3) ... [2018-02-04 04:03:49,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cfc2fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:03:49, skipping insertion in model container [2018-02-04 04:03:49,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:03:49" (2/3) ... [2018-02-04 04:03:49,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cfc2fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:03:49, skipping insertion in model container [2018-02-04 04:03:49,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:03:49" (3/3) ... [2018-02-04 04:03:49,299 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-02-04 04:03:49,304 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:03:49,308 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-04 04:03:49,336 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:03:49,336 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:03:49,336 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:03:49,336 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:03:49,337 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:03:49,337 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:03:49,337 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:03:49,337 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:03:49,337 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:03:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-02-04 04:03:49,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 04:03:49,351 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:03:49,352 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:03:49,352 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 04:03:49,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1793434931, now seen corresponding path program 1 times [2018-02-04 04:03:49,356 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:03:49,356 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:03:49,385 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:49,385 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:03:49,386 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:03:49,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:03:49,484 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-04 04:03:49,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:03:49,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 04:03:49,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:03:49,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:03:49,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:03:49,496 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2018-02-04 04:03:49,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:03:49,553 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-02-04 04:03:49,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:03:49,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-04 04:03:49,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:03:49,610 INFO L225 Difference]: With dead ends: 30 [2018-02-04 04:03:49,610 INFO L226 Difference]: Without dead ends: 27 [2018-02-04 04:03:49,614 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-04 04:03:49,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-02-04 04:03:49,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-02-04 04:03:49,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 04:03:49,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-02-04 04:03:49,637 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 10 [2018-02-04 04:03:49,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:03:49,637 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-02-04 04:03:49,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:03:49,638 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-02-04 04:03:49,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 04:03:49,638 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:03:49,638 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:03:49,638 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 04:03:49,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1793434932, now seen corresponding path program 1 times [2018-02-04 04:03:49,639 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:03:49,639 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:03:49,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:49,640 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:03:49,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:03:49,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:03:49,717 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-04 04:03:49,717 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:03:49,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:03:49,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:03:49,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:03:49,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:03:49,719 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2018-02-04 04:03:49,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:03:49,767 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-02-04 04:03:49,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:03:49,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-04 04:03:49,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:03:49,769 INFO L225 Difference]: With dead ends: 26 [2018-02-04 04:03:49,769 INFO L226 Difference]: Without dead ends: 26 [2018-02-04 04:03:49,770 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-04 04:03:49,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-04 04:03:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-02-04 04:03:49,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 04:03:49,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-02-04 04:03:49,773 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 10 [2018-02-04 04:03:49,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:03:49,773 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-02-04 04:03:49,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:03:49,773 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-02-04 04:03:49,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 04:03:49,774 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:03:49,774 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:03:49,774 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 04:03:49,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2006900249, now seen corresponding path program 1 times [2018-02-04 04:03:49,774 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:03:49,775 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:03:49,775 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:49,776 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:03:49,776 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:03:49,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:03:49,864 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-04 04:03:49,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:03:49,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:03:49,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:03:49,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:03:49,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:03:49,865 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2018-02-04 04:03:49,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:03:49,904 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-02-04 04:03:49,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:03:49,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 04:03:49,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:03:49,904 INFO L225 Difference]: With dead ends: 25 [2018-02-04 04:03:49,904 INFO L226 Difference]: Without dead ends: 25 [2018-02-04 04:03:49,905 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-04 04:03:49,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-04 04:03:49,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-04 04:03:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-04 04:03:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-02-04 04:03:49,907 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 14 [2018-02-04 04:03:49,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:03:49,907 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-02-04 04:03:49,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:03:49,907 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-02-04 04:03:49,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 04:03:49,908 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:03:49,908 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:03:49,908 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 04:03:49,908 INFO L82 PathProgramCache]: Analyzing trace with hash -2006900248, now seen corresponding path program 1 times [2018-02-04 04:03:49,908 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:03:49,908 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:03:49,909 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:49,909 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:03:49,909 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:03:49,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:03:49,973 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-04 04:03:49,974 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:03:49,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 04:03:49,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 04:03:49,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 04:03:49,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:03:49,975 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 8 states. [2018-02-04 04:03:50,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:03:50,055 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-02-04 04:03:50,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:03:50,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-02-04 04:03:50,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:03:50,058 INFO L225 Difference]: With dead ends: 32 [2018-02-04 04:03:50,058 INFO L226 Difference]: Without dead ends: 32 [2018-02-04 04:03:50,058 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-04 04:03:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-04 04:03:50,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-02-04 04:03:50,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 04:03:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-02-04 04:03:50,062 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 14 [2018-02-04 04:03:50,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:03:50,062 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-02-04 04:03:50,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 04:03:50,062 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-02-04 04:03:50,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 04:03:50,063 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:03:50,063 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:03:50,063 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 04:03:50,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1301829867, now seen corresponding path program 1 times [2018-02-04 04:03:50,063 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:03:50,063 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:03:50,064 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:50,064 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:03:50,065 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:03:50,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:03:50,152 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-04 04:03:50,152 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:03:50,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 04:03:50,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 04:03:50,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 04:03:50,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:03:50,154 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-02-04 04:03:50,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:03:50,241 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-02-04 04:03:50,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:03:50,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-02-04 04:03:50,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:03:50,242 INFO L225 Difference]: With dead ends: 43 [2018-02-04 04:03:50,242 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 04:03:50,243 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:03:50,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 04:03:50,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-02-04 04:03:50,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 04:03:50,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-02-04 04:03:50,245 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 18 [2018-02-04 04:03:50,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:03:50,245 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-02-04 04:03:50,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 04:03:50,245 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-02-04 04:03:50,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 04:03:50,246 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:03:50,246 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:03:50,246 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 04:03:50,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1559995305, now seen corresponding path program 1 times [2018-02-04 04:03:50,246 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:03:50,246 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:03:50,247 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:50,247 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:03:50,247 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:03:50,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:03:50,383 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-04 04:03:50,383 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:03:50,383 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:03:50,384 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:03:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:03:50,423 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:03:50,456 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-04 04:03:50,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:03:50,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:03:50,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 04:03:50,487 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-04 04:03:50,489 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-04 04:03:50,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:03:50,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:03:50,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:03:50,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-04 04:03:50,567 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-04 04:03:50,575 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-04 04:03:50,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 04:03:50,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:03:50,589 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-04 04:03:50,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-02-04 04:03:50,719 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-04 04:03:50,719 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:03:50,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-02-04 04:03:50,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:03:50,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:03:50,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:03:50,721 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 18 states. [2018-02-04 04:03:51,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:03:51,034 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-02-04 04:03:51,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 04:03:51,035 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-02-04 04:03:51,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:03:51,035 INFO L225 Difference]: With dead ends: 50 [2018-02-04 04:03:51,035 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 04:03:51,036 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2018-02-04 04:03:51,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 04:03:51,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-02-04 04:03:51,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 04:03:51,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-02-04 04:03:51,040 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 18 [2018-02-04 04:03:51,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:03:51,040 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-02-04 04:03:51,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:03:51,040 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-02-04 04:03:51,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 04:03:51,041 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:03:51,041 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] [2018-02-04 04:03:51,041 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 04:03:51,041 INFO L82 PathProgramCache]: Analyzing trace with hash -968711636, now seen corresponding path program 1 times [2018-02-04 04:03:51,041 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:03:51,041 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:03:51,042 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:51,042 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:03:51,042 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:03:51,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:03:51,065 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-04 04:03:51,069 INFO L168 Benchmark]: Toolchain (without parser) took 2094.60 ms. Allocated memory was 401.6 MB in the beginning and 627.0 MB in the end (delta: 225.4 MB). Free memory was 359.6 MB in the beginning and 523.2 MB in the end (delta: -163.6 MB). Peak memory consumption was 61.9 MB. Max. memory is 5.3 GB. [2018-02-04 04:03:51,070 INFO L168 Benchmark]: CDTParser took 0.63 ms. Allocated memory is still 401.6 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:03:51,070 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.00 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 349.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-04 04:03:51,071 INFO L168 Benchmark]: Boogie Preprocessor took 22.30 ms. Allocated memory is still 401.6 MB. Free memory was 349.0 MB in the beginning and 346.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:03:51,071 INFO L168 Benchmark]: RCFGBuilder took 148.45 ms. Allocated memory is still 401.6 MB. Free memory was 346.4 MB in the beginning and 331.6 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 5.3 GB. [2018-02-04 04:03:51,071 INFO L168 Benchmark]: TraceAbstraction took 1775.33 ms. Allocated memory was 401.6 MB in the beginning and 627.0 MB in the end (delta: 225.4 MB). Free memory was 330.3 MB in the beginning and 523.2 MB in the end (delta: -192.9 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:03:51,073 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.63 ms. Allocated memory is still 401.6 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 146.00 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 349.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.30 ms. Allocated memory is still 401.6 MB. Free memory was 349.0 MB in the beginning and 346.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 148.45 ms. Allocated memory is still 401.6 MB. Free memory was 346.4 MB in the beginning and 331.6 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1775.33 ms. Allocated memory was 401.6 MB in the beginning and 627.0 MB in the end (delta: 225.4 MB). Free memory was 330.3 MB in the beginning and 523.2 MB in the end (delta: -192.9 MB). Peak memory consumption was 32.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/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-03-51-078.csv Received shutdown request...