./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.01.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5074cad2-0b1d-4353-96f0-9e3715b880b0/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5074cad2-0b1d-4353-96f0-9e3715b880b0/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5074cad2-0b1d-4353-96f0-9e3715b880b0/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5074cad2-0b1d-4353-96f0-9e3715b880b0/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.01.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5074cad2-0b1d-4353-96f0-9e3715b880b0/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5074cad2-0b1d-4353-96f0-9e3715b880b0/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 18c351eab8f6ce363bd7076ce800527c30b2b6c5 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-cad4683 [2019-10-22 10:12:56,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 10:12:56,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 10:12:56,664 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 10:12:56,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 10:12:56,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 10:12:56,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 10:12:56,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 10:12:56,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 10:12:56,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 10:12:56,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 10:12:56,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 10:12:56,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 10:12:56,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 10:12:56,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 10:12:56,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 10:12:56,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 10:12:56,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 10:12:56,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 10:12:56,678 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 10:12:56,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 10:12:56,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 10:12:56,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 10:12:56,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 10:12:56,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 10:12:56,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 10:12:56,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 10:12:56,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 10:12:56,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 10:12:56,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 10:12:56,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 10:12:56,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 10:12:56,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 10:12:56,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 10:12:56,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 10:12:56,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 10:12:56,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 10:12:56,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 10:12:56,690 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 10:12:56,691 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 10:12:56,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 10:12:56,692 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5074cad2-0b1d-4353-96f0-9e3715b880b0/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-10-22 10:12:56,702 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 10:12:56,703 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 10:12:56,703 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 10:12:56,703 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-10-22 10:12:56,704 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 10:12:56,704 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 10:12:56,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 10:12:56,705 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 10:12:56,705 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 10:12:56,705 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 10:12:56,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 10:12:56,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 10:12:56,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 10:12:56,705 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 10:12:56,706 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 10:12:56,706 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 10:12:56,706 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 10:12:56,706 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 10:12:56,706 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-10-22 10:12:56,706 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-10-22 10:12:56,707 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 10:12:56,707 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 10:12:56,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-10-22 10:12:56,707 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 10:12:56,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 10:12:56,708 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 10:12:56,708 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-10-22 10:12:56,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 10:12:56,708 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 10:12:56,709 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/working_dir_5074cad2-0b1d-4353-96f0-9e3715b880b0/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 -> 18c351eab8f6ce363bd7076ce800527c30b2b6c5 [2019-10-22 10:12:56,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 10:12:56,755 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 10:12:56,758 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 10:12:56,759 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 10:12:56,759 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 10:12:56,760 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5074cad2-0b1d-4353-96f0-9e3715b880b0/bin/ukojak/../../sv-benchmarks/c/systemc/transmitter.01.cil.c [2019-10-22 10:12:56,811 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5074cad2-0b1d-4353-96f0-9e3715b880b0/bin/ukojak/data/221125f08/f03b1777b1864ca1be0ba266c79290e2/FLAGef9a03f89 [2019-10-22 10:12:57,174 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 10:12:57,175 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5074cad2-0b1d-4353-96f0-9e3715b880b0/sv-benchmarks/c/systemc/transmitter.01.cil.c [2019-10-22 10:12:57,182 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5074cad2-0b1d-4353-96f0-9e3715b880b0/bin/ukojak/data/221125f08/f03b1777b1864ca1be0ba266c79290e2/FLAGef9a03f89 [2019-10-22 10:12:57,191 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5074cad2-0b1d-4353-96f0-9e3715b880b0/bin/ukojak/data/221125f08/f03b1777b1864ca1be0ba266c79290e2 [2019-10-22 10:12:57,193 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 10:12:57,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 10:12:57,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 10:12:57,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 10:12:57,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 10:12:57,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 10:12:57" (1/1) ... [2019-10-22 10:12:57,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@129c4092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:12:57, skipping insertion in model container [2019-10-22 10:12:57,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 10:12:57" (1/1) ... [2019-10-22 10:12:57,210 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 10:12:57,242 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 10:12:57,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 10:12:57,582 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 10:12:57,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 10:12:57,658 INFO L192 MainTranslator]: Completed translation [2019-10-22 10:12:57,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:12:57 WrapperNode [2019-10-22 10:12:57,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 10:12:57,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 10:12:57,662 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 10:12:57,662 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 10:12:57,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:12:57" (1/1) ... [2019-10-22 10:12:57,678 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:12:57" (1/1) ... [2019-10-22 10:12:57,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 10:12:57,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 10:12:57,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 10:12:57,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 10:12:57,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:12:57" (1/1) ... [2019-10-22 10:12:57,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:12:57" (1/1) ... [2019-10-22 10:12:57,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:12:57" (1/1) ... [2019-10-22 10:12:57,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:12:57" (1/1) ... [2019-10-22 10:12:57,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:12:57" (1/1) ... [2019-10-22 10:12:57,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:12:57" (1/1) ... [2019-10-22 10:12:57,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:12:57" (1/1) ... [2019-10-22 10:12:57,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 10:12:57,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 10:12:57,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 10:12:57,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 10:12:57,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:12:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5074cad2-0b1d-4353-96f0-9e3715b880b0/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-10-22 10:12:57,807 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-22 10:12:57,807 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-22 10:12:57,807 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-22 10:12:57,808 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-22 10:12:57,808 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-22 10:12:57,808 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-22 10:12:57,808 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-22 10:12:57,809 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-22 10:12:57,809 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-22 10:12:57,809 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-22 10:12:57,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 10:12:57,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 10:12:58,332 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 10:12:58,333 INFO L284 CfgBuilder]: Removed 35 assume(true) statements. [2019-10-22 10:12:58,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 10:12:58 BoogieIcfgContainer [2019-10-22 10:12:58,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 10:12:58,334 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-10-22 10:12:58,335 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-10-22 10:12:58,345 INFO L275 PluginConnector]: CodeCheck initialized [2019-10-22 10:12:58,345 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 10:12:58" (1/1) ... [2019-10-22 10:12:58,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 10:12:58,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-10-22 10:12:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 61 states and 87 transitions. [2019-10-22 10:12:58,391 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2019-10-22 10:12:58,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 10:12:58,397 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-10-22 10:12:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 10:12:58,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 10:12:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-10-22 10:12:58,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 66 states and 94 transitions. [2019-10-22 10:12:58,797 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2019-10-22 10:12:58,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 10:12:58,798 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-10-22 10:12:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 10:12:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 10:12:59,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-10-22 10:12:59,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 67 states and 94 transitions. [2019-10-22 10:12:59,001 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2019-10-22 10:12:59,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 10:12:59,002 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-10-22 10:12:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 10:12:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 10:12:59,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-10-22 10:12:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 76 states and 110 transitions. [2019-10-22 10:12:59,332 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 110 transitions. [2019-10-22 10:12:59,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 10:12:59,333 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-10-22 10:12:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 10:12:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 10:12:59,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-10-22 10:12:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 77 states and 111 transitions. [2019-10-22 10:12:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2019-10-22 10:12:59,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-22 10:12:59,503 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-10-22 10:12:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 10:12:59,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 10:12:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-10-22 10:12:59,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 85 states and 125 transitions. [2019-10-22 10:12:59,787 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 125 transitions. [2019-10-22 10:12:59,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 10:12:59,788 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-10-22 10:12:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 10:12:59,842 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 10:13:00,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-10-22 10:13:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 91 states and 139 transitions. [2019-10-22 10:13:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 139 transitions. [2019-10-22 10:13:00,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 10:13:00,041 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-10-22 10:13:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 10:13:00,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 10:13:00,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-10-22 10:13:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 100 states and 160 transitions. [2019-10-22 10:13:00,434 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 160 transitions. [2019-10-22 10:13:00,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 10:13:00,435 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-10-22 10:13:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 10:13:00,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 10:13:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-10-22 10:13:00,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 105 states and 167 transitions. [2019-10-22 10:13:00,635 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 167 transitions. [2019-10-22 10:13:00,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-22 10:13:00,636 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-10-22 10:13:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 10:13:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 10:13:00,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-10-22 10:13:00,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 106 states and 169 transitions. [2019-10-22 10:13:00,725 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 169 transitions. [2019-10-22 10:13:00,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-22 10:13:00,727 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-10-22 10:13:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 10:13:00,762 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 10:13:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-10-22 10:13:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 107 states and 170 transitions. [2019-10-22 10:13:00,875 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 170 transitions. [2019-10-22 10:13:00,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 10:13:00,877 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-10-22 10:13:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 10:13:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 10:13:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-10-22 10:13:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 108 states and 171 transitions. [2019-10-22 10:13:00,962 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 171 transitions. [2019-10-22 10:13:00,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 10:13:00,963 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-10-22 10:13:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 10:13:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 10:13:01,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-10-22 10:13:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 114 states and 181 transitions. [2019-10-22 10:13:01,179 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 181 transitions. [2019-10-22 10:13:01,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 10:13:01,181 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-10-22 10:13:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 10:13:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 10:13:01,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-10-22 10:13:01,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 115 states and 181 transitions. [2019-10-22 10:13:01,299 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 181 transitions. [2019-10-22 10:13:01,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 10:13:01,300 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-10-22 10:13:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 10:13:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 10:13:01,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-10-22 10:13:01,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 120 states and 189 transitions. [2019-10-22 10:13:01,528 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 189 transitions. [2019-10-22 10:13:01,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-22 10:13:01,529 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-10-22 10:13:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 10:13:01,563 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 10:13:01,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-10-22 10:13:01,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 128 states and 204 transitions. [2019-10-22 10:13:01,993 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 204 transitions. [2019-10-22 10:13:01,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-22 10:13:01,994 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-10-22 10:13:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 10:13:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-22 10:13:02,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-10-22 10:13:02,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 130 states and 208 transitions. [2019-10-22 10:13:02,153 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 208 transitions. [2019-10-22 10:13:02,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 10:13:02,154 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-10-22 10:13:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 10:13:02,181 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-22 10:13:02,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-10-22 10:13:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 131 states and 211 transitions. [2019-10-22 10:13:02,277 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 211 transitions. [2019-10-22 10:13:02,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-22 10:13:02,278 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-10-22 10:13:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 10:13:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-22 10:13:02,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-10-22 10:13:02,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 133 states and 215 transitions. [2019-10-22 10:13:02,491 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 215 transitions. [2019-10-22 10:13:02,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-22 10:13:02,495 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-10-22 10:13:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 10:13:02,531 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-22 10:13:02,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-10-22 10:13:02,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 134 states and 216 transitions. [2019-10-22 10:13:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 216 transitions. [2019-10-22 10:13:02,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-22 10:13:02,626 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-10-22 10:13:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 10:13:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-22 10:13:02,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-10-22 10:13:02,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 136 states and 220 transitions. [2019-10-22 10:13:02,839 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 220 transitions. [2019-10-22 10:13:02,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 10:13:02,840 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-10-22 10:13:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 10:13:02,939 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-22 10:13:03,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-10-22 10:13:03,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 148 states and 247 transitions. [2019-10-22 10:13:03,810 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 247 transitions. [2019-10-22 10:13:03,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 10:13:03,812 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-10-22 10:13:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 10:13:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-22 10:13:03,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-10-22 10:13:03,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 148 states and 247 transitions. [2019-10-22 10:13:03,955 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 247 transitions. [2019-10-22 10:13:03,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 10:13:03,957 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-10-22 10:13:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 10:13:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 10:13:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 10:13:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 10:13:04,129 WARN L489 CodeCheckObserver]: This program is UNSAFE, Check terminated with 23 iterations. [2019-10-22 10:13:04,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 22.10 10:13:04 ImpRootNode [2019-10-22 10:13:04,231 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-10-22 10:13:04,231 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 10:13:04,232 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 10:13:04,232 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 10:13:04,232 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 10:12:58" (3/4) ... [2019-10-22 10:13:04,234 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 10:13:04,358 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5074cad2-0b1d-4353-96f0-9e3715b880b0/bin/ukojak/witness.graphml [2019-10-22 10:13:04,360 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 10:13:04,362 INFO L168 Benchmark]: Toolchain (without parser) took 7166.63 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 288.4 MB). Free memory was 941.8 MB in the beginning and 971.2 MB in the end (delta: -29.4 MB). Peak memory consumption was 259.0 MB. Max. memory is 11.5 GB. [2019-10-22 10:13:04,363 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 10:13:04,364 INFO L168 Benchmark]: CACSL2BoogieTranslator took 463.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -183.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2019-10-22 10:13:04,364 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.61 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: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 11.5 GB. [2019-10-22 10:13:04,364 INFO L168 Benchmark]: Boogie Preprocessor took 37.08 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: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 11.5 GB. [2019-10-22 10:13:04,364 INFO L168 Benchmark]: RCFGBuilder took 588.89 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: 60.8 MB). Peak memory consumption was 60.8 MB. Max. memory is 11.5 GB. [2019-10-22 10:13:04,365 INFO L168 Benchmark]: CodeCheck took 5896.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.2 MB). Free memory was 1.1 GB in the beginning and 981.4 MB in the end (delta: 78.8 MB). Peak memory consumption was 234.0 MB. Max. memory is 11.5 GB. [2019-10-22 10:13:04,365 INFO L168 Benchmark]: Witness Printer took 128.39 ms. Allocated memory is still 1.3 GB. Free memory was 981.4 MB in the beginning and 971.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. [2019-10-22 10:13:04,366 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 6 procedures, 61 locations, 1 error locations. Result: UNSAFE, OverallTime: 5.7s, OverallIterations: 23, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 207775096 SDtfs, 67115944 SDslu, 104822024 SDs, 0 SdLazy, 42907576 SolverSat, 23641296 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9586 GetRequests, 8778 SyntacticMatches, 696 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13439 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1090 NumberOfCodeBlocks, 1090 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1009 ConstructedInterpolants, 0 QuantifiedInterpolants, 84914 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 255/264 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: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int m_i ; [L20] int t1_i ; [L21] int M_E = 2; [L22] int T1_E = 2; [L23] int E_1 = 2; [L439] int __retres1 ; [L354] m_i = 1 [L355] t1_i = 1 [L380] int kernel_st ; [L381] int tmp ; [L382] int tmp___0 ; [L386] kernel_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L387] FCALL update_channels() VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L151] COND TRUE m_i == 1 [L152] m_st = 0 [L156] COND TRUE t1_i == 1 [L157] t1_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L389] CALL fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L240] COND FALSE !(M_E == 0) [L245] COND FALSE !(T1_E == 0) [L250] COND FALSE !(E_1 == 0) [L389] RET fire_delta_events() VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L390] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L283] int tmp ; [L284] int tmp___0 ; [L102] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L105] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L115] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L117] return (__retres1); [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) [L121] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L124] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L134] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L136] return (__retres1); [L296] tmp___0 = is_transmit1_triggered() [L298] COND FALSE !(\read(tmp___0)) [L390] RET activate_threads() VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L391] CALL reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L263] COND FALSE !(M_E == 1) [L268] COND FALSE !(T1_E == 1) [L273] COND FALSE !(E_1 == 1) [L391] RET reset_delta_events() VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L394] COND TRUE 1 [L397] kernel_st = 1 [L187] int tmp ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L191] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L166] int __retres1 ; [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 [L182] return (__retres1); [L194] RET, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L72] COND TRUE t1_pc == 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L83] COND TRUE 1 [L85] t1_pc = 1 [L86] t1_st = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L191] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L194] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L166] int __retres1 ; [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 [L182] return (__retres1); [L194] RET, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND TRUE \read(tmp_ndt_1) [L206] m_st = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L31] COND TRUE m_pc == 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L42] COND TRUE 1 [L45] E_1 = 1 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L312] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L283] int tmp ; [L284] int tmp___0 ; [L102] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L105] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L115] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L117] return (__retres1); [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) [L121] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L124] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L125] COND TRUE E_1 == 1 [L126] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L136] return (__retres1); [L296] tmp___0 = is_transmit1_triggered() [L298] COND TRUE \read(tmp___0) [L299] t1_st = 0 [L312] RET activate_threads() VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L47] E_1 = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L50] COND TRUE 1 [L52] m_pc = 1 [L53] m_st = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L72] COND FALSE !(t1_pc == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L75] COND TRUE t1_pc == 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L11] __VERIFIER_error() VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 463.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -183.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.61 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: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.08 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: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 588.89 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: 60.8 MB). Peak memory consumption was 60.8 MB. Max. memory is 11.5 GB. * CodeCheck took 5896.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.2 MB). Free memory was 1.1 GB in the beginning and 981.4 MB in the end (delta: 78.8 MB). Peak memory consumption was 234.0 MB. Max. memory is 11.5 GB. * Witness Printer took 128.39 ms. Allocated memory is still 1.3 GB. Free memory was 981.4 MB in the beginning and 971.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...