./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_563b2105-be70-490e-96c5-ca556dee5b74/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_563b2105-be70-490e-96c5-ca556dee5b74/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_563b2105-be70-490e-96c5-ca556dee5b74/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_563b2105-be70-490e-96c5-ca556dee5b74/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_563b2105-be70-490e-96c5-ca556dee5b74/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_563b2105-be70-490e-96c5-ca556dee5b74/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 59598ef74ac7afb6c962e2cc2ba26af488759b7c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-1dbac8b [2018-11-10 09:09:56,675 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:09:56,676 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:09:56,682 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:09:56,682 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:09:56,683 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:09:56,684 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:09:56,685 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:09:56,687 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:09:56,687 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:09:56,688 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:09:56,688 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:09:56,689 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:09:56,690 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:09:56,691 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:09:56,691 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:09:56,692 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:09:56,693 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:09:56,694 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:09:56,696 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:09:56,696 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:09:56,697 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:09:56,699 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:09:56,699 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:09:56,699 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:09:56,700 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:09:56,701 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:09:56,701 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:09:56,702 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:09:56,703 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:09:56,703 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:09:56,703 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:09:56,704 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:09:56,704 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:09:56,704 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:09:56,705 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:09:56,705 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_563b2105-be70-490e-96c5-ca556dee5b74/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 09:09:56,716 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:09:56,716 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:09:56,717 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 09:09:56,717 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 09:09:56,717 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 09:09:56,718 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 09:09:56,718 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:09:56,718 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 09:09:56,718 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:09:56,718 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 09:09:56,718 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:09:56,718 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 09:09:56,719 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 09:09:56,719 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 09:09:56,719 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 09:09:56,719 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:09:56,719 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 09:09:56,719 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 09:09:56,719 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 09:09:56,720 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:09:56,720 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 09:09:56,720 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 09:09:56,720 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:09:56,720 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 09:09:56,720 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 09:09:56,720 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 09:09:56,721 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 09:09:56,721 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 09:09:56,721 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_563b2105-be70-490e-96c5-ca556dee5b74/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 -> 59598ef74ac7afb6c962e2cc2ba26af488759b7c [2018-11-10 09:09:56,744 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:09:56,752 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:09:56,753 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:09:56,754 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:09:56,755 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:09:56,755 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_563b2105-be70-490e-96c5-ca556dee5b74/bin-2019/ukojak/../../sv-benchmarks/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c [2018-11-10 09:09:56,792 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_563b2105-be70-490e-96c5-ca556dee5b74/bin-2019/ukojak/data/22e7f5570/53b661c1d63349eb8cbde27d3389d753/FLAG5a585a899 [2018-11-10 09:09:57,208 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:09:57,209 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_563b2105-be70-490e-96c5-ca556dee5b74/sv-benchmarks/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c [2018-11-10 09:09:57,215 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_563b2105-be70-490e-96c5-ca556dee5b74/bin-2019/ukojak/data/22e7f5570/53b661c1d63349eb8cbde27d3389d753/FLAG5a585a899 [2018-11-10 09:09:57,223 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_563b2105-be70-490e-96c5-ca556dee5b74/bin-2019/ukojak/data/22e7f5570/53b661c1d63349eb8cbde27d3389d753 [2018-11-10 09:09:57,226 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:09:57,227 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:09:57,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:09:57,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:09:57,229 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:09:57,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:09:57" (1/1) ... [2018-11-10 09:09:57,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@549999d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:09:57, skipping insertion in model container [2018-11-10 09:09:57,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:09:57" (1/1) ... [2018-11-10 09:09:57,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:09:57,257 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:09:57,381 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:09:57,384 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:09:57,411 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:09:57,423 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:09:57,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:09:57 WrapperNode [2018-11-10 09:09:57,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:09:57,424 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:09:57,424 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:09:57,424 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:09:57,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:09:57" (1/1) ... [2018-11-10 09:09:57,433 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:09:57" (1/1) ... [2018-11-10 09:09:57,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:09:57,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:09:57,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:09:57,449 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:09:57,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:09:57" (1/1) ... [2018-11-10 09:09:57,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:09:57" (1/1) ... [2018-11-10 09:09:57,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:09:57" (1/1) ... [2018-11-10 09:09:57,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:09:57" (1/1) ... [2018-11-10 09:09:57,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:09:57" (1/1) ... [2018-11-10 09:09:57,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:09:57" (1/1) ... [2018-11-10 09:09:57,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:09:57" (1/1) ... [2018-11-10 09:09:57,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:09:57,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:09:57,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:09:57,509 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:09:57,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:09:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_563b2105-be70-490e-96c5-ca556dee5b74/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-10 09:09:57,546 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-11-10 09:09:57,546 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-11-10 09:09:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-10 09:09:57,547 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-10 09:09:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-10 09:09:57,547 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-10 09:09:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-10 09:09:57,547 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-10 09:09:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-10 09:09:57,547 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-10 09:09:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-10 09:09:57,548 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-10 09:09:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-10 09:09:57,548 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-10 09:09:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:09:57,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:09:58,035 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:09:58,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:09:58 BoogieIcfgContainer [2018-11-10 09:09:58,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:09:58,036 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 09:09:58,037 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 09:09:58,045 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 09:09:58,046 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:09:58" (1/1) ... [2018-11-10 09:09:58,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:09:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:09:58,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 76 states and 110 transitions. [2018-11-10 09:09:58,086 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 110 transitions. [2018-11-10 09:09:58,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 09:09:58,091 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:09:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:09:58,223 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-10 09:09:58,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:09:58,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 80 states and 114 transitions. [2018-11-10 09:09:58,461 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2018-11-10 09:09:58,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 09:09:58,462 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:09:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:09:58,501 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-10 09:09:58,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:09:58,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 81 states and 114 transitions. [2018-11-10 09:09:58,625 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 114 transitions. [2018-11-10 09:09:58,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 09:09:58,626 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:09:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:09:58,665 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-10 09:09:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:09:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 91 states and 131 transitions. [2018-11-10 09:09:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2018-11-10 09:09:58,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 09:09:58,797 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:09:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:09:58,841 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 09:09:58,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:09:58,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 98 states and 147 transitions. [2018-11-10 09:09:58,927 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 147 transitions. [2018-11-10 09:09:58,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 09:09:58,928 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:09:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:09:58,958 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 09:09:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:09:59,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 99 states and 149 transitions. [2018-11-10 09:09:59,028 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 149 transitions. [2018-11-10 09:09:59,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 09:09:59,029 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:09:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:09:59,056 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 09:09:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:09:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 100 states and 151 transitions. [2018-11-10 09:09:59,131 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 151 transitions. [2018-11-10 09:09:59,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 09:09:59,132 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:09:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:09:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 09:09:59,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:09:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 101 states and 152 transitions. [2018-11-10 09:09:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 152 transitions. [2018-11-10 09:09:59,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 09:09:59,212 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:09:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:09:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 09:09:59,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:09:59,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 103 states and 157 transitions. [2018-11-10 09:09:59,297 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 157 transitions. [2018-11-10 09:09:59,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 09:09:59,299 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:09:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:09:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 09:09:59,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:09:59,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 114 states and 181 transitions. [2018-11-10 09:09:59,570 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 181 transitions. [2018-11-10 09:09:59,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 09:09:59,572 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:09:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:09:59,592 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 09:09:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:09:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 116 states and 185 transitions. [2018-11-10 09:09:59,651 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 185 transitions. [2018-11-10 09:09:59,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 09:09:59,652 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:09:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:09:59,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 09:09:59,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:09:59,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 116 states and 183 transitions. [2018-11-10 09:09:59,740 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 183 transitions. [2018-11-10 09:09:59,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 09:09:59,741 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:09:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:09:59,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 09:09:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:09:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 117 states and 185 transitions. [2018-11-10 09:09:59,815 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 185 transitions. [2018-11-10 09:09:59,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 09:09:59,816 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:09:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:09:59,832 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 09:09:59,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:09:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 120 states and 188 transitions. [2018-11-10 09:09:59,942 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 188 transitions. [2018-11-10 09:09:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 09:09:59,943 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:09:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:09:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 09:10:00,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:00,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 127 states and 204 transitions. [2018-11-10 09:10:00,189 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 204 transitions. [2018-11-10 09:10:00,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 09:10:00,190 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:10:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 09:10:00,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:00,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 133 states and 212 transitions. [2018-11-10 09:10:00,347 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 212 transitions. [2018-11-10 09:10:00,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-10 09:10:00,348 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:10:00,407 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 09:10:00,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 139 states and 223 transitions. [2018-11-10 09:10:00,625 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 223 transitions. [2018-11-10 09:10:00,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 09:10:00,626 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:10:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 09:10:00,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:00,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 145 states and 231 transitions. [2018-11-10 09:10:00,807 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 231 transitions. [2018-11-10 09:10:00,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 09:10:00,809 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:10:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 09:10:01,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 156 states and 251 transitions. [2018-11-10 09:10:01,026 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 251 transitions. [2018-11-10 09:10:01,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 09:10:01,028 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:10:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 09:10:01,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 157 states and 251 transitions. [2018-11-10 09:10:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 251 transitions. [2018-11-10 09:10:01,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 09:10:01,109 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:10:01,150 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 09:10:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:01,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 157 states and 248 transitions. [2018-11-10 09:10:01,225 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 248 transitions. [2018-11-10 09:10:01,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 09:10:01,226 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:10:01,270 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 09:10:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:01,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 159 states and 250 transitions. [2018-11-10 09:10:01,360 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 250 transitions. [2018-11-10 09:10:01,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 09:10:01,361 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:10:01,379 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 09:10:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:01,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 165 states and 261 transitions. [2018-11-10 09:10:01,548 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 261 transitions. [2018-11-10 09:10:01,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 09:10:01,549 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:10:01,655 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 09:10:02,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 178 states and 289 transitions. [2018-11-10 09:10:02,131 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 289 transitions. [2018-11-10 09:10:02,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 09:10:02,132 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:10:02,154 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 09:10:02,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:02,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 181 states and 295 transitions. [2018-11-10 09:10:02,319 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2018-11-10 09:10:02,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 09:10:02,320 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:10:02,339 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 09:10:02,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:02,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 181 states and 295 transitions. [2018-11-10 09:10:02,387 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2018-11-10 09:10:02,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 09:10:02,388 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:10:02,400 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 09:10:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:02,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 187 states and 312 transitions. [2018-11-10 09:10:02,684 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 312 transitions. [2018-11-10 09:10:02,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-10 09:10:02,686 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:10:02,703 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 09:10:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 192 states and 323 transitions. [2018-11-10 09:10:02,774 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 323 transitions. [2018-11-10 09:10:02,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-10 09:10:02,775 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:10:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 09:10:02,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:02,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 205 states and 344 transitions. [2018-11-10 09:10:02,889 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 344 transitions. [2018-11-10 09:10:02,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 09:10:02,890 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:10:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 29 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 09:10:02,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:02,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 205 states and 344 transitions. [2018-11-10 09:10:02,949 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 344 transitions. [2018-11-10 09:10:02,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 09:10:02,950 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:10:02,964 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 09:10:03,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:03,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 210 states and 354 transitions. [2018-11-10 09:10:03,215 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 354 transitions. [2018-11-10 09:10:03,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 09:10:03,216 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:10:03,232 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 29 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 09:10:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 210 states and 354 transitions. [2018-11-10 09:10:03,267 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 354 transitions. [2018-11-10 09:10:03,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 09:10:03,268 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:10:03,283 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 09:10:03,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:03,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 215 states and 362 transitions. [2018-11-10 09:10:03,373 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 362 transitions. [2018-11-10 09:10:03,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 09:10:03,374 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:10:03,387 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 09:10:03,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 215 states and 362 transitions. [2018-11-10 09:10:03,423 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 362 transitions. [2018-11-10 09:10:03,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 09:10:03,424 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:10:03,509 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 09:10:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:03,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 224 states and 381 transitions. [2018-11-10 09:10:03,985 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 381 transitions. [2018-11-10 09:10:03,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 09:10:03,986 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:10:04,011 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 29 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 09:10:04,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:04,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 224 states and 381 transitions. [2018-11-10 09:10:04,047 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 381 transitions. [2018-11-10 09:10:04,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 09:10:04,048 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:10:04,195 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-10 09:10:05,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:05,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 243 states and 432 transitions. [2018-11-10 09:10:05,324 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 432 transitions. [2018-11-10 09:10:05,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 09:10:05,325 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:10:05,340 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 29 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 09:10:05,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:10:05,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 243 states and 432 transitions. [2018-11-10 09:10:05,378 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 432 transitions. [2018-11-10 09:10:05,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 09:10:05,379 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:10:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:10:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:10:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:10:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:10:05,519 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 38 iterations. [2018-11-10 09:10:05,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 09:10:05 ImpRootNode [2018-11-10 09:10:05,583 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 09:10:05,583 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 09:10:05,583 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 09:10:05,584 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 09:10:05,585 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:09:58" (3/4) ... [2018-11-10 09:10:05,587 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 09:10:05,673 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_563b2105-be70-490e-96c5-ca556dee5b74/bin-2019/ukojak/witness.graphml [2018-11-10 09:10:05,673 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 09:10:05,674 INFO L168 Benchmark]: Toolchain (without parser) took 8447.62 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 390.1 MB). Free memory was 953.8 MB in the beginning and 894.8 MB in the end (delta: 58.9 MB). Peak memory consumption was 449.0 MB. Max. memory is 11.5 GB. [2018-11-10 09:10:05,675 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:10:05,675 INFO L168 Benchmark]: CACSL2BoogieTranslator took 196.20 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 940.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 09:10:05,676 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.15 ms. Allocated memory is still 1.0 GB. Free memory was 940.4 MB in the beginning and 937.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. [2018-11-10 09:10:05,676 INFO L168 Benchmark]: Boogie Preprocessor took 59.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 937.6 MB in the beginning and 1.1 GB in the end (delta: -194.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-10 09:10:05,676 INFO L168 Benchmark]: RCFGBuilder took 527.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 11.5 GB. [2018-11-10 09:10:05,676 INFO L168 Benchmark]: CodeCheck took 7546.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 252.2 MB). Free memory was 1.1 GB in the beginning and 905.3 MB in the end (delta: 171.0 MB). Peak memory consumption was 423.2 MB. Max. memory is 11.5 GB. [2018-11-10 09:10:05,677 INFO L168 Benchmark]: Witness Printer took 89.61 ms. Allocated memory is still 1.4 GB. Free memory was 905.3 MB in the beginning and 894.8 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. [2018-11-10 09:10:05,680 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 8 procedures, 119 locations, 1 error locations. UNSAFE Result, 7.4s OverallTime, 38 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -120041738 SDtfs, 1536186908 SDslu, 575117812 SDs, 0 SdLazy, 243821988 SolverSat, -291737988 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21277 GetRequests, 20071 SyntacticMatches, 1034 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35246 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 2558 NumberOfCodeBlocks, 2558 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2424 ConstructedInterpolants, 0 QuantifiedInterpolants, 275766 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 28 PerfectInterpolantSequences, 988/1027 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: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int m_st ; [L17] int t1_st ; [L18] int m_i ; [L19] int t1_i ; [L20] int M_E = 2; [L21] int T1_E = 2; [L22] int E_M = 2; [L23] int E_1 = 2; [L27] int token ; [L29] int local ; [L475] int __retres1 ; [L479] CALL init_model() [L390] m_i = 1 [L391] RET t1_i = 1 [L479] init_model() [L480] CALL start_simulation() [L416] int kernel_st ; [L417] int tmp ; [L418] int tmp___0 ; [L422] kernel_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L423] FCALL update_channels() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] CALL init_threads() [L172] COND TRUE m_i == 1 [L173] m_st = 0 [L177] COND TRUE t1_i == 1 [L178] RET t1_st = 0 [L424] init_threads() [L425] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L261] COND FALSE !(M_E == 0) [L266] COND FALSE !(T1_E == 0) [L271] COND FALSE !(E_M == 0) [L276] COND FALSE, RET !(E_1 == 0) [L425] fire_delta_events() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L426] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] int tmp ; [L315] int tmp___0 ; [L319] CALL, EXPR is_master_triggered() [L123] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L126] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L138] RET return (__retres1); [L319] EXPR is_master_triggered() [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) [L327] CALL, EXPR is_transmit1_triggered() [L142] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L145] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L157] RET return (__retres1); [L327] EXPR is_transmit1_triggered() [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE, RET !(\read(tmp___0)) [L426] activate_threads() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L427] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L289] COND FALSE !(M_E == 1) [L294] COND FALSE !(T1_E == 1) [L299] COND FALSE !(E_M == 1) [L304] COND FALSE, RET !(E_1 == 1) [L427] reset_delta_events() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L430] COND TRUE 1 [L433] kernel_st = 1 [L434] CALL eval() [L208] int tmp ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L215] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] int __retres1 ; [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 [L203] RET return (__retres1); [L215] EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 [L242] CALL transmit1() [L90] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L101] COND TRUE 1 [L103] t1_pc = 1 [L104] RET t1_st = 2 [L242] transmit1() [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L215] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L187] int __retres1 ; [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 [L203] RET return (__retres1); [L215] EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 [L228] CALL master() [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L45] COND TRUE 1 [L48] token = __VERIFIER_nondet_int() [L49] local = token [L50] E_1 = 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L51] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L343] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L314] int tmp ; [L315] int tmp___0 ; [L319] CALL, EXPR is_master_triggered() [L123] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L126] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L136] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L138] RET return (__retres1); [L319] EXPR is_master_triggered() [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) [L327] CALL, EXPR is_transmit1_triggered() [L142] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L145] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L146] COND TRUE E_1 == 1 [L147] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L157] RET return (__retres1); [L327] EXPR is_transmit1_triggered() [L327] tmp___0 = is_transmit1_triggered() [L329] COND TRUE \read(tmp___0) [L330] RET t1_st = 0 [L343] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L51] immediate_notify() VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L52] E_1 = 2 [L53] m_pc = 1 [L54] RET m_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L228] master() [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 [L242] CALL transmit1() [L90] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L93] COND TRUE t1_pc == 1 [L109] token += 1 [L110] E_M = 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L111] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L343] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L314] int tmp ; [L315] int tmp___0 ; [L319] CALL, EXPR is_master_triggered() [L123] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L126] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L127] COND TRUE E_M == 1 [L128] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L138] RET return (__retres1); [L319] EXPR is_master_triggered() [L319] tmp = is_master_triggered() [L321] COND TRUE \read(tmp) [L322] m_st = 0 [L327] CALL, EXPR is_transmit1_triggered() [L142] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L145] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L146] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L155] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] RET return (__retres1); [L327] EXPR is_transmit1_triggered() [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE, RET !(\read(tmp___0)) [L343] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L111] immediate_notify() VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L112] E_M = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L101] COND TRUE 1 [L103] t1_pc = 1 [L104] RET t1_st = 2 [L242] transmit1() [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L215] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L187] int __retres1 ; [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 [L203] RET return (__retres1); [L215] EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 [L228] CALL master() [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L37] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L59] COND FALSE !(token != local + 1) [L64] COND TRUE tmp_var <= 5 [L65] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L70] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L71] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L72] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L73] CALL error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L10] __VERIFIER_error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 196.20 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 940.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.15 ms. Allocated memory is still 1.0 GB. Free memory was 940.4 MB in the beginning and 937.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 937.6 MB in the beginning and 1.1 GB in the end (delta: -194.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 527.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 11.5 GB. * CodeCheck took 7546.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 252.2 MB). Free memory was 1.1 GB in the beginning and 905.3 MB in the end (delta: 171.0 MB). Peak memory consumption was 423.2 MB. Max. memory is 11.5 GB. * Witness Printer took 89.61 ms. Allocated memory is still 1.4 GB. Free memory was 905.3 MB in the beginning and 894.8 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...