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_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 13:47:22,350 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 13:47:22,352 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 13:47:22,367 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 13:47:22,368 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 13:47:22,369 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 13:47:22,370 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 13:47:22,372 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 13:47:22,374 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 13:47:22,376 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 13:47:22,377 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 13:47:22,378 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 13:47:22,378 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 13:47:22,379 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 13:47:22,381 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 13:47:22,381 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 13:47:22,382 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 13:47:22,384 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 13:47:22,386 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 13:47:22,387 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 13:47:22,389 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 13:47:22,390 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 13:47:22,392 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 13:47:22,393 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 13:47:22,393 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 13:47:22,394 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 13:47:22,395 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 13:47:22,396 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 13:47:22,396 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 13:47:22,398 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 13:47:22,398 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 13:47:22,399 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 13:47:22,399 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 13:47:22,399 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 13:47:22,400 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 13:47:22,401 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 13:47:22,401 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Kojak_Default_PUPT.epf [2018-10-04 13:47:22,422 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 13:47:22,423 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 13:47:22,428 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 13:47:22,428 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 13:47:22,429 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 13:47:22,429 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 13:47:22,429 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 13:47:22,429 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 13:47:22,430 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 13:47:22,430 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 13:47:22,430 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 13:47:22,430 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 13:47:22,430 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 13:47:22,431 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 13:47:22,431 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 13:47:22,431 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 13:47:22,431 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 13:47:22,431 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-04 13:47:22,432 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-04 13:47:22,432 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 13:47:22,432 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 13:47:22,432 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 13:47:22,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-04 13:47:22,433 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 13:47:22,433 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 13:47:22,433 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 13:47:22,433 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-04 13:47:22,433 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 13:47:22,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 13:47:22,434 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 13:47:22,486 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 13:47:22,498 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 13:47:22,502 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 13:47:22,503 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 13:47:22,504 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 13:47:22,505 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl [2018-10-04 13:47:22,505 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl' [2018-10-04 13:47:22,579 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 13:47:22,581 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 13:47:22,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 13:47:22,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 13:47:22,582 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 13:47:22,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:47:22" (1/1) ... [2018-10-04 13:47:22,617 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:47:22" (1/1) ... [2018-10-04 13:47:22,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 13:47:22,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 13:47:22,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 13:47:22,624 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 13:47:22,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:47:22" (1/1) ... [2018-10-04 13:47:22,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:47:22" (1/1) ... [2018-10-04 13:47:22,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:47:22" (1/1) ... [2018-10-04 13:47:22,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:47:22" (1/1) ... [2018-10-04 13:47:22,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:47:22" (1/1) ... [2018-10-04 13:47:22,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:47:22" (1/1) ... [2018-10-04 13:47:22,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:47:22" (1/1) ... [2018-10-04 13:47:22,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 13:47:22,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 13:47:22,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 13:47:22,649 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 13:47:22,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:47:22" (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:47:22,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 13:47:22,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 13:47:23,022 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 13:47:23,023 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 01:47:23 BoogieIcfgContainer [2018-10-04 13:47:23,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 13:47:23,024 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-04 13:47:23,024 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-04 13:47:23,036 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-04 13:47:23,037 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 01:47:23" (1/1) ... [2018-10-04 13:47:23,055 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:47:23,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:47:23,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 13:47:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 13:47:23,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 13:47:23,102 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:47:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:47:23,257 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:47:23,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:47:23,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 13:47:23,532 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 13:47:23,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 13:47:23,533 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:47:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:47:23,614 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:47:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:47:23,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 13:47:23,987 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 13:47:23,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 13:47:23,988 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:47:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:47:24,184 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 13:47:24,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:47:24,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 13:47:24,747 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 13:47:24,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 13:47:24,748 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:47:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:47:24,819 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 13:47:25,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:47:25,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 13:47:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 13:47:25,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 13:47:25,071 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:47:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:47:25,433 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 13:47:25,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:47:25,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-04 13:47:25,924 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-04 13:47:25,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 13:47:25,925 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:47:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:47:26,017 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 13:47:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:47:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 13:47:26,773 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 13:47:26,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 13:47:26,774 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:47:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:47:26,937 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 13:47:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:47:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-04 13:47:27,712 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-04 13:47:27,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 13:47:27,713 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:47:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:47:27,967 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 13:47:28,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:47:28,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 13:47:28,232 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 13:47:28,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 13:47:28,232 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:47:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:47:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:47:28,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:47:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-04 13:47:28,639 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-04 13:47:28,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 13:47:28,640 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:47:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:47:28,753 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:47:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:47:29,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-04 13:47:29,125 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-04 13:47:29,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 13:47:29,126 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:47:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:47:29,326 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:47:29,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:47:29,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-04 13:47:29,735 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-04 13:47:29,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 13:47:29,736 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:47:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:47:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:47:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:47:30,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-04 13:47:30,217 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-04 13:47:30,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 13:47:30,218 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:47:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:47:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:47:30,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:47:30,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-04 13:47:30,958 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-04 13:47:30,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 13:47:30,959 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:47:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:47:31,105 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:47:31,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:47:31,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-04 13:47:31,560 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-04 13:47:31,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 13:47:31,561 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:47:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:47:31,768 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:47:32,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:47:32,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-04 13:47:32,358 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-04 13:47:32,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 13:47:32,359 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:47:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:47:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:47:33,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:47:33,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-04 13:47:33,052 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-04 13:47:33,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 13:47:33,053 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:47:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 13:47:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 13:47:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 13:47:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-04 13:47:33,166 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 17 iterations. [2018-10-04 13:47:33,209 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 04.10 01:47:33 ImpRootNode [2018-10-04 13:47:33,209 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-04 13:47:33,211 INFO L168 Benchmark]: Toolchain (without parser) took 10629.87 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 17.8 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 298.4 MB). Peak memory consumption was 316.3 MB. Max. memory is 7.1 GB. [2018-10-04 13:47:33,215 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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:47:33,217 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.30 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:47:33,217 INFO L168 Benchmark]: Boogie Preprocessor took 24.30 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:47:33,218 INFO L168 Benchmark]: RCFGBuilder took 375.29 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 13:47:33,219 INFO L168 Benchmark]: CodeCheck took 10184.91 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 17.8 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 277.3 MB). Peak memory consumption was 295.1 MB. Max. memory is 7.1 GB. [2018-10-04 13:47:33,227 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, 10.0s OverallTime, 17 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 98304 SDtfs, 196604 SDslu, 327672 SDs, 0 SdLazy, 491510 SolverSat, 294906 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1945 GetRequests, 1643 SyntacticMatches, 240 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 340 NumberOfCodeBlocks, 340 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 44080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1360 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: 61]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of bitwiseOr at line 48, overapproximation of bitwiseAnd at line 40. Possible FailurePath: [L19] havoc main_#res; [L20] havoc main_#t~nondet0, main_#t~nondet1, main_~x~5, main_~y~5, main_~xx~5, main_~yy~5, main_~zz~5, main_~z~5, main_~i~5; [L21] main_~x~5 := main_#t~nondet0; [L22] havoc main_#t~nondet0; [L23] main_~y~5 := main_#t~nondet1; [L24] havoc main_#t~nondet1; [L25] havoc main_~xx~5; [L26] havoc main_~yy~5; [L27] havoc main_~zz~5; [L28] main_~z~5 := 0; [L29] main_~i~5 := 0; VAL [main_~i~5=0, main_~z~5=0] [L32] assume true; VAL [main_~i~5=0, main_~z~5=0] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=1] [L32] assume true; VAL [main_~i~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=2] [L32] assume true; VAL [main_~i~5=2] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=3] [L32] assume true; VAL [main_~i~5=3] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=4] [L32] assume true; VAL [main_~i~5=4] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=5] [L32] assume true; VAL [main_~i~5=5] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=6] [L32] assume true; VAL [main_~i~5=6] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=7] [L32] assume true; VAL [main_~i~5=7] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=8] [L32] assume true; VAL [main_~i~5=8] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=9] [L32] assume true; VAL [main_~i~5=9] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=10] [L32] assume true; VAL [main_~i~5=10] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=11] [L32] assume true; VAL [main_~i~5=11] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=12] [L32] assume true; VAL [main_~i~5=12] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=13] [L32] assume true; VAL [main_~i~5=13] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=14] [L32] assume true; VAL [main_~i~5=14] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=15] [L32] assume true; VAL [main_~i~5=15] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=16] [L32] assume true; VAL [main_~i~5=16] [L37] assume !(main_~i~5 % 4294967296 < 16); [L38] main_~xx~5 := main_~x~5 % 65536; [L39] main_~yy~5 := main_~y~5 % 65536; [L40] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 8)), 16711935); [L41] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 4)), 252645135); [L42] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 2)), 858993459); [L43] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 1)), 1431655765); [L44] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 8)), 16711935); [L45] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 4)), 252645135); [L46] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 2)), 858993459); [L47] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 1)), 1431655765); [L48] main_~zz~5 := ~bitwiseOr(main_~xx~5, ~shiftLeft(main_~yy~5, 1)); [L49] __VERIFIER_assert_#in~cond := (if main_~z~5 % 4294967296 == main_~zz~5 % 4294967296 then 1 else 0); [L50] havoc __VERIFIER_assert_~cond; [L51] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L52] assume __VERIFIER_assert_~cond == 0; [L53] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~zz~5=1, main_~z~5=0] [L61] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~zz~5=1, main_~z~5=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 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 41.30 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 24.30 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 375.29 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * CodeCheck took 10184.91 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 17.8 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 277.3 MB). Peak memory consumption was 295.1 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/interleave_bits.i_3.bpl_svcomp-Reach-32bit-Kojak_Default_PUPT.epf_KojakBplInline.xml/Csv-CodeCheckBenchmarks-0-2018-10-04_13-47-33-247.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/interleave_bits.i_3.bpl_svcomp-Reach-32bit-Kojak_Default_PUPT.epf_KojakBplInline.xml/Csv-Benchmark-0-2018-10-04_13-47-33-247.csv Received shutdown request...