java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/KojakBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Kojak_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/string.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 13:24:27,650 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 13:24:27,652 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 13:24:27,668 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 13:24:27,668 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 13:24:27,669 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 13:24:27,670 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 13:24:27,672 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 13:24:27,674 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 13:24:27,675 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 13:24:27,676 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 13:24:27,676 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 13:24:27,677 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 13:24:27,678 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 13:24:27,679 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 13:24:27,680 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 13:24:27,681 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 13:24:27,683 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 13:24:27,685 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 13:24:27,686 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 13:24:27,687 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 13:24:27,688 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 13:24:27,691 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 13:24:27,691 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 13:24:27,691 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 13:24:27,692 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 13:24:27,693 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 13:24:27,694 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 13:24:27,695 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 13:24:27,696 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 13:24:27,696 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 13:24:27,697 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 13:24:27,697 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 13:24:27,698 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 13:24:27,699 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 13:24:27,699 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 13:24:27,700 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-04 13:24:27,727 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 13:24:27,727 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 13:24:27,728 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 13:24:27,728 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 13:24:27,729 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 13:24:27,729 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 13:24:27,729 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 13:24:27,729 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 13:24:27,729 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 13:24:27,730 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 13:24:27,730 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 13:24:27,730 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 13:24:27,730 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 13:24:27,730 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 13:24:27,731 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 13:24:27,731 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 13:24:27,731 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 13:24:27,731 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-04 13:24:27,731 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-04 13:24:27,732 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 13:24:27,732 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 13:24:27,732 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-04 13:24:27,732 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 13:24:27,733 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 13:24:27,733 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 13:24:27,733 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-04 13:24:27,733 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 13:24:27,733 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 13:24:27,733 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 13:24:27,779 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 13:24:27,796 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 13:24:27,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 13:24:27,804 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 13:24:27,805 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 13:24:27,806 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string.i_3.bpl [2018-10-04 13:24:27,806 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string.i_3.bpl' [2018-10-04 13:24:27,868 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 13:24:27,870 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 13:24:27,871 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 13:24:27,871 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 13:24:27,871 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 13:24:27,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:24:27" (1/1) ... [2018-10-04 13:24:27,907 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:24:27" (1/1) ... [2018-10-04 13:24:27,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 13:24:27,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 13:24:27,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 13:24:27,916 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 13:24:27,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:24:27" (1/1) ... [2018-10-04 13:24:27,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:24:27" (1/1) ... [2018-10-04 13:24:27,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:24:27" (1/1) ... [2018-10-04 13:24:27,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:24:27" (1/1) ... [2018-10-04 13:24:27,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:24:27" (1/1) ... [2018-10-04 13:24:27,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:24:27" (1/1) ... [2018-10-04 13:24:27,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:24:27" (1/1) ... [2018-10-04 13:24:27,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 13:24:27,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 13:24:27,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 13:24:27,940 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 13:24:27,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:24:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-10-04 13:24:28,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 13:24:28,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 13:24:28,358 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 13:24:28,358 INFO L202 PluginConnector]: Adding new model string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 01:24:28 BoogieIcfgContainer [2018-10-04 13:24:28,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 13:24:28,360 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-04 13:24:28,360 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-04 13:24:28,372 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-04 13:24:28,372 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 01:24:28" (1/1) ... [2018-10-04 13:24:28,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 13:24:28,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:24:28,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 8 states and 9 transitions. [2018-10-04 13:24:28,424 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-10-04 13:24:28,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 13:24:28,426 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:24:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:24:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:24:28,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:24:28,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 9 states and 11 transitions. [2018-10-04 13:24:28,772 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-10-04 13:24:28,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 13:24:28,772 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:24:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:24:28,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:24:28,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:24:28,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 11 states and 13 transitions. [2018-10-04 13:24:28,974 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-10-04 13:24:28,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 13:24:28,974 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:24:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:24:29,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 13:24:29,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:24:29,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 13 states and 16 transitions. [2018-10-04 13:24:29,106 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2018-10-04 13:24:29,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 13:24:29,106 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:24:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:24:29,157 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 13:24:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:24:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 15 states and 18 transitions. [2018-10-04 13:24:29,245 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2018-10-04 13:24:29,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 13:24:29,246 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:24:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:24:29,338 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 13:24:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:24:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 17 states and 20 transitions. [2018-10-04 13:24:29,631 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2018-10-04 13:24:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 13:24:29,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:24:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:24:29,806 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 13:24:29,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:24:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 19 states and 22 transitions. [2018-10-04 13:24:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-10-04 13:24:29,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 13:24:29,989 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:24:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:24:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 13:24:30,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:24:30,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 21 states and 23 transitions. [2018-10-04 13:24:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-10-04 13:24:30,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 13:24:30,249 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:24:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:24:30,314 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-04 13:24:30,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:24:30,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 23 states and 25 transitions. [2018-10-04 13:24:30,385 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-10-04 13:24:30,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 13:24:30,386 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:24:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:24:30,424 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-04 13:24:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:24:30,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 25 states and 27 transitions. [2018-10-04 13:24:30,459 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-10-04 13:24:30,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 13:24:30,461 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:24:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:24:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-04 13:24:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:24:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 27 states and 28 transitions. [2018-10-04 13:24:30,581 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-10-04 13:24:30,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 13:24:30,582 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:24:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 13:24:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 13:24:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 13:24:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 13:24:30,799 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 11 iterations. [2018-10-04 13:24:30,848 INFO L202 PluginConnector]: Adding new model string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 04.10 01:24:30 ImpRootNode [2018-10-04 13:24:30,849 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-04 13:24:30,850 INFO L168 Benchmark]: Toolchain (without parser) took 2981.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-10-04 13:24:30,853 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 13:24:30,854 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.66 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 13:24:30,854 INFO L168 Benchmark]: Boogie Preprocessor took 23.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 13:24:30,855 INFO L168 Benchmark]: RCFGBuilder took 419.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 13:24:30,856 INFO L168 Benchmark]: CodeCheck took 2489.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-04 13:24:30,861 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 9 locations, 1 error locations. UNSAFE Result, 2.4s OverallTime, 11 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3584 SDtfs, 3068 SDslu, 4600 SDs, 0 SdLazy, 9188 SolverSat, 4620 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 959 GetRequests, 901 SyntacticMatches, 40 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 4250 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 120/200 InterpolantCoveringCapability, 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, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - UnprovableResult [Line: 89]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of shiftLeft at line 72. Possible FailurePath: [L23] havoc main_#res; [L24] havoc main_#t~nondet1, main_#t~post0, main_#t~nondet3, main_#t~post2, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_~string_A~5, main_~string_B~5, main_~i~5, main_~j~5, main_~nc_A~5, main_~nc_B~5, main_~found~5; [L25] havoc main_~string_A~5; [L26] havoc main_~string_B~5; [L27] havoc main_~i~5; [L28] havoc main_~j~5; [L29] havoc main_~nc_A~5; [L30] havoc main_~nc_B~5; [L31] main_~found~5 := 0; [L32] main_~i~5 := 0; VAL [main_~found~5=0, main_~i~5=0] [L35] assume true; VAL [main_~found~5=0, main_~i~5=0] [L45] assume !!(main_~i~5 < 5); [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; [L48] havoc main_#t~nondet1; [L49] main_#t~post0 := main_~i~5; [L50] main_~i~5 := main_#t~post0 + 1; [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=1] [L35] assume true; VAL [main_~found~5=0, main_~i~5=1] [L45] assume !!(main_~i~5 < 5); [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; [L48] havoc main_#t~nondet1; [L49] main_#t~post0 := main_~i~5; [L50] main_~i~5 := main_#t~post0 + 1; [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=2] [L35] assume true; VAL [main_~found~5=0, main_~i~5=2] [L45] assume !!(main_~i~5 < 5); [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; [L48] havoc main_#t~nondet1; [L49] main_#t~post0 := main_~i~5; [L50] main_~i~5 := main_#t~post0 + 1; [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=3] [L35] assume true; VAL [main_~found~5=0, main_~i~5=3] [L45] assume !!(main_~i~5 < 5); [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; [L48] havoc main_#t~nondet1; [L49] main_#t~post0 := main_~i~5; [L50] main_~i~5 := main_#t~post0 + 1; [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=4] [L35] assume true; VAL [main_~found~5=0, main_~i~5=4] [L45] assume !!(main_~i~5 < 5); [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; [L48] havoc main_#t~nondet1; [L49] main_#t~post0 := main_~i~5; [L50] main_~i~5 := main_#t~post0 + 1; [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=5] [L35] assume true; VAL [main_~found~5=0, main_~i~5=5] [L40] assume !(main_~i~5 < 5); [L41] assume !!(main_~string_A~5[4] == 0); [L42] main_~i~5 := 0; VAL [main_~found~5=0, main_~i~5=0] [L54] assume true; VAL [main_~found~5=0, main_~i~5=0] [L80] assume !!(main_~i~5 < 5); [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; [L83] havoc main_#t~nondet3; [L84] main_#t~post2 := main_~i~5; [L85] main_~i~5 := main_#t~post2 + 1; [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=1] [L54] assume true; VAL [main_~found~5=0, main_~i~5=1] [L80] assume !!(main_~i~5 < 5); [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; [L83] havoc main_#t~nondet3; [L84] main_#t~post2 := main_~i~5; [L85] main_~i~5 := main_#t~post2 + 1; [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=2] [L54] assume true; VAL [main_~found~5=0, main_~i~5=2] [L80] assume !!(main_~i~5 < 5); [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; [L83] havoc main_#t~nondet3; [L84] main_#t~post2 := main_~i~5; [L85] main_~i~5 := main_#t~post2 + 1; [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=3] [L54] assume true; VAL [main_~found~5=0, main_~i~5=3] [L80] assume !!(main_~i~5 < 5); [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; [L83] havoc main_#t~nondet3; [L84] main_#t~post2 := main_~i~5; [L85] main_~i~5 := main_#t~post2 + 1; [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=4] [L54] assume true; VAL [main_~found~5=0, main_~i~5=4] [L80] assume !!(main_~i~5 < 5); [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; [L83] havoc main_#t~nondet3; [L84] main_#t~post2 := main_~i~5; [L85] main_~i~5 := main_#t~post2 + 1; [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=5] [L54] assume true; VAL [main_~found~5=0, main_~i~5=5] [L59] assume !(main_~i~5 < 5); [L60] assume !!(main_~string_B~5[4] == 0); [L61] main_~nc_A~5 := 0; [L62] assume true; [L63] assume !(main_~string_A~5[main_~nc_A~5] != 0); [L64] main_~nc_B~5 := 0; [L65] assume true; [L66] assume !(main_~string_B~5[main_~nc_B~5] != 0); [L67] assume !!(main_~nc_B~5 >= main_~nc_A~5); [L68] main_~j~5 := 0; [L69] main_~i~5 := main_~j~5; [L70] assume true; [L71] assume !(main_~i~5 < main_~nc_A~5 && main_~j~5 < main_~nc_B~5); [L72] main_~found~5 := ~shiftLeft((if main_~j~5 > main_~nc_B~5 - 1 then 1 else 0), main_~i~5); [L73] __VERIFIER_assert_#in~cond := (if main_~found~5 == 0 || main_~found~5 == 1 then 1 else 0); [L74] havoc __VERIFIER_assert_~cond; [L75] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L76] assume __VERIFIER_assert_~cond == 0; [L77] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~found~5=22, main_~i~5=0, main_~j~5=0, main_~nc_A~5=0, main_~nc_B~5=0] [L89] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~found~5=22, main_~i~5=0, main_~j~5=0, main_~nc_A~5=0, main_~nc_B~5=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.66 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 419.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * CodeCheck took 2489.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/string.i_3.bpl_svcomp-Reach-32bit-Kojak_Default.epf_KojakBplInline.xml/Csv-CodeCheckBenchmarks-0-2018-10-04_13-24-30-881.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/string.i_3.bpl_svcomp-Reach-32bit-Kojak_Default.epf_KojakBplInline.xml/Csv-Benchmark-0-2018-10-04_13-24-30-881.csv Received shutdown request...