java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:36:49,248 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:36:49,250 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:36:49,259 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:36:49,260 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:36:49,260 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:36:49,261 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:36:49,262 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:36:49,263 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:36:49,264 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:36:49,265 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:36:49,265 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:36:49,266 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:36:49,267 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:36:49,268 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:36:49,270 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:36:49,271 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:36:49,273 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:36:49,274 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:36:49,275 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:36:49,277 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:36:49,277 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:36:49,277 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:36:49,278 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:36:49,279 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:36:49,280 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:36:49,280 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:36:49,281 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:36:49,281 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:36:49,281 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:36:49,282 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:36:49,282 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 10:36:49,291 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:36:49,291 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:36:49,292 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:36:49,293 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:36:49,293 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:36:49,293 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:36:49,293 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:36:49,293 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:36:49,293 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:36:49,293 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:36:49,294 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:36:49,294 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:36:49,294 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:36:49,294 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:36:49,294 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:36:49,294 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:36:49,294 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:36:49,295 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:36:49,295 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:36:49,295 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:36:49,295 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:36:49,295 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:36:49,295 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:36:49,295 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:36:49,325 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:36:49,336 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:36:49,339 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:36:49,340 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:36:49,340 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:36:49,341 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-02 10:36:49,467 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:36:49,468 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:36:49,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:36:49,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:36:49,473 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:36:49,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:36:49" (1/1) ... [2018-02-02 10:36:49,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a328098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:49, skipping insertion in model container [2018-02-02 10:36:49,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:36:49" (1/1) ... [2018-02-02 10:36:49,487 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:36:49,514 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:36:49,604 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:36:49,616 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:36:49,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:49 WrapperNode [2018-02-02 10:36:49,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:36:49,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:36:49,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:36:49,623 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:36:49,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:49" (1/1) ... [2018-02-02 10:36:49,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:49" (1/1) ... [2018-02-02 10:36:49,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:49" (1/1) ... [2018-02-02 10:36:49,638 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:49" (1/1) ... [2018-02-02 10:36:49,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:49" (1/1) ... [2018-02-02 10:36:49,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:49" (1/1) ... [2018-02-02 10:36:49,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:49" (1/1) ... [2018-02-02 10:36:49,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:36:49,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:36:49,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:36:49,646 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:36:49,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36: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-02 10:36:49,681 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:36:49,681 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:36:49,681 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-02-02 10:36:49,681 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:36:49,681 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:36:49,682 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:36:49,682 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:36:49,682 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:36:49,682 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:36:49,682 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:36:49,682 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-02-02 10:36:49,682 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:36:49,682 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:36:49,683 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:36:49,804 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:36:49,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:36:49 BoogieIcfgContainer [2018-02-02 10:36:49,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:36:49,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:36:49,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:36:49,807 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:36:49,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:36:49" (1/3) ... [2018-02-02 10:36:49,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e84160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:36:49, skipping insertion in model container [2018-02-02 10:36:49,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:49" (2/3) ... [2018-02-02 10:36:49,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e84160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:36:49, skipping insertion in model container [2018-02-02 10:36:49,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:36:49" (3/3) ... [2018-02-02 10:36:49,809 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-02-02 10:36:49,814 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:36:49,818 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-02 10:36:49,841 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:36:49,842 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:36:49,842 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:36:49,842 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:36:49,842 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:36:49,842 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:36:49,842 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:36:49,842 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:36:49,843 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:36:49,854 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-02-02 10:36:49,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 10:36:49,863 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:49,864 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:49,864 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:49,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1793434931, now seen corresponding path program 1 times [2018-02-02 10:36:49,915 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:49,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:50,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:50,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:50,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:36:50,025 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:50,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:50,026 INFO L182 omatonBuilderFactory]: Interpolants [34#true, 35#false, 36#(= 1 (select |#valid| |main_#t~malloc3.base|)), 37#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-02-02 10:36:50,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:50,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:36:50,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:36:50,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:36:50,042 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2018-02-02 10:36:50,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:50,103 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-02-02 10:36:50,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:36:50,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-02 10:36:50,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:50,109 INFO L225 Difference]: With dead ends: 30 [2018-02-02 10:36:50,109 INFO L226 Difference]: Without dead ends: 27 [2018-02-02 10:36:50,111 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:36:50,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-02-02 10:36:50,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-02-02 10:36:50,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-02 10:36:50,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-02-02 10:36:50,174 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 10 [2018-02-02 10:36:50,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:50,175 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-02-02 10:36:50,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:36:50,175 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-02-02 10:36:50,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 10:36:50,175 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:50,176 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:50,176 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:50,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1793434932, now seen corresponding path program 1 times [2018-02-02 10:36:50,177 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:50,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:50,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:50,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:36:50,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:50,283 INFO L182 omatonBuilderFactory]: Interpolants [97#true, 98#false, 99#(<= 1 main_~length1~0), 100#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|)), 101#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0))] [2018-02-02 10:36:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:50,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:36:50,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:36:50,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:36:50,286 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2018-02-02 10:36:50,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:50,311 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-02-02 10:36:50,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:36:50,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-02 10:36:50,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:50,312 INFO L225 Difference]: With dead ends: 26 [2018-02-02 10:36:50,312 INFO L226 Difference]: Without dead ends: 26 [2018-02-02 10:36:50,313 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:36:50,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-02 10:36:50,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-02-02 10:36:50,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-02 10:36:50,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-02-02 10:36:50,315 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 10 [2018-02-02 10:36:50,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:50,316 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-02-02 10:36:50,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:36:50,316 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-02-02 10:36:50,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:36:50,316 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:50,316 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:50,316 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:50,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2006900249, now seen corresponding path program 1 times [2018-02-02 10:36:50,317 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:50,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:50,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:50,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:50,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:36:50,369 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:50,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:50,369 INFO L182 omatonBuilderFactory]: Interpolants [160#(= 1 (select |#valid| cstrlen_~s~0.base)), 156#true, 157#false, 158#(= 1 (select |#valid| main_~nondetString1~0.base)), 159#(= 1 (select |#valid| |cstrlen_#in~str.base|))] [2018-02-02 10:36:50,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:50,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:36:50,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:36:50,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:36:50,370 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2018-02-02 10:36:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:50,410 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-02-02 10:36:50,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:36:50,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 10:36:50,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:50,411 INFO L225 Difference]: With dead ends: 25 [2018-02-02 10:36:50,411 INFO L226 Difference]: Without dead ends: 25 [2018-02-02 10:36:50,412 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:36:50,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-02 10:36:50,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-02 10:36:50,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-02 10:36:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-02-02 10:36:50,415 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 14 [2018-02-02 10:36:50,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:50,416 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-02-02 10:36:50,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:36:50,416 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-02-02 10:36:50,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:36:50,417 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:50,417 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:50,417 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:50,417 INFO L82 PathProgramCache]: Analyzing trace with hash -2006900248, now seen corresponding path program 1 times [2018-02-02 10:36:50,418 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:50,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:50,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:50,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:36:50,511 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:50,512 INFO L182 omatonBuilderFactory]: Interpolants [213#true, 214#false, 215#(<= 1 main_~length1~0), 216#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|)), 217#(and (= 0 main_~nondetString1~0.offset) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0)), 218#(and (= 0 main_~nondetString1~0.offset) (<= 1 (select |#length| main_~nondetString1~0.base))), 219#(and (= 0 |cstrlen_#in~str.offset|) (<= 1 (select |#length| |cstrlen_#in~str.base|))), 220#(and (= cstrlen_~s~0.offset 0) (<= 1 (select |#length| cstrlen_~s~0.base)))] [2018-02-02 10:36:50,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:50,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:36:50,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:36:50,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:36:50,513 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 8 states. [2018-02-02 10:36:50,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:50,572 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-02-02 10:36:50,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:36:50,572 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-02-02 10:36:50,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:50,574 INFO L225 Difference]: With dead ends: 32 [2018-02-02 10:36:50,575 INFO L226 Difference]: Without dead ends: 32 [2018-02-02 10:36:50,575 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:36:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-02 10:36:50,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-02-02 10:36:50,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-02 10:36:50,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-02-02 10:36:50,577 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 14 [2018-02-02 10:36:50,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:50,577 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-02-02 10:36:50,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:36:50,578 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-02-02 10:36:50,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:36:50,578 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:50,578 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:50,578 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:50,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1301829867, now seen corresponding path program 1 times [2018-02-02 10:36:50,579 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:50,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:50,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:50,755 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:50,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:36:50,755 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:50,755 INFO L182 omatonBuilderFactory]: Interpolants [288#(and (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 289#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset)) (= main_~nondetString1~0.offset 0)), 290#(= 0 (select (select |#memory_int| |cstrlen_#in~str.base|) |cstrlen_#in~str.offset|)), 291#(= 0 (select (select |#memory_int| cstrlen_~s~0.base) cstrlen_~s~0.offset)), 292#(= |cstrlen_#t~mem1| 0), 284#true, 285#false, 286#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 287#(and (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|) (<= main_~length1~0 1))] [2018-02-02 10:36:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:50,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:36:50,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:36:50,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:36:50,756 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-02-02 10:36:50,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:50,838 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-02-02 10:36:50,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:36:50,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-02-02 10:36:50,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:50,839 INFO L225 Difference]: With dead ends: 43 [2018-02-02 10:36:50,839 INFO L226 Difference]: Without dead ends: 43 [2018-02-02 10:36:50,841 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 10:36:50,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-02 10:36:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-02-02 10:36:50,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 10:36:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-02-02 10:36:50,848 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 18 [2018-02-02 10:36:50,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:50,848 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-02-02 10:36:50,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:36:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-02-02 10:36:50,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:36:50,849 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:50,849 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:50,849 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:50,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1559995305, now seen corresponding path program 1 times [2018-02-02 10:36:50,851 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:50,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:50,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:36:50,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:36:50,983 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:50,984 INFO L182 omatonBuilderFactory]: Interpolants [384#true, 385#false, 386#(<= 1 main_~length1~0), 387#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|)), 388#(and (<= 1 main_~length1~0) (or (= (+ main_~nondetString1~0.offset main_~length1~0) 1) (= main_~length1~0 (select |#length| main_~nondetString1~0.base))) (= main_~nondetString1~0.offset 0)), 389#(and (or (<= 2 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset))) (= main_~nondetString1~0.offset 0)), 390#(and (= 0 |cstrlen_#in~str.offset|) (or (= 0 (select (select |#memory_int| |cstrlen_#in~str.base|) |cstrlen_#in~str.offset|)) (<= 2 (select |#length| |cstrlen_#in~str.base|)))), 391#(and (or (= 0 (select (select |#memory_int| cstrlen_~s~0.base) cstrlen_~s~0.offset)) (<= 2 (select |#length| cstrlen_~s~0.base))) (= cstrlen_~s~0.offset 0)), 392#(and (or (<= 2 (select |#length| cstrlen_~s~0.base)) (= |cstrlen_#t~mem1| 0)) (= cstrlen_~s~0.offset 0)), 393#(and (= cstrlen_~s~0.offset 0) (<= 2 (select |#length| cstrlen_~s~0.base))), 394#(and (<= 1 cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 1) (select |#length| cstrlen_~s~0.base)))] [2018-02-02 10:36:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:50,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:36:50,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:36:50,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:36:50,984 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 11 states. [2018-02-02 10:36:51,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:51,209 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-02-02 10:36:51,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:36:51,210 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-02-02 10:36:51,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:51,210 INFO L225 Difference]: With dead ends: 50 [2018-02-02 10:36:51,210 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 10:36:51,211 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:36:51,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 10:36:51,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-02-02 10:36:51,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 10:36:51,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-02-02 10:36:51,214 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 18 [2018-02-02 10:36:51,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:51,214 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-02-02 10:36:51,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:36:51,214 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-02-02 10:36:51,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:36:51,216 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:51,216 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-02 10:36:51,216 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:51,216 INFO L82 PathProgramCache]: Analyzing trace with hash -968711636, now seen corresponding path program 1 times [2018-02-02 10:36:51,217 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:51,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:51,240 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:36:51,244 INFO L168 Benchmark]: Toolchain (without parser) took 1775.94 ms. Allocated memory was 397.4 MB in the beginning and 596.1 MB in the end (delta: 198.7 MB). Free memory was 355.4 MB in the beginning and 408.7 MB in the end (delta: -53.2 MB). Peak memory consumption was 145.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:51,245 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 397.4 MB. Free memory is still 360.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:36:51,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.33 ms. Allocated memory is still 397.4 MB. Free memory was 354.1 MB in the beginning and 344.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:51,245 INFO L168 Benchmark]: Boogie Preprocessor took 22.63 ms. Allocated memory is still 397.4 MB. Free memory was 344.8 MB in the beginning and 342.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:51,245 INFO L168 Benchmark]: RCFGBuilder took 159.54 ms. Allocated memory is still 397.4 MB. Free memory was 342.2 MB in the beginning and 327.4 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:51,246 INFO L168 Benchmark]: TraceAbstraction took 1437.84 ms. Allocated memory was 397.4 MB in the beginning and 596.1 MB in the end (delta: 198.7 MB). Free memory was 326.1 MB in the beginning and 408.7 MB in the end (delta: -82.5 MB). Peak memory consumption was 116.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:51,247 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 397.4 MB. Free memory is still 360.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 153.33 ms. Allocated memory is still 397.4 MB. Free memory was 354.1 MB in the beginning and 344.8 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.63 ms. Allocated memory is still 397.4 MB. Free memory was 344.8 MB in the beginning and 342.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 159.54 ms. Allocated memory is still 397.4 MB. Free memory was 342.2 MB in the beginning and 327.4 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1437.84 ms. Allocated memory was 397.4 MB in the beginning and 596.1 MB in the end (delta: 198.7 MB). Free memory was 326.1 MB in the beginning and 408.7 MB in the end (delta: -82.5 MB). Peak memory consumption was 116.2 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-02_10-36-51-254.csv Received shutdown request...