./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ad5ee4-1adf-4d1f-863d-95e1db0b6478/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ad5ee4-1adf-4d1f-863d-95e1db0b6478/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ad5ee4-1adf-4d1f-863d-95e1db0b6478/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ad5ee4-1adf-4d1f-863d-95e1db0b6478/bin/uautomizer-Dbtcem3rbc/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ad5ee4-1adf-4d1f-863d-95e1db0b6478/bin/uautomizer-Dbtcem3rbc/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ad5ee4-1adf-4d1f-863d-95e1db0b6478/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:31:22,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:31:22,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:31:22,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:31:22,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:31:22,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:31:22,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:31:22,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:31:22,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:31:22,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:31:22,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:31:22,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:31:22,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:31:22,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:31:22,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:31:22,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:31:22,624 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:31:22,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:31:22,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:31:22,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:31:22,632 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:31:22,634 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:31:22,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:31:22,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:31:22,641 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:31:22,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:31:22,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:31:22,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:31:22,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:31:22,646 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:31:22,646 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:31:22,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:31:22,649 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:31:22,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:31:22,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:31:22,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:31:22,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:31:22,653 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:31:22,653 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:31:22,654 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:31:22,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:31:22,657 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ad5ee4-1adf-4d1f-863d-95e1db0b6478/bin/uautomizer-Dbtcem3rbc/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-02 20:31:22,684 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:31:22,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:31:22,685 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:31:22,685 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:31:22,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:31:22,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:31:22,688 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:31:22,688 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-02 20:31:22,688 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-02 20:31:22,689 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-02 20:31:22,689 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-02 20:31:22,689 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-02 20:31:22,690 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-02 20:31:22,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:31:22,690 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:31:22,691 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:31:22,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:31:22,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:31:22,692 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:31:22,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-02 20:31:22,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-02 20:31:22,693 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-02 20:31:22,693 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:31:22,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:31:22,694 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-02 20:31:22,694 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:31:22,694 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-02 20:31:22,695 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:31:22,695 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:31:22,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:31:22,696 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:31:22,697 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-02 20:31:22,698 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ad5ee4-1adf-4d1f-863d-95e1db0b6478/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_86ad5ee4-1adf-4d1f-863d-95e1db0b6478/bin/uautomizer-Dbtcem3rbc 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(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 [2022-11-02 20:31:23,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:31:23,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:31:23,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:31:23,088 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:31:23,089 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:31:23,090 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ad5ee4-1adf-4d1f-863d-95e1db0b6478/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2022-11-02 20:31:23,188 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ad5ee4-1adf-4d1f-863d-95e1db0b6478/bin/uautomizer-Dbtcem3rbc/data/a27c8b8ac/e2f0cc9de5b74e1297079b41ad8dd437/FLAG02278aead [2022-11-02 20:31:23,872 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:31:23,873 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ad5ee4-1adf-4d1f-863d-95e1db0b6478/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2022-11-02 20:31:23,886 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ad5ee4-1adf-4d1f-863d-95e1db0b6478/bin/uautomizer-Dbtcem3rbc/data/a27c8b8ac/e2f0cc9de5b74e1297079b41ad8dd437/FLAG02278aead [2022-11-02 20:31:24,197 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ad5ee4-1adf-4d1f-863d-95e1db0b6478/bin/uautomizer-Dbtcem3rbc/data/a27c8b8ac/e2f0cc9de5b74e1297079b41ad8dd437 [2022-11-02 20:31:24,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:31:24,202 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:31:24,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:31:24,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:31:24,214 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:31:24,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:31:24" (1/1) ... [2022-11-02 20:31:24,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11893e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:24, skipping insertion in model container [2022-11-02 20:31:24,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:31:24" (1/1) ... [2022-11-02 20:31:24,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:31:24,268 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:31:24,523 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ad5ee4-1adf-4d1f-863d-95e1db0b6478/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[642,655] [2022-11-02 20:31:24,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:31:24,626 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:31:24,644 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ad5ee4-1adf-4d1f-863d-95e1db0b6478/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[642,655] [2022-11-02 20:31:24,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:31:24,721 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:31:24,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:24 WrapperNode [2022-11-02 20:31:24,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:31:24,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:31:24,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:31:24,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:31:24,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:24" (1/1) ... [2022-11-02 20:31:24,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:24" (1/1) ... [2022-11-02 20:31:24,783 INFO L138 Inliner]: procedures = 24, calls = 22, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 255 [2022-11-02 20:31:24,783 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:31:24,784 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:31:24,784 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:31:24,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:31:24,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:24" (1/1) ... [2022-11-02 20:31:24,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:24" (1/1) ... [2022-11-02 20:31:24,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:24" (1/1) ... [2022-11-02 20:31:24,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:24" (1/1) ... [2022-11-02 20:31:24,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:24" (1/1) ... [2022-11-02 20:31:24,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:24" (1/1) ... [2022-11-02 20:31:24,819 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:24" (1/1) ... [2022-11-02 20:31:24,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:24" (1/1) ... [2022-11-02 20:31:24,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:31:24,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:31:24,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:31:24,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:31:24,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:24" (1/1) ... [2022-11-02 20:31:24,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:31:24,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ad5ee4-1adf-4d1f-863d-95e1db0b6478/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:31:24,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ad5ee4-1adf-4d1f-863d-95e1db0b6478/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:31:24,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ad5ee4-1adf-4d1f-863d-95e1db0b6478/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-02 20:31:24,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:31:24,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:31:24,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:31:24,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:31:25,060 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:31:25,063 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:31:25,437 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:31:25,458 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:31:25,459 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 20:31:25,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:31:25 BoogieIcfgContainer [2022-11-02 20:31:25,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:31:25,466 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-02 20:31:25,467 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-02 20:31:25,472 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-02 20:31:25,473 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:31:25,473 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.11 08:31:24" (1/3) ... [2022-11-02 20:31:25,476 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b7bce68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 08:31:25, skipping insertion in model container [2022-11-02 20:31:25,476 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:31:25,476 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:24" (2/3) ... [2022-11-02 20:31:25,477 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b7bce68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 08:31:25, skipping insertion in model container [2022-11-02 20:31:25,477 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:31:25,477 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:31:25" (3/3) ... [2022-11-02 20:31:25,479 INFO L332 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2022-11-02 20:31:25,571 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-02 20:31:25,572 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-02 20:31:25,572 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-02 20:31:25,572 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-02 20:31:25,573 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-02 20:31:25,573 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-02 20:31:25,573 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-02 20:31:25,573 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-02 20:31:25,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 79 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 78 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:25,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2022-11-02 20:31:25,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:31:25,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:31:25,640 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:31:25,644 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:25,645 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-02 20:31:25,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 79 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 78 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:25,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2022-11-02 20:31:25,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:31:25,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:31:25,664 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:31:25,664 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:25,677 INFO L748 eck$LassoCheckResult]: Stem: 59#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 42#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 20#L356true assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 36#L206true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 3#L206-2true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 44#L211-1true assume { :end_inline_init_threads } true; 67#L323-2true [2022-11-02 20:31:25,678 INFO L750 eck$LassoCheckResult]: Loop: 67#L323-2true assume !false; 15#L324true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 48#L272true assume false; 28#L288true assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 60#L224-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 75#L236-1true exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 10#L237-1true stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 16#L302true assume !(0 != stop_simulation_~tmp~2#1);stop_simulation_~__retres2~0#1 := 1; 18#L309true stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 9#L310true start_simulation_#t~ret11#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 54#L330true assume !(0 != start_simulation_~tmp~3#1); 67#L323-2true [2022-11-02 20:31:25,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:25,688 INFO L85 PathProgramCache]: Analyzing trace with hash 889479019, now seen corresponding path program 1 times [2022-11-02 20:31:25,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:25,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634551555] [2022-11-02 20:31:25,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:25,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:25,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:25,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:25,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634551555] [2022-11-02 20:31:25,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634551555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:25,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:25,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:31:25,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217600510] [2022-11-02 20:31:25,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:25,991 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:31:25,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:25,995 INFO L85 PathProgramCache]: Analyzing trace with hash 740616813, now seen corresponding path program 1 times [2022-11-02 20:31:25,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:25,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486213135] [2022-11-02 20:31:25,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:25,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:26,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:26,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486213135] [2022-11-02 20:31:26,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486213135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:26,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:26,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:26,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216719185] [2022-11-02 20:31:26,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:26,035 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:31:26,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:26,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:26,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:26,087 INFO L87 Difference]: Start difference. First operand has 79 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 78 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:26,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:31:26,130 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2022-11-02 20:31:26,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 106 transitions. [2022-11-02 20:31:26,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2022-11-02 20:31:26,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 71 states and 100 transitions. [2022-11-02 20:31:26,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2022-11-02 20:31:26,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2022-11-02 20:31:26,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 100 transitions. [2022-11-02 20:31:26,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:26,144 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 100 transitions. [2022-11-02 20:31:26,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 100 transitions. [2022-11-02 20:31:26,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-02 20:31:26,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.408450704225352) internal successors, (100), 70 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:26,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2022-11-02 20:31:26,241 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 100 transitions. [2022-11-02 20:31:26,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:26,264 INFO L428 stractBuchiCegarLoop]: Abstraction has 71 states and 100 transitions. [2022-11-02 20:31:26,264 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-02 20:31:26,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 100 transitions. [2022-11-02 20:31:26,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2022-11-02 20:31:26,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:31:26,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:31:26,274 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:31:26,274 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:26,274 INFO L748 eck$LassoCheckResult]: Stem: 230#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 192#L356 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 193#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 171#L206-2 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 172#L211-1 assume { :end_inline_init_threads } true; 221#L323-2 [2022-11-02 20:31:26,275 INFO L750 eck$LassoCheckResult]: Loop: 221#L323-2 assume !false; 190#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 174#L272 assume !false; 226#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 185#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 186#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 218#L237 eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 219#L252 assume !(0 != eval_~tmp___1~0#1); 205#L288 assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 206#L224-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 231#L236-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 181#L237-1 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 182#L302 assume !(0 != stop_simulation_~tmp~2#1);stop_simulation_~__retres2~0#1 := 1; 191#L309 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 179#L310 start_simulation_#t~ret11#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 180#L330 assume !(0 != start_simulation_~tmp~3#1); 221#L323-2 [2022-11-02 20:31:26,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:26,275 INFO L85 PathProgramCache]: Analyzing trace with hash 889477097, now seen corresponding path program 1 times [2022-11-02 20:31:26,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:26,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480071054] [2022-11-02 20:31:26,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:26,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:26,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:26,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:26,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480071054] [2022-11-02 20:31:26,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480071054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:26,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:26,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:31:26,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349976341] [2022-11-02 20:31:26,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:26,343 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:31:26,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:26,344 INFO L85 PathProgramCache]: Analyzing trace with hash 993904031, now seen corresponding path program 1 times [2022-11-02 20:31:26,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:26,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935185960] [2022-11-02 20:31:26,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:26,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:26,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:26,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:26,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935185960] [2022-11-02 20:31:26,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935185960] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:26,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:26,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:31:26,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426319536] [2022-11-02 20:31:26,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:26,520 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:31:26,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:26,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:26,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:26,523 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. cyclomatic complexity: 30 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:26,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:31:26,550 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2022-11-02 20:31:26,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 99 transitions. [2022-11-02 20:31:26,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2022-11-02 20:31:26,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 99 transitions. [2022-11-02 20:31:26,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2022-11-02 20:31:26,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2022-11-02 20:31:26,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 99 transitions. [2022-11-02 20:31:26,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:26,561 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 99 transitions. [2022-11-02 20:31:26,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 99 transitions. [2022-11-02 20:31:26,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-02 20:31:26,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 70 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:26,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2022-11-02 20:31:26,570 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 99 transitions. [2022-11-02 20:31:26,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:26,576 INFO L428 stractBuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2022-11-02 20:31:26,578 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-02 20:31:26,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 99 transitions. [2022-11-02 20:31:26,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2022-11-02 20:31:26,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:31:26,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:31:26,582 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:31:26,585 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:26,585 INFO L748 eck$LassoCheckResult]: Stem: 384#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 371#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 343#L356 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 344#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 322#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 323#L211-1 assume { :end_inline_init_threads } true; 372#L323-2 [2022-11-02 20:31:26,586 INFO L750 eck$LassoCheckResult]: Loop: 372#L323-2 assume !false; 342#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 325#L272 assume !false; 377#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 338#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 339#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 368#L237 eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 369#L252 assume !(0 != eval_~tmp___1~0#1); 356#L288 assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 357#L224-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 381#L236-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 332#L237-1 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 333#L302 assume !(0 != stop_simulation_~tmp~2#1);stop_simulation_~__retres2~0#1 := 1; 341#L309 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 330#L310 start_simulation_#t~ret11#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 331#L330 assume !(0 != start_simulation_~tmp~3#1); 372#L323-2 [2022-11-02 20:31:26,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:26,587 INFO L85 PathProgramCache]: Analyzing trace with hash 889477035, now seen corresponding path program 1 times [2022-11-02 20:31:26,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:26,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237259120] [2022-11-02 20:31:26,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:26,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:31:26,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:31:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:31:26,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:31:26,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:26,646 INFO L85 PathProgramCache]: Analyzing trace with hash 993904031, now seen corresponding path program 2 times [2022-11-02 20:31:26,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:26,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458082778] [2022-11-02 20:31:26,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:26,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:26,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:26,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458082778] [2022-11-02 20:31:26,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458082778] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:26,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:26,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:31:26,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080780898] [2022-11-02 20:31:26,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:26,754 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:31:26,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:26,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:31:26,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:31:26,756 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. cyclomatic complexity: 29 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:26,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:31:26,906 INFO L93 Difference]: Finished difference Result 139 states and 192 transitions. [2022-11-02 20:31:26,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 192 transitions. [2022-11-02 20:31:26,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 133 [2022-11-02 20:31:26,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 139 states and 192 transitions. [2022-11-02 20:31:26,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2022-11-02 20:31:26,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2022-11-02 20:31:26,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 192 transitions. [2022-11-02 20:31:26,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:26,912 INFO L218 hiAutomatonCegarLoop]: Abstraction has 139 states and 192 transitions. [2022-11-02 20:31:26,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 192 transitions. [2022-11-02 20:31:26,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 74. [2022-11-02 20:31:26,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 73 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:26,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2022-11-02 20:31:26,919 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 102 transitions. [2022-11-02 20:31:26,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:31:26,921 INFO L428 stractBuchiCegarLoop]: Abstraction has 74 states and 102 transitions. [2022-11-02 20:31:26,921 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-02 20:31:26,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 102 transitions. [2022-11-02 20:31:26,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-11-02 20:31:26,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:31:26,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:31:26,924 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:31:26,924 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:26,924 INFO L748 eck$LassoCheckResult]: Stem: 608#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 598#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 570#L356 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 571#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 544#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 545#L211-1 assume { :end_inline_init_threads } true; 599#L323-2 [2022-11-02 20:31:26,925 INFO L750 eck$LassoCheckResult]: Loop: 599#L323-2 assume !false; 567#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 551#L272 assume !false; 604#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 562#L224 assume !(0 == ~p_dw_st~0); 564#L228 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2#1 := 0; 569#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 614#L237 eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 615#L252 assume !(0 != eval_~tmp___1~0#1); 583#L288 assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 584#L224-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 609#L236-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 558#L237-1 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 559#L302 assume !(0 != stop_simulation_~tmp~2#1);stop_simulation_~__retres2~0#1 := 1; 568#L309 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 556#L310 start_simulation_#t~ret11#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 557#L330 assume !(0 != start_simulation_~tmp~3#1); 599#L323-2 [2022-11-02 20:31:26,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:26,925 INFO L85 PathProgramCache]: Analyzing trace with hash 889477035, now seen corresponding path program 2 times [2022-11-02 20:31:26,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:26,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701603195] [2022-11-02 20:31:26,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:26,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:31:26,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:31:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:31:26,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:31:26,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:26,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1089411781, now seen corresponding path program 1 times [2022-11-02 20:31:26,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:26,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081118385] [2022-11-02 20:31:26,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:26,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:27,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:27,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081118385] [2022-11-02 20:31:27,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081118385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:27,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:27,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:31:27,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076591893] [2022-11-02 20:31:27,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:27,014 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:31:27,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:27,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:27,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:27,016 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. cyclomatic complexity: 29 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:31:27,085 INFO L93 Difference]: Finished difference Result 125 states and 170 transitions. [2022-11-02 20:31:27,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 170 transitions. [2022-11-02 20:31:27,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 117 [2022-11-02 20:31:27,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 170 transitions. [2022-11-02 20:31:27,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2022-11-02 20:31:27,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2022-11-02 20:31:27,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 170 transitions. [2022-11-02 20:31:27,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:27,102 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 170 transitions. [2022-11-02 20:31:27,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 170 transitions. [2022-11-02 20:31:27,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2022-11-02 20:31:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 108 states have (on average 1.3518518518518519) internal successors, (146), 107 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:27,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2022-11-02 20:31:27,110 INFO L240 hiAutomatonCegarLoop]: Abstraction has 108 states and 146 transitions. [2022-11-02 20:31:27,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:27,122 INFO L428 stractBuchiCegarLoop]: Abstraction has 108 states and 146 transitions. [2022-11-02 20:31:27,123 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-02 20:31:27,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 146 transitions. [2022-11-02 20:31:27,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 [2022-11-02 20:31:27,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:31:27,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:31:27,125 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:27,126 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:27,126 INFO L748 eck$LassoCheckResult]: Stem: 816#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 805#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 777#L356 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 778#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 747#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 748#L211-1 assume { :end_inline_init_threads } true; 806#L323-2 assume !false; 837#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 833#L272 [2022-11-02 20:31:27,126 INFO L750 eck$LassoCheckResult]: Loop: 833#L272 assume !false; 832#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 831#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 830#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 828#L237 eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 826#L252 assume 0 != eval_~tmp___1~0#1; 825#L252-1 assume 0 == ~p_dw_st~0;eval_~tmp~1#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1; 823#L261 assume !(0 != eval_~tmp~1#1); 824#L257 assume !(0 == ~c_dr_st~0); 833#L272 [2022-11-02 20:31:27,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:27,127 INFO L85 PathProgramCache]: Analyzing trace with hash 88939597, now seen corresponding path program 1 times [2022-11-02 20:31:27,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:27,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396622859] [2022-11-02 20:31:27,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:27,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:31:27,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:31:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:31:27,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:31:27,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:27,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1880932388, now seen corresponding path program 1 times [2022-11-02 20:31:27,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:27,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536152527] [2022-11-02 20:31:27,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:27,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:31:27,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:31:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:31:27,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:31:27,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:27,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1617118888, now seen corresponding path program 1 times [2022-11-02 20:31:27,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:27,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450347824] [2022-11-02 20:31:27,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:27,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:27,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:27,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:27,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450347824] [2022-11-02 20:31:27,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450347824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:27,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:27,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:27,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944273864] [2022-11-02 20:31:27,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:27,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:27,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:27,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:27,309 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. cyclomatic complexity: 39 Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:31:27,357 INFO L93 Difference]: Finished difference Result 189 states and 254 transitions. [2022-11-02 20:31:27,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 254 transitions. [2022-11-02 20:31:27,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 181 [2022-11-02 20:31:27,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 189 states and 254 transitions. [2022-11-02 20:31:27,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 189 [2022-11-02 20:31:27,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 189 [2022-11-02 20:31:27,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 254 transitions. [2022-11-02 20:31:27,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:27,394 INFO L218 hiAutomatonCegarLoop]: Abstraction has 189 states and 254 transitions. [2022-11-02 20:31:27,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 254 transitions. [2022-11-02 20:31:27,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 151. [2022-11-02 20:31:27,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 150 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:27,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 202 transitions. [2022-11-02 20:31:27,415 INFO L240 hiAutomatonCegarLoop]: Abstraction has 151 states and 202 transitions. [2022-11-02 20:31:27,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:27,417 INFO L428 stractBuchiCegarLoop]: Abstraction has 151 states and 202 transitions. [2022-11-02 20:31:27,417 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-02 20:31:27,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 202 transitions. [2022-11-02 20:31:27,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2022-11-02 20:31:27,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:31:27,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:31:27,420 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:27,421 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:27,421 INFO L748 eck$LassoCheckResult]: Stem: 1123#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1111#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1080#L356 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 1081#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1056#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1057#L211-1 assume { :end_inline_init_threads } true; 1112#L323-2 assume !false; 1184#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 1183#L272 [2022-11-02 20:31:27,421 INFO L750 eck$LassoCheckResult]: Loop: 1183#L272 assume !false; 1182#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 1181#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 1133#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 1108#L237 eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 1109#L252 assume 0 != eval_~tmp___1~0#1; 1122#L252-1 assume 0 == ~p_dw_st~0;eval_~tmp~1#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1; 1138#L261 assume !(0 != eval_~tmp~1#1); 1140#L257 assume 0 == ~c_dr_st~0;eval_~tmp___0~1#1 := eval_#t~nondet9#1;havoc eval_#t~nondet9#1; 1165#L276 assume !(0 != eval_~tmp___0~1#1); 1183#L272 [2022-11-02 20:31:27,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:27,422 INFO L85 PathProgramCache]: Analyzing trace with hash 88939597, now seen corresponding path program 2 times [2022-11-02 20:31:27,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:27,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221820715] [2022-11-02 20:31:27,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:27,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:31:27,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:31:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:31:27,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:31:27,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:27,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1820641234, now seen corresponding path program 1 times [2022-11-02 20:31:27,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:27,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392032349] [2022-11-02 20:31:27,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:27,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:31:27,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:31:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:31:27,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:31:27,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:27,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1408918906, now seen corresponding path program 1 times [2022-11-02 20:31:27,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:27,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852217214] [2022-11-02 20:31:27,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:27,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:31:27,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:31:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:31:27,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:31:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:31:28,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:31:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:31:28,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.11 08:31:28 BoogieIcfgContainer [2022-11-02 20:31:28,435 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-02 20:31:28,436 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:31:28,436 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:31:28,437 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:31:28,437 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:31:25" (3/4) ... [2022-11-02 20:31:28,441 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-11-02 20:31:28,498 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ad5ee4-1adf-4d1f-863d-95e1db0b6478/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:31:28,499 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:31:28,500 INFO L158 Benchmark]: Toolchain (without parser) took 4297.75ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 87.2MB in the beginning and 77.5MB in the end (delta: 9.7MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2022-11-02 20:31:28,500 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory is still 38.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:31:28,501 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.03ms. Allocated memory is still 117.4MB. Free memory was 87.2MB in the beginning and 90.5MB in the end (delta: -3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:31:28,502 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.17ms. Allocated memory is still 117.4MB. Free memory was 90.5MB in the beginning and 88.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:31:28,502 INFO L158 Benchmark]: Boogie Preprocessor took 40.55ms. Allocated memory is still 117.4MB. Free memory was 88.5MB in the beginning and 86.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:31:28,503 INFO L158 Benchmark]: RCFGBuilder took 635.09ms. Allocated memory is still 117.4MB. Free memory was 86.9MB in the beginning and 71.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-02 20:31:28,503 INFO L158 Benchmark]: BuchiAutomizer took 2969.03ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 71.0MB in the beginning and 80.5MB in the end (delta: -9.5MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2022-11-02 20:31:28,504 INFO L158 Benchmark]: Witness Printer took 62.99ms. Allocated memory is still 151.0MB. Free memory was 80.5MB in the beginning and 77.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:31:28,507 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory is still 38.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 514.03ms. Allocated memory is still 117.4MB. Free memory was 87.2MB in the beginning and 90.5MB in the end (delta: -3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.17ms. Allocated memory is still 117.4MB. Free memory was 90.5MB in the beginning and 88.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.55ms. Allocated memory is still 117.4MB. Free memory was 88.5MB in the beginning and 86.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 635.09ms. Allocated memory is still 117.4MB. Free memory was 86.9MB in the beginning and 71.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 2969.03ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 71.0MB in the beginning and 80.5MB in the end (delta: -9.5MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * Witness Printer took 62.99ms. Allocated memory is still 151.0MB. Free memory was 80.5MB in the beginning and 77.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 151 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 120 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 586 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 586 mSDsluCounter, 972 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 433 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 539 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 247]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L24] int q_buf_0 ; [L25] int q_free ; [L26] int q_read_ev ; [L27] int q_write_ev ; [L28] int p_num_write ; [L29] int p_last_write ; [L30] int p_dw_st ; [L31] int p_dw_pc ; [L32] int p_dw_i ; [L33] int c_num_read ; [L34] int c_last_read ; [L35] int c_dr_st ; [L36] int c_dr_pc ; [L37] int c_dr_i ; [L144] static int a_t ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0] [L360] int __retres1 ; [L364] CALL init_model() [L346] q_free = 1 [L347] q_write_ev = 2 [L348] q_read_ev = q_write_ev [L349] p_num_write = 0 [L350] p_dw_pc = 0 [L351] p_dw_i = 1 [L352] c_num_read = 0 [L353] c_dr_pc = 0 [L354] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L364] RET init_model() [L365] CALL start_simulation() [L314] int kernel_st ; [L315] int tmp ; [L319] kernel_st = 0 [L320] CALL init_threads() [L206] COND TRUE (int )p_dw_i == 1 [L207] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L211] COND TRUE (int )c_dr_i == 1 [L212] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L320] RET init_threads() [L323] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L326] kernel_st = 1 [L327] CALL eval() [L241] int tmp ; [L242] int tmp___0 ; [L243] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] Loop: [L247] COND TRUE 1 [L250] CALL, EXPR exists_runnable_thread() [L221] int __retres1 ; [L224] COND TRUE (int )p_dw_st == 0 [L225] __retres1 = 1 [L237] return (__retres1); [L250] RET, EXPR exists_runnable_thread() [L250] tmp___1 = exists_runnable_thread() [L252] COND TRUE \read(tmp___1) [L257] COND TRUE (int )p_dw_st == 0 [L259] tmp = __VERIFIER_nondet_int() [L261] COND FALSE !(\read(tmp)) [L272] COND TRUE (int )c_dr_st == 0 [L274] tmp___0 = __VERIFIER_nondet_int() [L276] COND FALSE !(\read(tmp___0)) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 247]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L24] int q_buf_0 ; [L25] int q_free ; [L26] int q_read_ev ; [L27] int q_write_ev ; [L28] int p_num_write ; [L29] int p_last_write ; [L30] int p_dw_st ; [L31] int p_dw_pc ; [L32] int p_dw_i ; [L33] int c_num_read ; [L34] int c_last_read ; [L35] int c_dr_st ; [L36] int c_dr_pc ; [L37] int c_dr_i ; [L144] static int a_t ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0] [L360] int __retres1 ; [L364] CALL init_model() [L346] q_free = 1 [L347] q_write_ev = 2 [L348] q_read_ev = q_write_ev [L349] p_num_write = 0 [L350] p_dw_pc = 0 [L351] p_dw_i = 1 [L352] c_num_read = 0 [L353] c_dr_pc = 0 [L354] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L364] RET init_model() [L365] CALL start_simulation() [L314] int kernel_st ; [L315] int tmp ; [L319] kernel_st = 0 [L320] CALL init_threads() [L206] COND TRUE (int )p_dw_i == 1 [L207] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L211] COND TRUE (int )c_dr_i == 1 [L212] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L320] RET init_threads() [L323] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L326] kernel_st = 1 [L327] CALL eval() [L241] int tmp ; [L242] int tmp___0 ; [L243] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] Loop: [L247] COND TRUE 1 [L250] CALL, EXPR exists_runnable_thread() [L221] int __retres1 ; [L224] COND TRUE (int )p_dw_st == 0 [L225] __retres1 = 1 [L237] return (__retres1); [L250] RET, EXPR exists_runnable_thread() [L250] tmp___1 = exists_runnable_thread() [L252] COND TRUE \read(tmp___1) [L257] COND TRUE (int )p_dw_st == 0 [L259] tmp = __VERIFIER_nondet_int() [L261] COND FALSE !(\read(tmp)) [L272] COND TRUE (int )c_dr_st == 0 [L274] tmp___0 = __VERIFIER_nondet_int() [L276] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-11-02 20:31:28,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86ad5ee4-1adf-4d1f-863d-95e1db0b6478/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)