./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_445a56a3-4bb2-45e6-ab8a-9780eb4d49df/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_445a56a3-4bb2-45e6-ab8a-9780eb4d49df/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_445a56a3-4bb2-45e6-ab8a-9780eb4d49df/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_445a56a3-4bb2-45e6-ab8a-9780eb4d49df/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_445a56a3-4bb2-45e6-ab8a-9780eb4d49df/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_445a56a3-4bb2-45e6-ab8a-9780eb4d49df/bin/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.24-6b5699a [2019-11-26 02:05:49,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:05:49,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:05:49,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:05:49,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:05:49,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:05:49,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:05:49,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:05:49,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:05:49,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:05:49,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:05:49,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:05:49,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:05:49,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:05:49,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:05:49,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:05:49,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:05:49,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:05:49,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:05:49,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:05:49,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:05:49,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:05:49,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:05:49,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:05:49,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:05:49,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:05:49,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:05:49,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:05:49,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:05:49,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:05:49,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:05:49,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:05:49,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:05:49,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:05:49,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:05:49,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:05:49,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:05:49,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:05:49,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:05:49,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:05:49,421 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:05:49,422 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_445a56a3-4bb2-45e6-ab8a-9780eb4d49df/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-11-26 02:05:49,445 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:05:49,445 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:05:49,446 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:05:49,446 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-26 02:05:49,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 02:05:49,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 02:05:49,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:05:49,447 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:05:49,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:05:49,447 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:05:49,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:05:49,448 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:05:49,448 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:05:49,448 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:05:49,448 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:05:49,448 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:05:49,448 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:05:49,449 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:05:49,449 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-26 02:05:49,449 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-26 02:05:49,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:05:49,449 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:05:49,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-26 02:05:49,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:05:49,450 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:05:49,450 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:05:49,450 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-26 02:05:49,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:05:49,451 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:05:49,451 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_445a56a3-4bb2-45e6-ab8a-9780eb4d49df/bin/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 [2019-11-26 02:05:49,593 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:05:49,603 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:05:49,606 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:05:49,607 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:05:49,607 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:05:49,608 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_445a56a3-4bb2-45e6-ab8a-9780eb4d49df/bin/ukojak/../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2019-11-26 02:05:49,656 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_445a56a3-4bb2-45e6-ab8a-9780eb4d49df/bin/ukojak/data/7561b8c01/f9534568c6874153a3c5198986666de5/FLAG507be679f [2019-11-26 02:05:50,109 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:05:50,110 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_445a56a3-4bb2-45e6-ab8a-9780eb4d49df/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2019-11-26 02:05:50,121 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_445a56a3-4bb2-45e6-ab8a-9780eb4d49df/bin/ukojak/data/7561b8c01/f9534568c6874153a3c5198986666de5/FLAG507be679f [2019-11-26 02:05:50,447 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_445a56a3-4bb2-45e6-ab8a-9780eb4d49df/bin/ukojak/data/7561b8c01/f9534568c6874153a3c5198986666de5 [2019-11-26 02:05:50,450 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:05:50,451 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:05:50,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:05:50,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:05:50,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:05:50,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:05:50" (1/1) ... [2019-11-26 02:05:50,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d58060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:05:50, skipping insertion in model container [2019-11-26 02:05:50,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:05:50" (1/1) ... [2019-11-26 02:05:50,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:05:50,513 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:05:50,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:05:50,753 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:05:50,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:05:50,817 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:05:50,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:05:50 WrapperNode [2019-11-26 02:05:50,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:05:50,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:05:50,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:05:50,819 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:05:50,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:05:50" (1/1) ... [2019-11-26 02:05:50,834 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:05:50" (1/1) ... [2019-11-26 02:05:50,856 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:05:50,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:05:50,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:05:50,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:05:50,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:05:50" (1/1) ... [2019-11-26 02:05:50,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:05:50" (1/1) ... [2019-11-26 02:05:50,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:05:50" (1/1) ... [2019-11-26 02:05:50,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:05:50" (1/1) ... [2019-11-26 02:05:50,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:05:50" (1/1) ... [2019-11-26 02:05:50,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:05:50" (1/1) ... [2019-11-26 02:05:50,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:05:50" (1/1) ... [2019-11-26 02:05:50,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:05:50,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:05:50,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:05:50,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:05:50,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:05:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_445a56a3-4bb2-45e6-ab8a-9780eb4d49df/bin/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 [2019-11-26 02:05:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-11-26 02:05:50,954 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-11-26 02:05:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-11-26 02:05:50,955 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-11-26 02:05:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-11-26 02:05:50,955 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-11-26 02:05:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-11-26 02:05:50,956 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-11-26 02:05:50,956 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-11-26 02:05:50,956 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-11-26 02:05:50,956 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-11-26 02:05:50,957 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-11-26 02:05:50,957 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-11-26 02:05:50,957 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-11-26 02:05:50,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:05:50,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:05:51,597 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:05:51,597 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-26 02:05:51,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:05:51 BoogieIcfgContainer [2019-11-26 02:05:51,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:05:51,599 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-26 02:05:51,599 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-26 02:05:51,608 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-26 02:05:51,609 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:05:51" (1/1) ... [2019-11-26 02:05:51,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:05:51,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 72 states and 103 transitions. [2019-11-26 02:05:51,655 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 103 transitions. [2019-11-26 02:05:51,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-26 02:05:51,661 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:05:52,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:52,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 76 states and 109 transitions. [2019-11-26 02:05:52,123 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 109 transitions. [2019-11-26 02:05:52,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-26 02:05:52,125 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:52,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:05:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 77 states and 109 transitions. [2019-11-26 02:05:52,438 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 109 transitions. [2019-11-26 02:05:52,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-26 02:05:52,440 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:52,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:05:52,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:52,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 85 states and 124 transitions. [2019-11-26 02:05:52,739 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 124 transitions. [2019-11-26 02:05:52,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-26 02:05:52,742 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:52,813 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:05:53,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:53,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 91 states and 137 transitions. [2019-11-26 02:05:53,003 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 137 transitions. [2019-11-26 02:05:53,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-26 02:05:53,005 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:05:53,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 92 states and 139 transitions. [2019-11-26 02:05:53,150 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 139 transitions. [2019-11-26 02:05:53,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-26 02:05:53,153 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:53,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-26 02:05:53,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 93 states and 140 transitions. [2019-11-26 02:05:53,339 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 140 transitions. [2019-11-26 02:05:53,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-26 02:05:53,347 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:53,419 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-26 02:05:53,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 94 states and 141 transitions. [2019-11-26 02:05:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 141 transitions. [2019-11-26 02:05:53,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-26 02:05:53,515 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:53,539 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:05:53,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:53,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 96 states and 146 transitions. [2019-11-26 02:05:53,640 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 146 transitions. [2019-11-26 02:05:53,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-26 02:05:53,642 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:53,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:05:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 105 states and 168 transitions. [2019-11-26 02:05:53,939 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 168 transitions. [2019-11-26 02:05:53,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-26 02:05:53,941 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:53,969 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-26 02:05:54,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 107 states and 172 transitions. [2019-11-26 02:05:54,070 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions. [2019-11-26 02:05:54,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-26 02:05:54,071 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:05:54,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 111 states and 176 transitions. [2019-11-26 02:05:54,240 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 176 transitions. [2019-11-26 02:05:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-26 02:05:54,241 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:54,291 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:05:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 117 states and 191 transitions. [2019-11-26 02:05:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 191 transitions. [2019-11-26 02:05:54,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-26 02:05:54,621 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:54,641 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-26 02:05:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 122 states and 198 transitions. [2019-11-26 02:05:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 198 transitions. [2019-11-26 02:05:54,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-26 02:05:54,874 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:54,930 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:05:55,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:55,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 127 states and 211 transitions. [2019-11-26 02:05:55,257 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 211 transitions. [2019-11-26 02:05:55,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-26 02:05:55,259 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:55,279 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-26 02:05:55,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:55,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 132 states and 219 transitions. [2019-11-26 02:05:55,567 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 219 transitions. [2019-11-26 02:05:55,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-26 02:05:55,568 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:05:55,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:55,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 133 states and 221 transitions. [2019-11-26 02:05:55,708 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 221 transitions. [2019-11-26 02:05:55,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-26 02:05:55,710 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:55,732 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:05:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 134 states and 221 transitions. [2019-11-26 02:05:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 221 transitions. [2019-11-26 02:05:55,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-26 02:05:55,879 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-26 02:05:56,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 136 states and 226 transitions. [2019-11-26 02:05:56,140 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 226 transitions. [2019-11-26 02:05:56,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-26 02:05:56,141 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:56,247 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-26 02:05:56,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:56,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 146 states and 245 transitions. [2019-11-26 02:05:56,419 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 245 transitions. [2019-11-26 02:05:56,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-26 02:05:56,420 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:56,440 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-26 02:05:56,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:56,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 147 states and 245 transitions. [2019-11-26 02:05:56,524 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 245 transitions. [2019-11-26 02:05:56,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-26 02:05:56,525 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-26 02:05:56,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:56,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 151 states and 254 transitions. [2019-11-26 02:05:56,798 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 254 transitions. [2019-11-26 02:05:56,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-26 02:05:56,799 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-26 02:05:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 162 states and 281 transitions. [2019-11-26 02:05:57,920 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 281 transitions. [2019-11-26 02:05:57,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-26 02:05:57,921 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-26 02:05:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 165 states and 287 transitions. [2019-11-26 02:05:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 287 transitions. [2019-11-26 02:05:58,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-26 02:05:58,131 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:58,153 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-26 02:05:58,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:58,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 165 states and 287 transitions. [2019-11-26 02:05:58,224 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 287 transitions. [2019-11-26 02:05:58,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-26 02:05:58,225 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-26 02:05:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:58,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 170 states and 304 transitions. [2019-11-26 02:05:58,736 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 304 transitions. [2019-11-26 02:05:58,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-26 02:05:58,737 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-26 02:05:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 175 states and 315 transitions. [2019-11-26 02:05:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 315 transitions. [2019-11-26 02:05:58,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-26 02:05:58,845 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:05:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:59,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 188 states and 336 transitions. [2019-11-26 02:05:59,069 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 336 transitions. [2019-11-26 02:05:59,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-26 02:05:59,070 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:59,089 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-26 02:05:59,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:59,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 190 states and 339 transitions. [2019-11-26 02:05:59,390 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 339 transitions. [2019-11-26 02:05:59,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-26 02:05:59,392 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-26 02:05:59,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:05:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 195 states and 349 transitions. [2019-11-26 02:05:59,903 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 349 transitions. [2019-11-26 02:05:59,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-26 02:05:59,904 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:05:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:05:59,938 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-26 02:06:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:06:00,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 195 states and 349 transitions. [2019-11-26 02:06:00,021 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 349 transitions. [2019-11-26 02:06:00,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-26 02:06:00,023 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:06:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:06:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-26 02:06:00,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:06:00,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 200 states and 357 transitions. [2019-11-26 02:06:00,269 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 357 transitions. [2019-11-26 02:06:00,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-26 02:06:00,270 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:06:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:06:00,294 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-26 02:06:00,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:06:00,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 200 states and 357 transitions. [2019-11-26 02:06:00,367 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 357 transitions. [2019-11-26 02:06:00,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-26 02:06:00,373 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:06:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:06:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-26 02:06:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:06:01,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 209 states and 376 transitions. [2019-11-26 02:06:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 376 transitions. [2019-11-26 02:06:01,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-26 02:06:01,162 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:06:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:06:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-26 02:06:01,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:06:01,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 209 states and 376 transitions. [2019-11-26 02:06:01,277 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 376 transitions. [2019-11-26 02:06:01,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-26 02:06:01,279 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:06:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:06:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-26 02:06:03,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:06:03,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 226 states and 425 transitions. [2019-11-26 02:06:03,232 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 425 transitions. [2019-11-26 02:06:03,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-26 02:06:03,233 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:06:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:06:03,261 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-26 02:06:03,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-26 02:06:03,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 226 states and 425 transitions. [2019-11-26 02:06:03,354 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 425 transitions. [2019-11-26 02:06:03,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-26 02:06:03,355 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-26 02:06:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:06:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:06:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:06:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:06:03,633 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 37 iterations. [2019-11-26 02:06:03,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 26.11 02:06:03 ImpRootNode [2019-11-26 02:06:03,728 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-11-26 02:06:03,728 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:06:03,728 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:06:03,729 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:06:03,729 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:05:51" (3/4) ... [2019-11-26 02:06:03,731 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-26 02:06:03,889 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_445a56a3-4bb2-45e6-ab8a-9780eb4d49df/bin/ukojak/witness.graphml [2019-11-26 02:06:03,890 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:06:03,891 INFO L168 Benchmark]: Toolchain (without parser) took 13439.73 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 302.5 MB). Free memory was 950.1 MB in the beginning and 970.7 MB in the end (delta: -20.7 MB). Peak memory consumption was 281.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:06:03,892 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:06:03,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:06:03,893 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.36 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:06:03,893 INFO L168 Benchmark]: Boogie Preprocessor took 24.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:06:03,893 INFO L168 Benchmark]: RCFGBuilder took 716.65 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.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:06:03,894 INFO L168 Benchmark]: CodeCheck took 12129.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.6 MB). Free memory was 1.1 GB in the beginning and 991.8 MB in the end (delta: 79.2 MB). Peak memory consumption was 242.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:06:03,894 INFO L168 Benchmark]: Witness Printer took 161.36 ms. Allocated memory is still 1.3 GB. Free memory was 991.8 MB in the beginning and 970.7 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:06:03,896 INFO L335 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, 72 locations, 1 error locations. Result: UNSAFE, OverallTime: 12.0s, OverallIterations: 37, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: -278637834 SDtfs, -1400355092 SDslu, -598579604 SDs, 0 SdLazy, 1480234924 SolverSat, 177894524 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20384 GetRequests, 19127 SyntacticMatches, 1071 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46400 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2359 NumberOfCodeBlocks, 2359 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2232 ConstructedInterpolants, 0 QuantifiedInterpolants, 235686 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 29 PerfectInterpolantSequences, 960/993 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 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 ; [L390] m_i = 1 [L391] t1_i = 1 [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] [L172] COND TRUE m_i == 1 [L173] m_st = 0 [L177] COND TRUE t1_i == 1 [L178] t1_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] [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 !(E_1 == 0) [L425] RET 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 ; [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] return (__retres1); [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) [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] return (__retres1); [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) [L426] RET 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 !(E_1 == 1) [L427] RET 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 [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] return (__retres1); [L215] RET, 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 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] [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] t1_st = 2 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] [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] return (__retres1); [L215] RET, 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 [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 ; [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] return (__retres1); [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) [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] return (__retres1); [L327] tmp___0 = is_transmit1_triggered() [L329] COND TRUE \read(tmp___0) [L330] 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] RET 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] 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] [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 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] [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 ; [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] return (__retres1); [L319] tmp = is_master_triggered() [L321] COND TRUE \read(tmp) [L322] m_st = 0 [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] return (__retres1); [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\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] RET 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] t1_st = 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=2, token=1] [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] return (__retres1); [L215] RET, 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 [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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 363.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.36 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 716.65 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.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * CodeCheck took 12129.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.6 MB). Free memory was 1.1 GB in the beginning and 991.8 MB in the end (delta: 79.2 MB). Peak memory consumption was 242.8 MB. Max. memory is 11.5 GB. * Witness Printer took 161.36 ms. Allocated memory is still 1.3 GB. Free memory was 991.8 MB in the beginning and 970.7 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...