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/sum03.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b2fde6a [2018-09-28 11:45:08,401 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-28 11:45:08,403 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-28 11:45:08,426 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-28 11:45:08,427 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-28 11:45:08,428 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-28 11:45:08,429 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-28 11:45:08,432 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-28 11:45:08,434 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-28 11:45:08,434 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-28 11:45:08,435 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-28 11:45:08,436 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-28 11:45:08,437 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-28 11:45:08,437 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-28 11:45:08,439 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-28 11:45:08,439 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-28 11:45:08,440 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-28 11:45:08,442 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-28 11:45:08,444 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-28 11:45:08,445 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-28 11:45:08,446 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-28 11:45:08,448 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-28 11:45:08,450 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-28 11:45:08,450 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-28 11:45:08,451 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-28 11:45:08,451 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-28 11:45:08,452 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-28 11:45:08,453 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-28 11:45:08,454 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-28 11:45:08,455 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-28 11:45:08,455 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-28 11:45:08,456 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-28 11:45:08,456 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-28 11:45:08,456 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-28 11:45:08,457 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-28 11:45:08,458 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-28 11:45:08,458 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-09-28 11:45:08,481 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-28 11:45:08,481 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-28 11:45:08,482 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-28 11:45:08,482 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-28 11:45:08,483 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-28 11:45:08,483 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-28 11:45:08,483 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-28 11:45:08,483 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-28 11:45:08,484 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-28 11:45:08,484 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-28 11:45:08,484 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-28 11:45:08,484 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-28 11:45:08,484 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-28 11:45:08,484 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-28 11:45:08,485 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-28 11:45:08,485 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-28 11:45:08,485 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-28 11:45:08,485 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-09-28 11:45:08,485 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-09-28 11:45:08,486 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-28 11:45:08,486 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-28 11:45:08,486 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-28 11:45:08,486 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-09-28 11:45:08,486 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-28 11:45:08,487 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-28 11:45:08,487 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-28 11:45:08,487 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-09-28 11:45:08,487 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-28 11:45:08,487 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-28 11:45:08,487 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-28 11:45:08,552 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-28 11:45:08,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-28 11:45:08,573 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-28 11:45:08,575 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-28 11:45:08,575 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-28 11:45:08,577 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum03.i_3.bpl [2018-09-28 11:45:08,577 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum03.i_3.bpl' [2018-09-28 11:45:08,632 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-28 11:45:08,636 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-28 11:45:08,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-28 11:45:08,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-28 11:45:08,637 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-28 11:45:08,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 11:45:08" (1/1) ... [2018-09-28 11:45:08,670 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 11:45:08" (1/1) ... [2018-09-28 11:45:08,677 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-28 11:45:08,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-28 11:45:08,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-28 11:45:08,679 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-28 11:45:08,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 11:45:08" (1/1) ... [2018-09-28 11:45:08,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 11:45:08" (1/1) ... [2018-09-28 11:45:08,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 11:45:08" (1/1) ... [2018-09-28 11:45:08,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 11:45:08" (1/1) ... [2018-09-28 11:45:08,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 11:45:08" (1/1) ... [2018-09-28 11:45:08,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 11:45:08" (1/1) ... [2018-09-28 11:45:08,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 11:45:08" (1/1) ... [2018-09-28 11:45:08,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-28 11:45:08,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-28 11:45:08,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-28 11:45:08,701 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-28 11:45:08,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 11:45:08" (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-09-28 11:45:08,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-28 11:45:08,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-28 11:45:09,139 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-28 11:45:09,141 INFO L202 PluginConnector]: Adding new model sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 11:45:09 BoogieIcfgContainer [2018-09-28 11:45:09,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-28 11:45:09,143 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-09-28 11:45:09,143 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-09-28 11:45:09,171 INFO L276 PluginConnector]: CodeCheck initialized [2018-09-28 11:45:09,171 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 11:45:09" (1/1) ... [2018-09-28 11:45:09,195 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 11:45:09,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-28 11:45:09,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-28 11:45:09,265 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-28 11:45:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-28 11:45:09,268 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-28 11:45:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 11:45:09,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 11:45:09,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-28 11:45:09,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 7 states and 10 transitions. [2018-09-28 11:45:09,876 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 10 transitions. [2018-09-28 11:45:09,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-28 11:45:09,876 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-28 11:45:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 11:45:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 11:45:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-28 11:45:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 9 states and 10 transitions. [2018-09-28 11:45:11,536 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-09-28 11:45:11,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-28 11:45:11,537 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-28 11:45:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 11:45:11,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 11:45:12,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-28 11:45:12,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 11 states and 12 transitions. [2018-09-28 11:45:12,379 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-09-28 11:45:12,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-28 11:45:12,380 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-28 11:45:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 11:45:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 11:45:14,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-28 11:45:14,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 13 states and 14 transitions. [2018-09-28 11:45:14,551 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-09-28 11:45:14,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-28 11:45:14,553 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-28 11:45:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 11:45:15,138 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 11:45:15,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-28 11:45:15,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 15 states and 16 transitions. [2018-09-28 11:45:15,980 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-09-28 11:45:15,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-28 11:45:15,981 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-28 11:45:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 11:45:16,303 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 11:45:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-28 11:45:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 17 states and 18 transitions. [2018-09-28 11:45:18,134 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-09-28 11:45:18,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-28 11:45:18,135 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-28 11:45:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 11:45:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 11:45:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-28 11:45:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 19 states and 20 transitions. [2018-09-28 11:45:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-09-28 11:45:20,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-28 11:45:20,279 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-28 11:45:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 11:45:21,315 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 11:45:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-28 11:45:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 21 states and 22 transitions. [2018-09-28 11:45:23,525 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-09-28 11:45:23,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-28 11:45:23,526 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-28 11:45:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 11:45:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 11:45:27,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-28 11:45:27,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 23 states and 24 transitions. [2018-09-28 11:45:27,126 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-09-28 11:45:27,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-28 11:45:27,127 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-28 11:45:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 11:45:28,256 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 11:45:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-28 11:45:29,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 25 states and 26 transitions. [2018-09-28 11:45:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-09-28 11:45:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-28 11:45:29,663 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-28 11:45:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-28 11:45:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-28 11:45:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-28 11:45:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-28 11:45:29,866 WARN L491 CodeCheckObserver]: This program is UNSAFE, Check terminated with 0 iterations. [2018-09-28 11:45:29,907 INFO L202 PluginConnector]: Adding new model sum03.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 28.09 11:45:29 ImpRootNode [2018-09-28 11:45:29,907 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-09-28 11:45:29,915 INFO L168 Benchmark]: Toolchain (without parser) took 21282.40 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 105.4 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 320.4 MB). Peak memory consumption was 425.8 MB. Max. memory is 7.1 GB. [2018-09-28 11:45:29,919 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 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-09-28 11:45:29,919 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.36 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-09-28 11:45:29,920 INFO L168 Benchmark]: Boogie Preprocessor took 21.63 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-09-28 11:45:29,922 INFO L168 Benchmark]: RCFGBuilder took 441.40 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-09-28 11:45:29,924 INFO L168 Benchmark]: CodeCheck took 20771.85 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 105.4 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 299.3 MB). Peak memory consumption was 404.7 MB. Max. memory is 7.1 GB. [2018-09-28 11:45:29,931 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, 20.6s OverallTime, 11 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 512 SDtfs, 3066 SDslu, 1024 SDs, 0 SdLazy, 20488 SolverSat, 7162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 71818 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 0/330 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 - CounterExampleResult [Line: 54]: assertion can be violated assertion can be violated We found a FailurePath: [L14] havoc main_#res; [L15] havoc main_#t~nondet0, main_#t~nondet1, main_#t~post2, main_~sn~5, main_~loop1~5, main_~n1~5, main_~x~5; [L16] main_~sn~5 := 0; [L17] main_~loop1~5 := main_#t~nondet0; [L18] havoc main_#t~nondet0; [L19] main_~n1~5 := main_#t~nondet1; [L20] havoc main_#t~nondet1; [L21] main_~x~5 := 0; VAL [main_~sn~5=0, main_~x~5=0] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=2, main_~x~5=1] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=2, main_~x~5=1] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=4, main_~x~5=2] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=4, main_~x~5=2] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=6, main_~x~5=3] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=6, main_~x~5=3] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=8, main_~x~5=4] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=8, main_~x~5=4] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=10, main_~x~5=5] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=10, main_~x~5=5] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=12, main_~x~5=6] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=12, main_~x~5=6] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=14, main_~x~5=7] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=14, main_~x~5=7] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=16, main_~x~5=8] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=16, main_~x~5=8] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=18, main_~x~5=9] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=18, main_~x~5=9] [L24] assume true; [L25] assume !false; [L30] assume main_~x~5 % 4294967296 < 10; [L31] main_~sn~5 := main_~sn~5 + 2; [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=20, main_~x~5=10] [L51] assume !(__VERIFIER_assert_~cond == 0); VAL [__VERIFIER_assert_#in~cond=1, __VERIFIER_assert_~cond=1, main_~sn~5=20, main_~x~5=10] [L24] assume true; [L25] assume !false; [L34] assume !(main_~x~5 % 4294967296 < 10); [L37] main_#t~post2 := main_~x~5; [L38] main_~x~5 := main_#t~post2 + 1; [L39] havoc main_#t~post2; [L40] __VERIFIER_assert_#in~cond := (if main_~sn~5 % 4294967296 == main_~x~5 * 2 % 4294967296 || main_~sn~5 == 0 then 1 else 0); [L41] havoc __VERIFIER_assert_~cond; [L42] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~sn~5=20, main_~x~5=11] [L47] assume __VERIFIER_assert_~cond == 0; [L48] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~sn~5=20, main_~x~5=11] [L54] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~sn~5=20, main_~x~5=11] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25 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.36 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 21.63 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 441.40 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 20771.85 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 105.4 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 299.3 MB). Peak memory consumption was 404.7 MB. Max. memory is 7.1 GB. RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sum03.i_3.bpl_svcomp-Reach-32bit-Kojak_Default_PUPT.epf_KojakBplInline.xml/Csv-CodeCheckBenchmarks-0-2018-09-28_11-45-29-953.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sum03.i_3.bpl_svcomp-Reach-32bit-Kojak_Default_PUPT.epf_KojakBplInline.xml/Csv-Benchmark-0-2018-09-28_11-45-29-953.csv Received shutdown request...