./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/sum04_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6a3f6882-7870-48a1-a1aa-7bc9ed4d5195/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6a3f6882-7870-48a1-a1aa-7bc9ed4d5195/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6a3f6882-7870-48a1-a1aa-7bc9ed4d5195/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6a3f6882-7870-48a1-a1aa-7bc9ed4d5195/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/loops/sum04_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6a3f6882-7870-48a1-a1aa-7bc9ed4d5195/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6a3f6882-7870-48a1-a1aa-7bc9ed4d5195/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aeade23d65797ff650f62ff8e383f015764d9ed2 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 02:49:15,545 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:49:15,546 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:49:15,554 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:49:15,554 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:49:15,555 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:49:15,555 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:49:15,557 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:49:15,558 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:49:15,558 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:49:15,559 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:49:15,559 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:49:15,560 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:49:15,560 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:49:15,561 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:49:15,562 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:49:15,562 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:49:15,563 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:49:15,565 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:49:15,566 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:49:15,566 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:49:15,567 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:49:15,569 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:49:15,569 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:49:15,569 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:49:15,570 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:49:15,571 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:49:15,571 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:49:15,572 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:49:15,573 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:49:15,573 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:49:15,573 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:49:15,573 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:49:15,573 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:49:15,574 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:49:15,575 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:49:15,575 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6a3f6882-7870-48a1-a1aa-7bc9ed4d5195/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 02:49:15,585 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:49:15,586 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:49:15,586 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:49:15,586 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 02:49:15,587 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:49:15,587 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:49:15,587 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:49:15,587 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:49:15,587 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:49:15,587 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:49:15,587 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:49:15,588 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:49:15,588 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:49:15,588 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:49:15,588 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:49:15,588 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:49:15,588 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:49:15,589 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:49:15,589 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 02:49:15,590 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 02:49:15,590 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:49:15,590 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:49:15,590 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 02:49:15,590 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:49:15,590 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:49:15,590 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:49:15,590 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 02:49:15,590 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:49:15,590 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:49:15,591 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_6a3f6882-7870-48a1-a1aa-7bc9ed4d5195/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aeade23d65797ff650f62ff8e383f015764d9ed2 [2018-11-23 02:49:15,615 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:49:15,623 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:49:15,625 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:49:15,626 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:49:15,626 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:49:15,627 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6a3f6882-7870-48a1-a1aa-7bc9ed4d5195/bin-2019/ukojak/../../sv-benchmarks/c/loops/sum04_false-unreach-call_true-termination.i [2018-11-23 02:49:15,663 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a3f6882-7870-48a1-a1aa-7bc9ed4d5195/bin-2019/ukojak/data/bce911fa4/f7232067b622411c81a2d452ce91df4a/FLAG54830b033 [2018-11-23 02:49:16,057 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:49:16,057 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6a3f6882-7870-48a1-a1aa-7bc9ed4d5195/sv-benchmarks/c/loops/sum04_false-unreach-call_true-termination.i [2018-11-23 02:49:16,061 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a3f6882-7870-48a1-a1aa-7bc9ed4d5195/bin-2019/ukojak/data/bce911fa4/f7232067b622411c81a2d452ce91df4a/FLAG54830b033 [2018-11-23 02:49:16,069 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6a3f6882-7870-48a1-a1aa-7bc9ed4d5195/bin-2019/ukojak/data/bce911fa4/f7232067b622411c81a2d452ce91df4a [2018-11-23 02:49:16,071 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:49:16,071 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:49:16,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:49:16,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:49:16,075 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:49:16,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:49:16" (1/1) ... [2018-11-23 02:49:16,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c93cfda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:16, skipping insertion in model container [2018-11-23 02:49:16,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:49:16" (1/1) ... [2018-11-23 02:49:16,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:49:16,095 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:49:16,191 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:49:16,194 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:49:16,202 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:49:16,210 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:49:16,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:16 WrapperNode [2018-11-23 02:49:16,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:49:16,211 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:49:16,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:49:16,211 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:49:16,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:16" (1/1) ... [2018-11-23 02:49:16,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:16" (1/1) ... [2018-11-23 02:49:16,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:49:16,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:49:16,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:49:16,237 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:49:16,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:16" (1/1) ... [2018-11-23 02:49:16,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:16" (1/1) ... [2018-11-23 02:49:16,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:16" (1/1) ... [2018-11-23 02:49:16,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:16" (1/1) ... [2018-11-23 02:49:16,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:16" (1/1) ... [2018-11-23 02:49:16,250 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:16" (1/1) ... [2018-11-23 02:49:16,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:16" (1/1) ... [2018-11-23 02:49:16,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:49:16,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:49:16,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:49:16,252 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:49:16,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:49:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a3f6882-7870-48a1-a1aa-7bc9ed4d5195/bin-2019/ukojak/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-11-23 02:49:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:49:16,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:49:16,488 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:49:16,488 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 02:49:16,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:49:16 BoogieIcfgContainer [2018-11-23 02:49:16,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:49:16,489 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 02:49:16,489 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 02:49:16,499 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 02:49:16,499 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:49:16" (1/1) ... [2018-11-23 02:49:16,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:49:16,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 8 transitions. [2018-11-23 02:49:16,541 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-11-23 02:49:16,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 02:49:16,544 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:16,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:49:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 8 states and 9 transitions. [2018-11-23 02:49:16,687 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-11-23 02:49:16,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 02:49:16,688 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:16,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:49:16,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:16,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 9 states and 10 transitions. [2018-11-23 02:49:16,760 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-11-23 02:49:16,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 02:49:16,760 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:16,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:49:16,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 10 states and 11 transitions. [2018-11-23 02:49:16,848 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2018-11-23 02:49:16,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 02:49:16,848 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:16,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:49:16,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:16,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 11 states and 12 transitions. [2018-11-23 02:49:16,938 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-11-23 02:49:16,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 02:49:16,939 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:16,990 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:49:17,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:17,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 12 states and 13 transitions. [2018-11-23 02:49:17,024 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 02:49:17,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 02:49:17,024 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:17,055 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:49:17,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:17,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 13 states and 14 transitions. [2018-11-23 02:49:17,094 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 02:49:17,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 02:49:17,094 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:17,140 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:49:17,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 14 states and 15 transitions. [2018-11-23 02:49:17,191 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 02:49:17,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 02:49:17,191 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:17,227 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:49:17,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:17,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 02:49:17,277 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 02:49:17,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 02:49:17,277 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:49:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:49:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:49:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:49:17,347 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 9 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~post0, main_~i~0, main_~sn~0;havoc main_~i~0;main_~sn~0 := 0;main_~i~0 := 1; VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~sn~0=0] [?] assume !!(main_~i~0 <= 8);BeginParallelComposition{ParallelCodeBlock0: assume main_~i~0 < 4;main_~sn~0 := 2 + main_~sn~0;ParallelCodeBlock1: assume !(main_~i~0 < 4);}EndParallelCompositionmain_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; VAL [ULTIMATE.start_main_~i~0=2, ULTIMATE.start_main_~sn~0=2] [?] assume !!(main_~i~0 <= 8);BeginParallelComposition{ParallelCodeBlock0: assume main_~i~0 < 4;main_~sn~0 := 2 + main_~sn~0;ParallelCodeBlock1: assume !(main_~i~0 < 4);}EndParallelCompositionmain_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; VAL [ULTIMATE.start_main_~i~0=3, ULTIMATE.start_main_~sn~0=4] [?] assume !!(main_~i~0 <= 8);BeginParallelComposition{ParallelCodeBlock0: assume main_~i~0 < 4;main_~sn~0 := 2 + main_~sn~0;ParallelCodeBlock1: assume !(main_~i~0 < 4);}EndParallelCompositionmain_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; VAL [ULTIMATE.start_main_~i~0=4, ULTIMATE.start_main_~sn~0=6] [?] assume !!(main_~i~0 <= 8);BeginParallelComposition{ParallelCodeBlock0: assume main_~i~0 < 4;main_~sn~0 := 2 + main_~sn~0;ParallelCodeBlock1: assume !(main_~i~0 < 4);}EndParallelCompositionmain_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; VAL [ULTIMATE.start_main_~i~0=5, ULTIMATE.start_main_~sn~0=6] [?] assume !!(main_~i~0 <= 8);BeginParallelComposition{ParallelCodeBlock0: assume main_~i~0 < 4;main_~sn~0 := 2 + main_~sn~0;ParallelCodeBlock1: assume !(main_~i~0 < 4);}EndParallelCompositionmain_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; VAL [ULTIMATE.start_main_~i~0=6, ULTIMATE.start_main_~sn~0=6] [?] assume !!(main_~i~0 <= 8);BeginParallelComposition{ParallelCodeBlock0: assume main_~i~0 < 4;main_~sn~0 := 2 + main_~sn~0;ParallelCodeBlock1: assume !(main_~i~0 < 4);}EndParallelCompositionmain_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; VAL [ULTIMATE.start_main_~i~0=7, ULTIMATE.start_main_~sn~0=6] [?] assume !!(main_~i~0 <= 8);BeginParallelComposition{ParallelCodeBlock0: assume main_~i~0 < 4;main_~sn~0 := 2 + main_~sn~0;ParallelCodeBlock1: assume !(main_~i~0 < 4);}EndParallelCompositionmain_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; VAL [ULTIMATE.start_main_~i~0=8, ULTIMATE.start_main_~sn~0=6] [?] assume !!(main_~i~0 <= 8);BeginParallelComposition{ParallelCodeBlock0: assume main_~i~0 < 4;main_~sn~0 := 2 + main_~sn~0;ParallelCodeBlock1: assume !(main_~i~0 < 4);}EndParallelCompositionmain_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; VAL [ULTIMATE.start_main_~i~0=9, ULTIMATE.start_main_~sn~0=6] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~i~0 <= 8);}EndParallelComposition__VERIFIER_assert_#in~cond := (if 16 == main_~sn~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=9, ULTIMATE.start_main_~sn~0=6, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] assume 0 == __VERIFIER_assert_~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=9, ULTIMATE.start_main_~sn~0=6, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=9, ULTIMATE.start_main_~sn~0=6, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] havoc main_#res; [?] havoc main_#t~post0, main_~i~0, main_~sn~0; [L12] havoc main_~i~0; [L12] main_~sn~0 := 0; [L13] main_~i~0 := 1; VAL [main_~i~0=1, main_~sn~0=0] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume main_~i~0 < 4; [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=2, main_~sn~0=2] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume main_~i~0 < 4; [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=3, main_~sn~0=4] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume main_~i~0 < 4; [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=4, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume !(main_~i~0 < 4); [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=5, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume !(main_~i~0 < 4); [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=6, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume !(main_~i~0 < 4); [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=7, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume !(main_~i~0 < 4); [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=8, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume !(main_~i~0 < 4); [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=9, main_~sn~0=6] [L13-L16] assume !(main_~i~0 <= 8); [L17] __VERIFIER_assert_#in~cond := (if 16 == main_~sn~0 || 0 == main_~sn~0 then 1 else 0); [L17] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] [L4-L6] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~post0, main_~i~0, main_~sn~0; [L12] havoc main_~i~0; [L12] main_~sn~0 := 0; [L13] main_~i~0 := 1; VAL [main_~i~0=1, main_~sn~0=0] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume main_~i~0 < 4; [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=2, main_~sn~0=2] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume main_~i~0 < 4; [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=3, main_~sn~0=4] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume main_~i~0 < 4; [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=4, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume !(main_~i~0 < 4); [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=5, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume !(main_~i~0 < 4); [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=6, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume !(main_~i~0 < 4); [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=7, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume !(main_~i~0 < 4); [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=8, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume !(main_~i~0 < 4); [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=9, main_~sn~0=6] [L13-L16] assume !(main_~i~0 <= 8); [L17] __VERIFIER_assert_#in~cond := (if 16 == main_~sn~0 || 0 == main_~sn~0 then 1 else 0); [L17] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] [L4-L6] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] [?] havoc main_#res; [?] havoc main_#t~post0, main_~i~0, main_~sn~0; [L12] havoc main_~i~0; [L12] main_~sn~0 := 0; [L13] main_~i~0 := 1; VAL [main_~i~0=1, main_~sn~0=0] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND TRUE main_~i~0 < 4 [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=2, main_~sn~0=2] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND TRUE main_~i~0 < 4 [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=3, main_~sn~0=4] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND TRUE main_~i~0 < 4 [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=4, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND FALSE !(main_~i~0 < 4) [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=5, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND FALSE !(main_~i~0 < 4) [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=6, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND FALSE !(main_~i~0 < 4) [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=7, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND FALSE !(main_~i~0 < 4) [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=8, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND FALSE !(main_~i~0 < 4) [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=9, main_~sn~0=6] [L13-L16] COND TRUE !(main_~i~0 <= 8) [L17] __VERIFIER_assert_#in~cond := (if 16 == main_~sn~0 || 0 == main_~sn~0 then 1 else 0); [L17] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] [L4] COND TRUE 0 == __VERIFIER_assert_~cond VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~post0, main_~i~0, main_~sn~0; [L12] havoc main_~i~0; [L12] main_~sn~0 := 0; [L13] main_~i~0 := 1; VAL [main_~i~0=1, main_~sn~0=0] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND TRUE main_~i~0 < 4 [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=2, main_~sn~0=2] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND TRUE main_~i~0 < 4 [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=3, main_~sn~0=4] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND TRUE main_~i~0 < 4 [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=4, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND FALSE !(main_~i~0 < 4) [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=5, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND FALSE !(main_~i~0 < 4) [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=6, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND FALSE !(main_~i~0 < 4) [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=7, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND FALSE !(main_~i~0 < 4) [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=8, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND FALSE !(main_~i~0 < 4) [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=9, main_~sn~0=6] [L13-L16] COND TRUE !(main_~i~0 <= 8) [L17] __VERIFIER_assert_#in~cond := (if 16 == main_~sn~0 || 0 == main_~sn~0 then 1 else 0); [L17] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] [L4] COND TRUE 0 == __VERIFIER_assert_~cond VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND FALSE !(~i~0 < 4) [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND FALSE !(~i~0 < 4) [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND FALSE !(~i~0 < 4) [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND FALSE !(~i~0 < 4) [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND FALSE !(~i~0 < 4) [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND TRUE !(~i~0 <= 8) [L3-L8] ~cond := #in~cond; [L4] COND TRUE 0 == ~cond [L5] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND FALSE !(~i~0 < 4) [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND FALSE !(~i~0 < 4) [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND FALSE !(~i~0 < 4) [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND FALSE !(~i~0 < 4) [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND FALSE !(~i~0 < 4) [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND TRUE !(~i~0 <= 8) [L3-L8] ~cond := #in~cond; [L4] COND TRUE 0 == ~cond [L5] assert false; [L12] int i, sn=0; [L13] i=1 [L13] COND TRUE i<=8 [L14] COND TRUE i<4 [L15] sn = sn + (2) [L13] i++ [L13] COND TRUE i<=8 [L14] COND TRUE i<4 [L15] sn = sn + (2) [L13] i++ [L13] COND TRUE i<=8 [L14] COND TRUE i<4 [L15] sn = sn + (2) [L13] i++ [L13] COND TRUE i<=8 [L14] COND FALSE !(i<4) [L13] i++ [L13] COND TRUE i<=8 [L14] COND FALSE !(i<4) [L13] i++ [L13] COND TRUE i<=8 [L14] COND FALSE !(i<4) [L13] i++ [L13] COND TRUE i<=8 [L14] COND FALSE !(i<4) [L13] i++ [L13] COND TRUE i<=8 [L14] COND FALSE !(i<4) [L13] i++ [L13] COND FALSE !(i<=8) [L4] COND TRUE !(cond) [L5] __VERIFIER_error() ----- [2018-11-23 02:49:17,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 02:49:17 ImpRootNode [2018-11-23 02:49:17,379 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 02:49:17,379 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:49:17,380 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:49:17,380 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:49:17,380 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:49:16" (3/4) ... [2018-11-23 02:49:17,382 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~post0, main_~i~0, main_~sn~0;havoc main_~i~0;main_~sn~0 := 0;main_~i~0 := 1; VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~sn~0=0] [?] assume !!(main_~i~0 <= 8);BeginParallelComposition{ParallelCodeBlock0: assume main_~i~0 < 4;main_~sn~0 := 2 + main_~sn~0;ParallelCodeBlock1: assume !(main_~i~0 < 4);}EndParallelCompositionmain_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; VAL [ULTIMATE.start_main_~i~0=2, ULTIMATE.start_main_~sn~0=2] [?] assume !!(main_~i~0 <= 8);BeginParallelComposition{ParallelCodeBlock0: assume main_~i~0 < 4;main_~sn~0 := 2 + main_~sn~0;ParallelCodeBlock1: assume !(main_~i~0 < 4);}EndParallelCompositionmain_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; VAL [ULTIMATE.start_main_~i~0=3, ULTIMATE.start_main_~sn~0=4] [?] assume !!(main_~i~0 <= 8);BeginParallelComposition{ParallelCodeBlock0: assume main_~i~0 < 4;main_~sn~0 := 2 + main_~sn~0;ParallelCodeBlock1: assume !(main_~i~0 < 4);}EndParallelCompositionmain_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; VAL [ULTIMATE.start_main_~i~0=4, ULTIMATE.start_main_~sn~0=6] [?] assume !!(main_~i~0 <= 8);BeginParallelComposition{ParallelCodeBlock0: assume main_~i~0 < 4;main_~sn~0 := 2 + main_~sn~0;ParallelCodeBlock1: assume !(main_~i~0 < 4);}EndParallelCompositionmain_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; VAL [ULTIMATE.start_main_~i~0=5, ULTIMATE.start_main_~sn~0=6] [?] assume !!(main_~i~0 <= 8);BeginParallelComposition{ParallelCodeBlock0: assume main_~i~0 < 4;main_~sn~0 := 2 + main_~sn~0;ParallelCodeBlock1: assume !(main_~i~0 < 4);}EndParallelCompositionmain_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; VAL [ULTIMATE.start_main_~i~0=6, ULTIMATE.start_main_~sn~0=6] [?] assume !!(main_~i~0 <= 8);BeginParallelComposition{ParallelCodeBlock0: assume main_~i~0 < 4;main_~sn~0 := 2 + main_~sn~0;ParallelCodeBlock1: assume !(main_~i~0 < 4);}EndParallelCompositionmain_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; VAL [ULTIMATE.start_main_~i~0=7, ULTIMATE.start_main_~sn~0=6] [?] assume !!(main_~i~0 <= 8);BeginParallelComposition{ParallelCodeBlock0: assume main_~i~0 < 4;main_~sn~0 := 2 + main_~sn~0;ParallelCodeBlock1: assume !(main_~i~0 < 4);}EndParallelCompositionmain_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; VAL [ULTIMATE.start_main_~i~0=8, ULTIMATE.start_main_~sn~0=6] [?] assume !!(main_~i~0 <= 8);BeginParallelComposition{ParallelCodeBlock0: assume main_~i~0 < 4;main_~sn~0 := 2 + main_~sn~0;ParallelCodeBlock1: assume !(main_~i~0 < 4);}EndParallelCompositionmain_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; VAL [ULTIMATE.start_main_~i~0=9, ULTIMATE.start_main_~sn~0=6] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~i~0 <= 8);}EndParallelComposition__VERIFIER_assert_#in~cond := (if 16 == main_~sn~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=9, ULTIMATE.start_main_~sn~0=6, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] assume 0 == __VERIFIER_assert_~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=9, ULTIMATE.start_main_~sn~0=6, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=9, ULTIMATE.start_main_~sn~0=6, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] havoc main_#res; [?] havoc main_#t~post0, main_~i~0, main_~sn~0; [L12] havoc main_~i~0; [L12] main_~sn~0 := 0; [L13] main_~i~0 := 1; VAL [main_~i~0=1, main_~sn~0=0] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume main_~i~0 < 4; [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=2, main_~sn~0=2] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume main_~i~0 < 4; [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=3, main_~sn~0=4] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume main_~i~0 < 4; [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=4, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume !(main_~i~0 < 4); [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=5, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume !(main_~i~0 < 4); [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=6, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume !(main_~i~0 < 4); [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=7, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume !(main_~i~0 < 4); [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=8, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume !(main_~i~0 < 4); [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=9, main_~sn~0=6] [L13-L16] assume !(main_~i~0 <= 8); [L17] __VERIFIER_assert_#in~cond := (if 16 == main_~sn~0 || 0 == main_~sn~0 then 1 else 0); [L17] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] [L4-L6] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~post0, main_~i~0, main_~sn~0; [L12] havoc main_~i~0; [L12] main_~sn~0 := 0; [L13] main_~i~0 := 1; VAL [main_~i~0=1, main_~sn~0=0] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume main_~i~0 < 4; [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=2, main_~sn~0=2] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume main_~i~0 < 4; [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=3, main_~sn~0=4] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume main_~i~0 < 4; [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=4, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume !(main_~i~0 < 4); [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=5, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume !(main_~i~0 < 4); [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=6, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume !(main_~i~0 < 4); [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=7, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume !(main_~i~0 < 4); [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=8, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= 8); [L14-L15] assume !(main_~i~0 < 4); [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=9, main_~sn~0=6] [L13-L16] assume !(main_~i~0 <= 8); [L17] __VERIFIER_assert_#in~cond := (if 16 == main_~sn~0 || 0 == main_~sn~0 then 1 else 0); [L17] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] [L4-L6] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] [?] havoc main_#res; [?] havoc main_#t~post0, main_~i~0, main_~sn~0; [L12] havoc main_~i~0; [L12] main_~sn~0 := 0; [L13] main_~i~0 := 1; VAL [main_~i~0=1, main_~sn~0=0] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND TRUE main_~i~0 < 4 [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=2, main_~sn~0=2] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND TRUE main_~i~0 < 4 [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=3, main_~sn~0=4] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND TRUE main_~i~0 < 4 [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=4, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND FALSE !(main_~i~0 < 4) [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=5, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND FALSE !(main_~i~0 < 4) [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=6, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND FALSE !(main_~i~0 < 4) [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=7, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND FALSE !(main_~i~0 < 4) [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=8, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND FALSE !(main_~i~0 < 4) [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=9, main_~sn~0=6] [L13-L16] COND TRUE !(main_~i~0 <= 8) [L17] __VERIFIER_assert_#in~cond := (if 16 == main_~sn~0 || 0 == main_~sn~0 then 1 else 0); [L17] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] [L4] COND TRUE 0 == __VERIFIER_assert_~cond VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~post0, main_~i~0, main_~sn~0; [L12] havoc main_~i~0; [L12] main_~sn~0 := 0; [L13] main_~i~0 := 1; VAL [main_~i~0=1, main_~sn~0=0] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND TRUE main_~i~0 < 4 [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=2, main_~sn~0=2] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND TRUE main_~i~0 < 4 [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=3, main_~sn~0=4] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND TRUE main_~i~0 < 4 [L15] main_~sn~0 := 2 + main_~sn~0; [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=4, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND FALSE !(main_~i~0 < 4) [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=5, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND FALSE !(main_~i~0 < 4) [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=6, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND FALSE !(main_~i~0 < 4) [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=7, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND FALSE !(main_~i~0 < 4) [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=8, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= 8)) [L14] COND FALSE !(main_~i~0 < 4) [L13] main_#t~post0 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post0; [L13] havoc main_#t~post0; VAL [main_~i~0=9, main_~sn~0=6] [L13-L16] COND TRUE !(main_~i~0 <= 8) [L17] __VERIFIER_assert_#in~cond := (if 16 == main_~sn~0 || 0 == main_~sn~0 then 1 else 0); [L17] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] [L4] COND TRUE 0 == __VERIFIER_assert_~cond VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=9, main_~sn~0=6] [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND FALSE !(~i~0 < 4) [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND FALSE !(~i~0 < 4) [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND FALSE !(~i~0 < 4) [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND FALSE !(~i~0 < 4) [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND FALSE !(~i~0 < 4) [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND TRUE !(~i~0 <= 8) [L3-L8] ~cond := #in~cond; [L4] COND TRUE 0 == ~cond [L5] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND FALSE !(~i~0 < 4) [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND FALSE !(~i~0 < 4) [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND FALSE !(~i~0 < 4) [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND FALSE !(~i~0 < 4) [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND FALSE !(!(~i~0 <= 8)) [L14] COND FALSE !(~i~0 < 4) [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; [L13-L16] COND TRUE !(~i~0 <= 8) [L3-L8] ~cond := #in~cond; [L4] COND TRUE 0 == ~cond [L5] assert false; [L12] int i, sn=0; [L13] i=1 [L13] COND TRUE i<=8 [L14] COND TRUE i<4 [L15] sn = sn + (2) [L13] i++ [L13] COND TRUE i<=8 [L14] COND TRUE i<4 [L15] sn = sn + (2) [L13] i++ [L13] COND TRUE i<=8 [L14] COND TRUE i<4 [L15] sn = sn + (2) [L13] i++ [L13] COND TRUE i<=8 [L14] COND FALSE !(i<4) [L13] i++ [L13] COND TRUE i<=8 [L14] COND FALSE !(i<4) [L13] i++ [L13] COND TRUE i<=8 [L14] COND FALSE !(i<4) [L13] i++ [L13] COND TRUE i<=8 [L14] COND FALSE !(i<4) [L13] i++ [L13] COND TRUE i<=8 [L14] COND FALSE !(i<4) [L13] i++ [L13] COND FALSE !(i<=8) [L4] COND TRUE !(cond) [L5] __VERIFIER_error() ----- [2018-11-23 02:49:17,429 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6a3f6882-7870-48a1-a1aa-7bc9ed4d5195/bin-2019/ukojak/witness.graphml [2018-11-23 02:49:17,429 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:49:17,430 INFO L168 Benchmark]: Toolchain (without parser) took 1359.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 962.3 MB in the beginning and 1.0 GB in the end (delta: -80.9 MB). Peak memory consumption was 84.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:49:17,431 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:49:17,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 138.44 ms. Allocated memory is still 1.0 GB. Free memory was 962.3 MB in the beginning and 951.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:49:17,432 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.05 ms. Allocated memory is still 1.0 GB. Free memory was 951.6 MB in the beginning and 946.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:49:17,432 INFO L168 Benchmark]: Boogie Preprocessor took 15.08 ms. Allocated memory is still 1.0 GB. Free memory is still 946.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:49:17,433 INFO L168 Benchmark]: RCFGBuilder took 236.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -199.2 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:49:17,433 INFO L168 Benchmark]: CodeCheck took 890.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.1 MB). Peak memory consumption was 102.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:49:17,433 INFO L168 Benchmark]: Witness Printer took 49.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:49:17,437 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, 11 locations, 1 error locations. UNSAFE Result, 0.8s OverallTime, 9 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 384 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 1654 SolverSat, 1402 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 417 GetRequests, 359 SyntacticMatches, 28 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 932 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: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, sn=0; [L13] i=1 [L13] COND TRUE i<=8 [L14] COND TRUE i<4 [L15] sn = sn + (2) [L13] i++ [L13] COND TRUE i<=8 [L14] COND TRUE i<4 [L15] sn = sn + (2) [L13] i++ [L13] COND TRUE i<=8 [L14] COND TRUE i<4 [L15] sn = sn + (2) [L13] i++ [L13] COND TRUE i<=8 [L14] COND FALSE !(i<4) [L13] i++ [L13] COND TRUE i<=8 [L14] COND FALSE !(i<4) [L13] i++ [L13] COND TRUE i<=8 [L14] COND FALSE !(i<4) [L13] i++ [L13] COND TRUE i<=8 [L14] COND FALSE !(i<4) [L13] i++ [L13] COND TRUE i<=8 [L14] COND FALSE !(i<4) [L13] i++ [L13] COND FALSE !(i<=8) [L4] COND TRUE !(cond) [L5] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 138.44 ms. Allocated memory is still 1.0 GB. Free memory was 962.3 MB in the beginning and 951.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.05 ms. Allocated memory is still 1.0 GB. Free memory was 951.6 MB in the beginning and 946.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.08 ms. Allocated memory is still 1.0 GB. Free memory is still 946.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 236.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -199.2 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * CodeCheck took 890.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.1 MB). Peak memory consumption was 102.1 MB. Max. memory is 11.5 GB. * Witness Printer took 49.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...