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/20170319-ConjunctivePathPrograms/num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 21:40:39,002 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 21:40:39,004 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 21:40:39,015 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 21:40:39,016 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 21:40:39,017 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 21:40:39,018 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 21:40:39,020 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 21:40:39,021 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 21:40:39,022 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 21:40:39,023 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 21:40:39,023 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 21:40:39,024 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 21:40:39,025 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 21:40:39,027 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 21:40:39,027 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 21:40:39,028 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 21:40:39,030 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 21:40:39,032 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 21:40:39,034 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 21:40:39,035 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 21:40:39,036 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 21:40:39,039 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 21:40:39,039 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 21:40:39,040 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 21:40:39,042 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 21:40:39,043 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 21:40:39,044 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 21:40:39,045 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 21:40:39,051 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 21:40:39,051 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 21:40:39,052 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 21:40:39,052 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 21:40:39,054 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 21:40:39,057 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 21:40:39,058 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 21:40:39,058 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-30 21:40:39,089 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 21:40:39,090 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 21:40:39,091 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 21:40:39,091 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 21:40:39,092 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 21:40:39,092 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 21:40:39,093 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 21:40:39,093 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 21:40:39,093 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 21:40:39,093 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 21:40:39,094 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 21:40:39,094 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 21:40:39,094 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 21:40:39,094 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 21:40:39,095 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 21:40:39,095 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 21:40:39,095 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 21:40:39,095 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-09-30 21:40:39,095 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-09-30 21:40:39,095 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 21:40:39,096 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 21:40:39,096 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 21:40:39,096 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-09-30 21:40:39,096 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 21:40:39,097 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 21:40:39,098 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 21:40:39,098 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-09-30 21:40:39,098 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 21:40:39,098 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 21:40:39,098 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 21:40:39,141 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 21:40:39,155 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 21:40:39,159 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 21:40:39,161 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 21:40:39,162 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 21:40:39,163 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl [2018-09-30 21:40:39,163 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl' [2018-09-30 21:40:39,224 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 21:40:39,227 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 21:40:39,228 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 21:40:39,230 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 21:40:39,230 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 21:40:39,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 09:40:39" (1/1) ... [2018-09-30 21:40:39,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 09:40:39" (1/1) ... [2018-09-30 21:40:39,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 21:40:39,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 21:40:39,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 21:40:39,274 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 21:40:39,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 09:40:39" (1/1) ... [2018-09-30 21:40:39,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 09:40:39" (1/1) ... [2018-09-30 21:40:39,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 09:40:39" (1/1) ... [2018-09-30 21:40:39,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 09:40:39" (1/1) ... [2018-09-30 21:40:39,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 09:40:39" (1/1) ... [2018-09-30 21:40:39,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 09:40:39" (1/1) ... [2018-09-30 21:40:39,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 09:40:39" (1/1) ... [2018-09-30 21:40:39,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 21:40:39,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 21:40:39,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 21:40:39,299 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 21:40:39,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 09:40:39" (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-30 21:40:39,379 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-09-30 21:40:39,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 21:40:39,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 21:40:39,616 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 21:40:39,617 INFO L202 PluginConnector]: Adding new model num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 09:40:39 BoogieIcfgContainer [2018-09-30 21:40:39,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 21:40:39,618 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-09-30 21:40:39,618 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-09-30 21:40:39,630 INFO L276 PluginConnector]: CodeCheck initialized [2018-09-30 21:40:39,630 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 09:40:39" (1/1) ... [2018-09-30 21:40:39,643 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 21:40:39,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 21:40:39,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-30 21:40:39,687 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-30 21:40:39,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-30 21:40:39,690 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 21:40:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 21:40:39,846 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-30 21:40:40,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 21:40:40,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-30 21:40:40,166 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-30 21:40:40,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 21:40:40,166 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 21:40:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 21:40:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 21:40:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 21:40:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-30 21:40:40,567 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-30 21:40:40,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 21:40:40,568 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 21:40:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 21:40:40,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 21:40:41,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 21:40:41,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-30 21:40:41,091 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-30 21:40:41,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-30 21:40:41,091 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 21:40:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 21:40:41,160 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-30 21:40:41,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 21:40:41,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-30 21:40:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-30 21:40:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 21:40:41,394 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 21:40:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 21:40:41,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 21:40:42,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 21:40:42,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-30 21:40:42,163 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-30 21:40:42,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 21:40:42,164 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 21:40:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 21:40:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 21:40:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 21:40:42,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-30 21:40:42,465 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-30 21:40:42,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 21:40:42,466 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 21:40:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 21:40:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 21:40:42,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 21:40:42,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-30 21:40:42,759 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-30 21:40:42,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 21:40:42,759 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 21:40:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 21:40:42,893 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 21:40:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 21:40:43,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 12 states and 11 transitions. [2018-09-30 21:40:43,121 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2018-09-30 21:40:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 21:40:43,121 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 21:40:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-30 21:40:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-30 21:40:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-30 21:40:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-30 21:40:43,271 WARN L491 CodeCheckObserver]: This program is UNSAFE, Check terminated with 0 iterations. [2018-09-30 21:40:43,321 INFO L202 PluginConnector]: Adding new model num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 30.09 09:40:43 ImpRootNode [2018-09-30 21:40:43,321 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-09-30 21:40:43,322 INFO L168 Benchmark]: Toolchain (without parser) took 4097.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 169.2 MB). Peak memory consumption was 169.2 MB. Max. memory is 7.1 GB. [2018-09-30 21:40:43,324 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-09-30 21:40:43,325 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.97 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-30 21:40:43,326 INFO L168 Benchmark]: Boogie Preprocessor took 24.28 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-30 21:40:43,326 INFO L168 Benchmark]: RCFGBuilder took 318.77 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-30 21:40:43,327 INFO L168 Benchmark]: CodeCheck took 3703.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.1 MB). Peak memory consumption was 148.1 MB. Max. memory is 7.1 GB. [2018-09-30 21:40:43,332 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, 6 locations, 1 error locations. UNSAFE Result, 3.6s OverallTime, 9 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 128 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 1526 SolverSat, 1530 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 764 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 0/84 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: 46]: assertion can be violated assertion can be violated We found a FailurePath: [L14] havoc main_#res; [L15] havoc main_~bit~5, main_~c~4, main_~x~4, main_~y~4, main_~i~5; [L16] havoc main_~x~4; [L17] havoc main_~y~4; [L18] havoc main_~c~4; [L19] main_~x~4 := 37; [L20] main_~y~4 := 0; [L21] main_~c~4 := 0; VAL [main_~c~4=0, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=513, main_~c~4=1, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=513, main_~c~4=2, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=513, main_~c~4=3, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=513, main_~c~4=4, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=513, main_~c~4=5, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=513, main_~c~4=6, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=513, main_~c~4=7, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=513, main_~c~4=8, main_~i~5=-730, main_~x~4=37, main_~y~4=38] [L28] assume !(main_~c~4 < 8) && main_~c~4 < 256; [L29] assume (((main_~y~4 < 256 && 0 <= main_~y~4) && 0 <= main_~x~4) && main_~x~4 < 256) && !(main_~x~4 == main_~y~4); [L30] __VERIFIER_assert_#in~cond := 0; [L31] havoc __VERIFIER_assert_~cond; [L32] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L33] assume __VERIFIER_assert_~cond == 0; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~5=513, main_~c~4=8, main_~i~5=-730, main_~x~4=37, main_~y~4=38] [L46] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~5=513, main_~c~4=8, main_~i~5=-730, main_~x~4=37, main_~y~4=38] * 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 44.97 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.28 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 318.77 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 3703.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.1 MB). Peak memory consumption was 148.1 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/num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl_svcomp-Reach-32bit-Kojak_Default_PUPT.epf_KojakBplInline.xml/Csv-CodeCheckBenchmarks-0-2018-09-30_21-40-43-345.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl_svcomp-Reach-32bit-Kojak_Default_PUPT.epf_KojakBplInline.xml/Csv-Benchmark-0-2018-09-30_21-40-43-345.csv Received shutdown request...