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/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:30:46,089 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:30:46,091 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:30:46,107 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:30:46,107 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:30:46,108 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:30:46,109 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:30:46,111 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:30:46,113 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:30:46,114 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:30:46,115 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:30:46,116 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:30:46,117 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:30:46,118 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:30:46,119 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:30:46,122 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:30:46,124 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:30:46,126 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:30:46,127 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:30:46,128 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:30:46,131 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:30:46,131 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:30:46,131 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:30:46,132 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:30:46,133 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:30:46,135 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:30:46,135 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:30:46,136 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:30:46,136 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:30:46,136 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:30:46,137 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:30:46,137 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-21 00:30:46,148 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:30:46,148 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:30:46,149 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:30:46,149 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:30:46,149 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:30:46,150 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:30:46,150 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:30:46,150 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:30:46,151 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:30:46,151 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:30:46,151 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:30:46,151 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:30:46,152 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:30:46,152 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:30:46,152 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:30:46,152 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:30:46,152 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:30:46,152 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:30:46,153 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:30:46,153 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:30:46,153 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:30:46,153 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:30:46,153 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:30:46,154 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:30:46,154 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:30:46,154 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:30:46,154 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:30:46,154 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:30:46,155 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:30:46,155 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:30:46,155 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:30:46,155 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:30:46,155 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:30:46,156 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:30:46,156 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:30:46,156 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:30:46,156 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:30:46,157 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:30:46,157 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:30:46,193 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:30:46,206 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:30:46,211 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:30:46,212 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:30:46,213 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:30:46,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-01-21 00:30:46,402 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:30:46,407 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:30:46,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:30:46,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:30:46,414 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:30:46,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:30:46" (1/1) ... [2018-01-21 00:30:46,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8319445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:46, skipping insertion in model container [2018-01-21 00:30:46,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:30:46" (1/1) ... [2018-01-21 00:30:46,433 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:30:46,471 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:30:46,586 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:30:46,601 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:30:46,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:46 WrapperNode [2018-01-21 00:30:46,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:30:46,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:30:46,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:30:46,609 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:30:46,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:46" (1/1) ... [2018-01-21 00:30:46,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:46" (1/1) ... [2018-01-21 00:30:46,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:46" (1/1) ... [2018-01-21 00:30:46,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:46" (1/1) ... [2018-01-21 00:30:46,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:46" (1/1) ... [2018-01-21 00:30:46,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:46" (1/1) ... [2018-01-21 00:30:46,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:46" (1/1) ... [2018-01-21 00:30:46,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:30:46,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:30:46,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:30:46,639 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:30:46,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:46" (1/1) ... No working directory specified, using /storage/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-01-21 00:30:46,685 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:30:46,685 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:30:46,685 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrnlen [2018-01-21 00:30:46,685 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:30:46,685 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:30:46,685 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:30:46,686 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:30:46,686 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:30:46,686 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:30:46,686 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:30:46,686 INFO L128 BoogieDeclarations]: Found specification of procedure cstrnlen [2018-01-21 00:30:46,686 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:30:46,686 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:30:46,686 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:30:46,846 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:30:46,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:30:46 BoogieIcfgContainer [2018-01-21 00:30:46,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:30:46,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:30:46,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:30:46,848 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:30:46,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:30:46" (1/3) ... [2018-01-21 00:30:46,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db45900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:30:46, skipping insertion in model container [2018-01-21 00:30:46,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:46" (2/3) ... [2018-01-21 00:30:46,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db45900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:30:46, skipping insertion in model container [2018-01-21 00:30:46,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:30:46" (3/3) ... [2018-01-21 00:30:46,851 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-01-21 00:30:46,857 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:30:46,862 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 00:30:46,910 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:30:46,910 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:30:46,910 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:30:46,910 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:30:46,911 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:30:46,911 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:30:46,911 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:30:46,911 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:30:46,912 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:30:46,931 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-01-21 00:30:46,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:30:46,936 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:46,937 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:30:46,938 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:30:46,942 INFO L82 PathProgramCache]: Analyzing trace with hash 82648, now seen corresponding path program 1 times [2018-01-21 00:30:46,945 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:46,999 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:47,000 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:47,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:47,000 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:30:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:30:47,044 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:30:47,049 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:47,054 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:30:47,054 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:30:47,054 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:30:47,054 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:30:47,055 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:30:47,055 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:30:47,055 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:30:47,055 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == cstrnlenErr0EnsuresViolation======== [2018-01-21 00:30:47,055 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:30:47,056 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-01-21 00:30:47,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-21 00:30:47,057 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:47,057 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:30:47,057 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrnlenErr0EnsuresViolation]=== [2018-01-21 00:30:47,057 INFO L82 PathProgramCache]: Analyzing trace with hash 553872978, now seen corresponding path program 1 times [2018-01-21 00:30:47,057 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:47,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:47,059 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:47,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:47,059 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:47,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:30:47,126 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:47,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:30:47,126 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:47,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:30:47,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:30:47,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:30:47,147 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-01-21 00:30:47,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:47,241 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-01-21 00:30:47,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:30:47,242 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-01-21 00:30:47,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:47,248 INFO L225 Difference]: With dead ends: 45 [2018-01-21 00:30:47,248 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:30:47,250 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:30:47,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:30:47,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:30:47,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:30:47,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:30:47,270 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2018-01-21 00:30:47,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:47,270 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:30:47,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:30:47,270 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:30:47,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:30:47,272 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:30:47,273 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:30:47,273 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:30:47,273 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:30:47,273 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:30:47,273 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:30:47,273 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:30:47,273 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:30:47,273 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:30:47,274 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-01-21 00:30:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 00:30:47,275 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:47,275 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:30:47,275 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:30:47,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1554819341, now seen corresponding path program 1 times [2018-01-21 00:30:47,275 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:47,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:47,276 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:47,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:47,277 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:47,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:47,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:30:47,315 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:47,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:30:47,315 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:47,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:30:47,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:30:47,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:30:47,316 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-01-21 00:30:47,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:47,320 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-01-21 00:30:47,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:30:47,320 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-01-21 00:30:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:47,323 INFO L225 Difference]: With dead ends: 45 [2018-01-21 00:30:47,323 INFO L226 Difference]: Without dead ends: 29 [2018-01-21 00:30:47,323 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:30:47,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-01-21 00:30:47,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-01-21 00:30:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-01-21 00:30:47,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-01-21 00:30:47,332 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 23 [2018-01-21 00:30:47,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:47,332 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-01-21 00:30:47,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:30:47,332 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-01-21 00:30:47,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 00:30:47,333 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:47,334 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:30:47,334 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:30:47,334 INFO L82 PathProgramCache]: Analyzing trace with hash -637658528, now seen corresponding path program 1 times [2018-01-21 00:30:47,334 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:47,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:47,335 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:47,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:47,335 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:47,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:30:47,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:47,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:30:47,567 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:47,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:30:47,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:30:47,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:30:47,570 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 6 states. [2018-01-21 00:30:47,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:47,712 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2018-01-21 00:30:47,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 00:30:47,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-21 00:30:47,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:47,716 INFO L225 Difference]: With dead ends: 68 [2018-01-21 00:30:47,716 INFO L226 Difference]: Without dead ends: 61 [2018-01-21 00:30:47,717 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-21 00:30:47,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-21 00:30:47,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 44. [2018-01-21 00:30:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-21 00:30:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-01-21 00:30:47,732 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 25 [2018-01-21 00:30:47,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:47,732 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-01-21 00:30:47,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:30:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-01-21 00:30:47,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 00:30:47,734 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:47,734 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:30:47,734 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:30:47,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1663164062, now seen corresponding path program 1 times [2018-01-21 00:30:47,734 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:47,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:47,735 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:47,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:47,735 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:47,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:47,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:30:47,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:47,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-21 00:30:47,920 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:47,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-21 00:30:47,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-21 00:30:47,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-21 00:30:47,921 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 7 states. [2018-01-21 00:30:48,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:48,080 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-01-21 00:30:48,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 00:30:48,081 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-01-21 00:30:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:48,082 INFO L225 Difference]: With dead ends: 63 [2018-01-21 00:30:48,083 INFO L226 Difference]: Without dead ends: 42 [2018-01-21 00:30:48,083 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-01-21 00:30:48,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-21 00:30:48,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2018-01-21 00:30:48,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-21 00:30:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-01-21 00:30:48,089 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 25 [2018-01-21 00:30:48,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:48,089 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-01-21 00:30:48,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-21 00:30:48,089 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-01-21 00:30:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 00:30:48,090 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:48,090 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:30:48,091 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:30:48,091 INFO L82 PathProgramCache]: Analyzing trace with hash 2048961725, now seen corresponding path program 1 times [2018-01-21 00:30:48,091 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:48,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:48,092 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:48,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:48,093 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:30:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:30:48,142 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:30:48,149 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:48,152 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:48,153 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:48,153 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:48,163 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:30:48,163 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:30:48,163 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:30:48,164 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:30:48,164 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:30:48,164 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:30:48,164 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:30:48,164 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:30:48,164 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:30:48,165 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-01-21 00:30:48,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 00:30:48,165 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:48,166 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:30:48,166 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:30:48,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1267654414, now seen corresponding path program 1 times [2018-01-21 00:30:48,166 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:48,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:48,167 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:48,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:48,167 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:48,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:48,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:30:48,190 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:48,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:30:48,191 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:48,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:30:48,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:30:48,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:30:48,192 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-01-21 00:30:48,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:48,195 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-01-21 00:30:48,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:30:48,195 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-21 00:30:48,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:48,196 INFO L225 Difference]: With dead ends: 45 [2018-01-21 00:30:48,197 INFO L226 Difference]: Without dead ends: 27 [2018-01-21 00:30:48,197 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:30:48,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-01-21 00:30:48,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-01-21 00:30:48,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-01-21 00:30:48,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-01-21 00:30:48,200 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 21 [2018-01-21 00:30:48,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:48,201 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-01-21 00:30:48,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:30:48,201 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-01-21 00:30:48,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 00:30:48,202 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:48,202 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:30:48,202 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:30:48,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1560438341, now seen corresponding path program 1 times [2018-01-21 00:30:48,202 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:48,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:48,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:48,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:48,203 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:48,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:48,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:30:48,287 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:48,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:30:48,287 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:48,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:30:48,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:30:48,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:30:48,288 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 6 states. [2018-01-21 00:30:48,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:48,416 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-01-21 00:30:48,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 00:30:48,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-21 00:30:48,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:48,418 INFO L225 Difference]: With dead ends: 64 [2018-01-21 00:30:48,418 INFO L226 Difference]: Without dead ends: 59 [2018-01-21 00:30:48,419 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-21 00:30:48,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-21 00:30:48,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2018-01-21 00:30:48,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-21 00:30:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-01-21 00:30:48,428 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 23 [2018-01-21 00:30:48,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:48,429 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-01-21 00:30:48,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:30:48,429 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-01-21 00:30:48,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 00:30:48,430 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:48,430 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:30:48,430 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 00:30:48,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1713460601, now seen corresponding path program 1 times [2018-01-21 00:30:48,431 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:48,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:48,432 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:48,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:48,432 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:48,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:48,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:30:48,558 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:48,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:30:48,558 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:48,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 00:30:48,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 00:30:48,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:30:48,560 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 4 states. [2018-01-21 00:30:48,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:48,639 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-01-21 00:30:48,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:30:48,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-21 00:30:48,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:48,640 INFO L225 Difference]: With dead ends: 42 [2018-01-21 00:30:48,640 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:30:48,641 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-01-21 00:30:48,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:30:48,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:30:48,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:30:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:30:48,641 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-01-21 00:30:48,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:48,642 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:30:48,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 00:30:48,642 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:30:48,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:30:48,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:30:48 BoogieIcfgContainer [2018-01-21 00:30:48,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:30:48,645 INFO L168 Benchmark]: Toolchain (without parser) took 2242.31 ms. Allocated memory was 302.5 MB in the beginning and 460.8 MB in the end (delta: 158.3 MB). Free memory was 260.8 MB in the beginning and 321.4 MB in the end (delta: -60.5 MB). Peak memory consumption was 97.8 MB. Max. memory is 5.3 GB. [2018-01-21 00:30:48,646 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 302.5 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:30:48,647 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.80 ms. Allocated memory is still 302.5 MB. Free memory was 259.8 MB in the beginning and 249.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:30:48,647 INFO L168 Benchmark]: Boogie Preprocessor took 29.72 ms. Allocated memory is still 302.5 MB. Free memory was 249.8 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:30:48,647 INFO L168 Benchmark]: RCFGBuilder took 207.31 ms. Allocated memory is still 302.5 MB. Free memory was 247.8 MB in the beginning and 233.2 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-01-21 00:30:48,648 INFO L168 Benchmark]: TraceAbstraction took 1797.72 ms. Allocated memory was 302.5 MB in the beginning and 460.8 MB in the end (delta: 158.3 MB). Free memory was 233.2 MB in the beginning and 321.4 MB in the end (delta: -88.1 MB). Peak memory consumption was 70.2 MB. Max. memory is 5.3 GB. [2018-01-21 00:30:48,650 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 302.5 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 200.80 ms. Allocated memory is still 302.5 MB. Free memory was 259.8 MB in the beginning and 249.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.72 ms. Allocated memory is still 302.5 MB. Free memory was 249.8 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 207.31 ms. Allocated memory is still 302.5 MB. Free memory was 247.8 MB in the beginning and 233.2 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1797.72 ms. Allocated memory was 302.5 MB in the beginning and 460.8 MB in the end (delta: 158.3 MB). Free memory was 233.2 MB in the beginning and 321.4 MB in the end (delta: -88.1 MB). Peak memory consumption was 70.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 33 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 540]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: cstrnlenErr0EnsuresViolation CFG has 4 procedures, 33 locations, 4 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 225 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L549] int length1 = __VERIFIER_nondet_int(); [L550] int n = __VERIFIER_nondet_int(); [L551] COND TRUE length1 < 1 [L552] length1 = 1 VAL [length1=1, n=0] [L554] COND TRUE n < 1 [L555] n = 1 VAL [length1=1, n=1] [L557] EXPR, FCALL __builtin_alloca (length1 * sizeof(char)) VAL [__builtin_alloca (length1 * sizeof(char))={3:0}, length1=1, n=1] [L557] char* nondetString1 = (char*) __builtin_alloca (length1 * sizeof(char)); VAL [__builtin_alloca (length1 * sizeof(char))={3:0}, length1=1, n=1, nondetString1={3:0}] [L558] FCALL nondetString1[length1-1] = '\0' VAL [__builtin_alloca (length1 * sizeof(char))={3:0}, length1=1, n=1, nondetString1={3:0}] [L559] CALL, EXPR cstrnlen(nondetString1,n) VAL [\old(maxlen)=1, str={3:0}] [L543] const char *cp; [L544] cp = str VAL [\old(maxlen)=1, cp={3:0}, maxlen=1, str={3:0}, str={3:0}] [L544] maxlen != 0 && *cp != '\0' VAL [\old(maxlen)=1, cp={3:0}, maxlen=1, maxlen != 0 && *cp != '\0'=1, str={3:0}, str={3:0}] [L544] EXPR, FCALL \read(*cp) VAL [\old(maxlen)=1, \read(*cp)=0, cp={3:0}, maxlen=1, maxlen != 0 && *cp != '\0'=1, str={3:0}, str={3:0}] [L544] maxlen != 0 && *cp != '\0' VAL [\old(maxlen)=1, \read(*cp)=0, cp={3:0}, maxlen=1, maxlen != 0 && *cp != '\0'=0, str={3:0}, str={3:0}] [L544] COND FALSE !(maxlen != 0 && *cp != '\0') [L546] RET return (size_t)(cp - str); VAL [\old(maxlen)=1, \result=0, cp={3:0}, maxlen=1, str={3:0}, str={3:0}] [L559] EXPR cstrnlen(nondetString1,n) VAL [__builtin_alloca (length1 * sizeof(char))={3:0}, cstrnlen(nondetString1,n)=0, length1=1, n=1, nondetString1={3:0}] [L559] return cstrnlen(nondetString1,n); - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 33 locations, 4 error locations. UNSAFE Result, 0.8s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 102 SDtfs, 86 SDslu, 179 SDs, 0 SdLazy, 67 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 100 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 5236 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 33 locations, 4 error locations. SAFE Result, 0.4s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 93 SDtfs, 55 SDslu, 87 SDs, 0 SdLazy, 58 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 17 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 4382 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-30-48-660.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-30-48-660.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-30-48-660.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-30-48-660.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-30-48-660.csv Received shutdown request...