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-00a8621 [2018-09-30 11:49:41,601 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 11:49:41,605 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 11:49:41,619 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 11:49:41,619 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 11:49:41,620 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 11:49:41,621 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 11:49:41,623 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 11:49:41,625 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 11:49:41,626 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 11:49:41,627 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 11:49:41,627 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 11:49:41,628 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 11:49:41,629 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 11:49:41,630 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 11:49:41,630 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 11:49:41,631 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 11:49:41,633 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 11:49:41,635 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 11:49:41,637 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 11:49:41,638 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 11:49:41,639 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 11:49:41,641 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 11:49:41,642 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 11:49:41,642 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 11:49:41,643 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 11:49:41,644 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 11:49:41,644 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 11:49:41,645 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 11:49:41,646 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 11:49:41,647 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 11:49:41,647 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 11:49:41,647 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 11:49:41,648 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 11:49:41,649 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 11:49:41,649 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 11:49:41,650 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 11:49:41,665 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 11:49:41,666 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 11:49:41,666 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 11:49:41,667 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 11:49:41,667 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 11:49:41,667 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 11:49:41,668 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 11:49:41,668 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 11:49:41,668 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 11:49:41,668 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 11:49:41,668 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 11:49:41,668 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 11:49:41,669 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 11:49:41,669 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 11:49:41,669 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 11:49:41,669 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 11:49:41,669 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 11:49:41,670 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-09-30 11:49:41,670 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-09-30 11:49:41,670 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 11:49:41,670 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 11:49:41,670 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 11:49:41,671 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-09-30 11:49:41,671 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 11:49:41,671 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 11:49:41,671 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 11:49:41,671 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-09-30 11:49:41,672 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 11:49:41,672 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 11:49:41,672 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 11:49:41,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 11:49:41,740 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 11:49:41,744 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 11:49:41,745 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 11:49:41,746 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 11:49:41,747 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 11:49:41,747 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 11:49:41,794 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 11:49:41,797 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 11:49:41,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 11:49:41,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 11:49:41,798 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 11:49:41,818 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 11:49:41" (1/1) ... [2018-09-30 11:49:41,830 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 11:49:41" (1/1) ... [2018-09-30 11:49:41,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 11:49:41,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 11:49:41,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 11:49:41,838 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 11:49:41,848 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 11:49:41" (1/1) ... [2018-09-30 11:49:41,849 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 11:49:41" (1/1) ... [2018-09-30 11:49:41,850 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 11:49:41" (1/1) ... [2018-09-30 11:49:41,850 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 11:49:41" (1/1) ... [2018-09-30 11:49:41,853 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 11:49:41" (1/1) ... [2018-09-30 11:49:41,855 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 11:49:41" (1/1) ... [2018-09-30 11:49:41,856 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 11:49:41" (1/1) ... [2018-09-30 11:49:41,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 11:49:41,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 11:49:41,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 11:49:41,858 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 11:49:41,859 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 11:49:41" (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 11:49:41,924 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-09-30 11:49:41,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 11:49:41,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 11:49:42,155 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 11:49:42,155 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 11:49:42 BoogieIcfgContainer [2018-09-30 11:49:42,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 11:49:42,156 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-09-30 11:49:42,156 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-09-30 11:49:42,167 INFO L276 PluginConnector]: CodeCheck initialized [2018-09-30 11:49:42,168 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 11:49:42" (1/1) ... [2018-09-30 11:49:42,181 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 11:49:42,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 11:49:42,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-30 11:49:42,216 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-30 11:49:42,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-30 11:49:42,219 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 11:49:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 11:49:42,348 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 11:49:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 11:49:42,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-30 11:49:42,648 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-30 11:49:42,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 11:49:42,649 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 11:49:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 11:49:42,707 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 11:49:43,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 11:49:43,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-30 11:49:43,080 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-30 11:49:43,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 11:49:43,080 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 11:49:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 11:49:43,232 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 11:49:43,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 11:49:43,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-30 11:49:43,604 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-30 11:49:43,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-30 11:49:43,605 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 11:49:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 11:49:43,700 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 11:49:43,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 11:49:43,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-30 11:49:43,953 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-30 11:49:43,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 11:49:43,954 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 11:49:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 11:49:44,041 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 11:49:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 11:49:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-30 11:49:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-30 11:49:44,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 11:49:44,762 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 11:49:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 11:49:44,871 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 11:49:45,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 11:49:45,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-30 11:49:45,092 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-30 11:49:45,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 11:49:45,092 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 11:49:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 11:49:45,193 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 11:49:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 11:49:45,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-30 11:49:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-30 11:49:45,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 11:49:45,439 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 11:49:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 11:49:45,544 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 11:49:45,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-09-30 11:49:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 12 states and 11 transitions. [2018-09-30 11:49:45,907 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2018-09-30 11:49:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 11:49:45,908 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2018-09-30 11:49:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-30 11:49:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-30 11:49:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-30 11:49:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-30 11:49:46,115 WARN L491 CodeCheckObserver]: This program is UNSAFE, Check terminated with 0 iterations. [2018-09-30 11:49:46,154 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 11:49:46 ImpRootNode [2018-09-30 11:49:46,155 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-09-30 11:49:46,156 INFO L168 Benchmark]: Toolchain (without parser) took 4361.69 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: 179.8 MB). Peak memory consumption was 179.8 MB. Max. memory is 7.1 GB. [2018-09-30 11:49:46,158 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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 11:49:46,159 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.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 11:49:46,160 INFO L168 Benchmark]: Boogie Preprocessor took 19.86 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 11:49:46,160 INFO L168 Benchmark]: RCFGBuilder took 297.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 11:49:46,161 INFO L168 Benchmark]: CodeCheck took 3998.99 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: 158.6 MB). Peak memory consumption was 158.6 MB. Max. memory is 7.1 GB. [2018-09-30 11:49:46,166 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.9s 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.6s 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.20 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 39.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. * Boogie Preprocessor took 19.86 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 297.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * CodeCheck took 3998.99 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: 158.6 MB). Peak memory consumption was 158.6 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_11-49-46-181.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_11-49-46-181.csv Received shutdown request...