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/num_conversion_2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 10:14:53,721 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 10:14:53,723 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 10:14:53,741 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 10:14:53,741 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 10:14:53,742 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 10:14:53,743 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 10:14:53,745 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 10:14:53,747 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 10:14:53,748 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 10:14:53,749 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 10:14:53,749 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 10:14:53,750 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 10:14:53,753 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 10:14:53,754 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 10:14:53,755 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 10:14:53,756 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 10:14:53,764 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 10:14:53,768 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 10:14:53,769 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 10:14:53,772 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 10:14:53,775 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 10:14:53,778 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 10:14:53,778 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 10:14:53,779 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 10:14:53,780 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 10:14:53,783 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 10:14:53,784 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 10:14:53,785 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 10:14:53,789 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 10:14:53,789 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 10:14:53,790 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 10:14:53,790 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 10:14:53,790 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 10:14:53,793 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 10:14:53,794 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 10:14:53,794 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 10:14:53,823 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 10:14:53,823 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 10:14:53,824 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 10:14:53,824 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 10:14:53,825 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 10:14:53,825 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 10:14:53,825 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 10:14:53,825 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 10:14:53,825 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 10:14:53,826 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 10:14:53,829 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 10:14:53,829 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 10:14:53,829 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 10:14:53,829 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 10:14:53,830 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 10:14:53,830 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 10:14:53,830 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 10:14:53,830 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-04 10:14:53,830 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-04 10:14:53,832 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 10:14:53,832 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 10:14:53,832 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-04 10:14:53,833 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 10:14:53,833 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 10:14:53,833 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 10:14:53,833 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-04 10:14:53,833 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 10:14:53,833 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 10:14:53,834 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 10:14:53,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 10:14:53,911 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 10:14:53,915 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 10:14:53,917 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 10:14:53,917 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 10:14:53,918 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_2.i_3.bpl [2018-10-04 10:14:53,918 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_2.i_3.bpl' [2018-10-04 10:14:53,965 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 10:14:53,967 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 10:14:53,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 10:14:53,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 10:14:53,968 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 10:14:53,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:14:53" (1/1) ... [2018-10-04 10:14:53,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:14:53" (1/1) ... [2018-10-04 10:14:54,004 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 10:14:54,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 10:14:54,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 10:14:54,005 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 10:14:54,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:14:53" (1/1) ... [2018-10-04 10:14:54,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:14:53" (1/1) ... [2018-10-04 10:14:54,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:14:53" (1/1) ... [2018-10-04 10:14:54,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:14:53" (1/1) ... [2018-10-04 10:14:54,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:14:53" (1/1) ... [2018-10-04 10:14:54,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:14:53" (1/1) ... [2018-10-04 10:14:54,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:14:53" (1/1) ... [2018-10-04 10:14:54,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 10:14:54,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 10:14:54,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 10:14:54,024 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 10:14:54,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:14:53" (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 10:14:54,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 10:14:54,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 10:14:54,392 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 10:14:54,393 INFO L202 PluginConnector]: Adding new model num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 10:14:54 BoogieIcfgContainer [2018-10-04 10:14:54,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 10:14:54,394 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-04 10:14:54,394 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-04 10:14:54,403 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-04 10:14:54,403 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 10:14:54" (1/1) ... [2018-10-04 10:14:54,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 10:14:54,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:14:54,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 10:14:54,454 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 10:14:54,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 10:14:54,457 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:14:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:14:54,626 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 10:14:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:14:54,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 10:14:54,854 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 10:14:54,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 10:14:54,855 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:14:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:14:54,935 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 10:14:55,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:14:55,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 9 states and 10 transitions. [2018-10-04 10:14:55,155 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-10-04 10:14:55,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 10:14:55,155 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:14:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:14:55,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 10:14:56,303 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-04 10:14:57,329 WARN L178 SmtUtils]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-04 10:14:57,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:14:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 11 states and 12 transitions. [2018-10-04 10:14:57,369 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-10-04 10:14:57,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 10:14:57,369 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:14:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:14:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 10:14:58,507 WARN L178 SmtUtils]: Spent 635.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-04 10:15:01,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:15:01,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 13 states and 14 transitions. [2018-10-04 10:15:01,430 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-10-04 10:15:01,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 10:15:01,430 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:15:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:15:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 10:15:06,533 WARN L178 SmtUtils]: Spent 1.28 s on a formula simplification that was a NOOP. DAG size: 33 [2018-10-04 10:15:13,288 WARN L178 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 34 [2018-10-04 10:15:13,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:15:13,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 15 states and 16 transitions. [2018-10-04 10:15:13,865 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-10-04 10:15:13,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 10:15:13,866 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:15:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:15:18,865 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 10:15:42,506 WARN L178 SmtUtils]: Spent 3.74 s on a formula simplification that was a NOOP. DAG size: 39 [2018-10-04 10:15:52,325 WARN L178 SmtUtils]: Spent 6.57 s on a formula simplification that was a NOOP. DAG size: 40 [2018-10-04 10:15:57,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:15:57,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 17 states and 18 transitions. [2018-10-04 10:15:57,731 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-10-04 10:15:57,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 10:15:57,732 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:15:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:15:59,940 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 10:16:17,125 WARN L178 SmtUtils]: Spent 3.88 s on a formula simplification that was a NOOP. DAG size: 45 [2018-10-04 10:16:38,708 WARN L178 SmtUtils]: Spent 5.26 s on a formula simplification that was a NOOP. DAG size: 46 [2018-10-04 10:16:40,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:16:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 19 states and 20 transitions. [2018-10-04 10:16:40,745 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-10-04 10:16:40,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 10:16:40,746 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:16:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:16:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 10:17:10,457 WARN L178 SmtUtils]: Spent 5.50 s on a formula simplification that was a NOOP. DAG size: 51 [2018-10-04 10:17:47,091 WARN L178 SmtUtils]: Spent 9.59 s on a formula simplification that was a NOOP. DAG size: 52 [2018-10-04 10:17:49,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:17:49,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 10:17:49,758 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 10:17:49,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 10:17:49,759 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:17:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 10:17:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 10:17:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 10:17:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 10:17:49,921 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 9 iterations. [2018-10-04 10:17:50,001 INFO L202 PluginConnector]: Adding new model num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 04.10 10:17:50 ImpRootNode [2018-10-04 10:17:50,001 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-04 10:17:50,006 INFO L168 Benchmark]: Toolchain (without parser) took 176039.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 211.5 MB). Peak memory consumption was 211.5 MB. Max. memory is 7.1 GB. [2018-10-04 10:17:50,007 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 10:17:50,008 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 10:17:50,009 INFO L168 Benchmark]: Boogie Preprocessor took 18.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 10:17:50,010 INFO L168 Benchmark]: RCFGBuilder took 369.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 10:17:50,014 INFO L168 Benchmark]: CodeCheck took 175607.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. [2018-10-04 10:17:50,025 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, 7 locations, 1 error locations. UNSAFE Result, 175.5s OverallTime, 9 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 384 SDtfs, 764 SDslu, 1272 SDs, 0 SdLazy, 2290 SolverSat, 1274 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 590 GetRequests, 504 SyntacticMatches, 56 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 161.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 17.5s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 9936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 0/168 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: 46]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of shiftLeft at line 39, overapproximation of bitwiseAnd at line 40. Possible FailurePath: [L15] havoc main_#res; [L16] havoc main_#t~nondet0, main_~i~6, main_~bit~6, main_~x~5, main_~y~5, main_~c~5; [L17] main_~x~5 := main_#t~nondet0; [L18] havoc main_#t~nondet0; [L19] havoc main_~y~5; [L20] havoc main_~c~5; [L21] main_~y~5 := 0; [L22] main_~c~5 := 0; VAL [main_~c~5=0, main_~y~5=0] [L25] assume true; VAL [main_~c~5=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=1, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=1, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=2, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=2, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=3, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=3, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=4, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=4, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=5, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=5, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=6, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=6, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=7, main_~i~6=0, main_~y~5=0] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=7, main_~i~6=0, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=8, main_~i~6=1, main_~y~5=1] [L25] assume true; VAL [main_~bit~6=1, main_~c~5=8, main_~i~6=1, main_~y~5=1] [L30] assume !(main_~c~5 % 256 < 8); [L31] __VERIFIER_assert_#in~cond := (if main_~x~5 % 256 == main_~y~5 % 256 then 1 else 0); [L32] havoc __VERIFIER_assert_~cond; [L33] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L34] assume __VERIFIER_assert_~cond == 0; [L35] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~6=1, main_~c~5=8, main_~i~6=1, main_~x~5=0, main_~y~5=1] [L46] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~6=1, main_~c~5=8, main_~i~6=1, main_~x~5=0, main_~y~5=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 18.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 369.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * CodeCheck took 175607.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 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/num_conversion_2.i_3.bpl_svcomp-Reach-32bit-Kojak_Default.epf_KojakBplInline.xml/Csv-CodeCheckBenchmarks-0-2018-10-04_10-17-50-051.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/num_conversion_2.i_3.bpl_svcomp-Reach-32bit-Kojak_Default.epf_KojakBplInline.xml/Csv-Benchmark-0-2018-10-04_10-17-50-051.csv Received shutdown request...