./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix001.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b 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_ceac05a8-f491-4f88-8f27-e3e6a171cb5f/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceac05a8-f491-4f88-8f27-e3e6a171cb5f/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceac05a8-f491-4f88-8f27-e3e6a171cb5f/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceac05a8-f491-4f88-8f27-e3e6a171cb5f/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix001.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceac05a8-f491-4f88-8f27-e3e6a171cb5f/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceac05a8-f491-4f88-8f27-e3e6a171cb5f/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 54b7204af3591799bdde98d626e5c17b99e9c1ebc668ecbb3e0b1bb3bb8aa3c2 --- 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-8393723 [2022-11-18 20:03:39,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:03:39,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:03:39,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:03:39,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:03:39,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:03:39,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:03:39,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:03:39,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:03:39,953 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:03:39,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:03:39,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:03:39,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:03:39,957 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:03:39,958 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:03:39,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:03:39,961 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:03:39,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:03:39,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:03:39,966 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:03:39,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:03:39,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:03:39,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:03:39,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:03:39,975 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:03:39,975 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:03:39,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:03:39,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:03:39,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:03:39,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:03:39,979 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:03:39,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:03:39,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:03:39,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:03:39,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:03:39,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:03:39,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:03:39,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:03:39,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:03:39,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:03:39,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:03:39,988 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceac05a8-f491-4f88-8f27-e3e6a171cb5f/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:03:40,011 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:03:40,011 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:03:40,012 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:03:40,012 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:03:40,013 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:03:40,013 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:03:40,014 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:03:40,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:03:40,014 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:03:40,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:03:40,015 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:03:40,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:03:40,015 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:03:40,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:03:40,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:03:40,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:03:40,016 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:03:40,016 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:03:40,017 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:03:40,017 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:03:40,017 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:03:40,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:03:40,018 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:03:40,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:03:40,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:03:40,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:03:40,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:03:40,019 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:03:40,019 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:03:40,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:03:40,019 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:03:40,019 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:03:40,020 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:03:40,020 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_ceac05a8-f491-4f88-8f27-e3e6a171cb5f/bin/uautomizer-TMbwUNV5ro/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_ceac05a8-f491-4f88-8f27-e3e6a171cb5f/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 54b7204af3591799bdde98d626e5c17b99e9c1ebc668ecbb3e0b1bb3bb8aa3c2 [2022-11-18 20:03:40,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:03:40,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:03:40,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:03:40,312 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:03:40,314 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:03:40,316 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceac05a8-f491-4f88-8f27-e3e6a171cb5f/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix001.oepc.i [2022-11-18 20:03:40,408 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceac05a8-f491-4f88-8f27-e3e6a171cb5f/bin/uautomizer-TMbwUNV5ro/data/05427240e/2f15a8bbe90349368272f6968d23454e/FLAG15fa79e2b [2022-11-18 20:03:40,918 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:03:40,919 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceac05a8-f491-4f88-8f27-e3e6a171cb5f/sv-benchmarks/c/pthread-wmm/mix001.oepc.i [2022-11-18 20:03:40,934 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceac05a8-f491-4f88-8f27-e3e6a171cb5f/bin/uautomizer-TMbwUNV5ro/data/05427240e/2f15a8bbe90349368272f6968d23454e/FLAG15fa79e2b [2022-11-18 20:03:41,209 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceac05a8-f491-4f88-8f27-e3e6a171cb5f/bin/uautomizer-TMbwUNV5ro/data/05427240e/2f15a8bbe90349368272f6968d23454e [2022-11-18 20:03:41,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:03:41,213 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:03:41,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:03:41,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:03:41,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:03:41,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:03:41" (1/1) ... [2022-11-18 20:03:41,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a70df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:41, skipping insertion in model container [2022-11-18 20:03:41,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:03:41" (1/1) ... [2022-11-18 20:03:41,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:03:41,283 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:03:41,553 WARN L234 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_ceac05a8-f491-4f88-8f27-e3e6a171cb5f/sv-benchmarks/c/pthread-wmm/mix001.oepc.i[988,1001] [2022-11-18 20:03:41,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:03:41,914 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:03:41,930 WARN L234 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_ceac05a8-f491-4f88-8f27-e3e6a171cb5f/sv-benchmarks/c/pthread-wmm/mix001.oepc.i[988,1001] [2022-11-18 20:03:41,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:03:42,018 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:03:42,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42 WrapperNode [2022-11-18 20:03:42,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:03:42,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:03:42,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:03:42,020 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:03:42,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (1/1) ... [2022-11-18 20:03:42,045 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (1/1) ... [2022-11-18 20:03:42,075 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-11-18 20:03:42,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:03:42,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:03:42,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:03:42,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:03:42,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (1/1) ... [2022-11-18 20:03:42,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (1/1) ... [2022-11-18 20:03:42,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (1/1) ... [2022-11-18 20:03:42,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (1/1) ... [2022-11-18 20:03:42,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (1/1) ... [2022-11-18 20:03:42,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (1/1) ... [2022-11-18 20:03:42,108 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (1/1) ... [2022-11-18 20:03:42,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (1/1) ... [2022-11-18 20:03:42,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:03:42,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:03:42,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:03:42,115 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:03:42,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (1/1) ... [2022-11-18 20:03:42,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:03:42,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceac05a8-f491-4f88-8f27-e3e6a171cb5f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:03:42,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceac05a8-f491-4f88-8f27-e3e6a171cb5f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:03:42,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceac05a8-f491-4f88-8f27-e3e6a171cb5f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:03:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:03:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 20:03:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:03:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:03:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:03:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 20:03:42,234 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 20:03:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 20:03:42,235 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 20:03:42,235 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 20:03:42,235 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 20:03:42,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:03:42,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 20:03:42,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:03:42,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:03:42,242 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 20:03:42,386 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:03:42,388 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:03:42,917 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:03:43,207 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:03:43,207 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:03:43,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:03:43 BoogieIcfgContainer [2022-11-18 20:03:43,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:03:43,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:03:43,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:03:43,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:03:43,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:03:41" (1/3) ... [2022-11-18 20:03:43,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709858b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:03:43, skipping insertion in model container [2022-11-18 20:03:43,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:42" (2/3) ... [2022-11-18 20:03:43,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709858b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:03:43, skipping insertion in model container [2022-11-18 20:03:43,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:03:43" (3/3) ... [2022-11-18 20:03:43,223 INFO L112 eAbstractionObserver]: Analyzing ICFG mix001.oepc.i [2022-11-18 20:03:43,235 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 20:03:43,246 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:03:43,246 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 20:03:43,247 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:03:43,339 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 20:03:43,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 259 flow [2022-11-18 20:03:43,489 INFO L130 PetriNetUnfolder]: 2/119 cut-off events. [2022-11-18 20:03:43,490 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:03:43,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 2/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-11-18 20:03:43,497 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 122 transitions, 259 flow [2022-11-18 20:03:43,507 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 119 transitions, 247 flow [2022-11-18 20:03:43,534 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:03:43,548 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5e7f2d5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:03:43,549 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-18 20:03:43,565 INFO L130 PetriNetUnfolder]: 0/50 cut-off events. [2022-11-18 20:03:43,566 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:03:43,567 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:03:43,568 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:43,569 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:03:43,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:43,578 INFO L85 PathProgramCache]: Analyzing trace with hash -2036367296, now seen corresponding path program 1 times [2022-11-18 20:03:43,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:43,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721108824] [2022-11-18 20:03:43,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:43,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:44,344 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-18 20:03:44,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:44,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721108824] [2022-11-18 20:03:44,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721108824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:44,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:44,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:03:44,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139620859] [2022-11-18 20:03:44,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:44,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:03:44,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:44,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:03:44,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:44,417 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 122 [2022-11-18 20:03:44,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 119 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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-18 20:03:44,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:03:44,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 122 [2022-11-18 20:03:44,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:03:44,727 INFO L130 PetriNetUnfolder]: 82/321 cut-off events. [2022-11-18 20:03:44,728 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-11-18 20:03:44,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 321 events. 82/321 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1363 event pairs, 10 based on Foata normal form. 31/330 useless extension candidates. Maximal degree in co-relation 439. Up to 118 conditions per place. [2022-11-18 20:03:44,737 INFO L137 encePairwiseOnDemand]: 117/122 looper letters, 15 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2022-11-18 20:03:44,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 121 transitions, 291 flow [2022-11-18 20:03:44,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:03:44,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:03:44,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2022-11-18 20:03:44,764 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9371584699453552 [2022-11-18 20:03:44,765 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2022-11-18 20:03:44,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2022-11-18 20:03:44,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:03:44,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2022-11-18 20:03:44,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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-18 20:03:44,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 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-18 20:03:44,795 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 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-18 20:03:44,798 INFO L175 Difference]: Start difference. First operand has 127 places, 119 transitions, 247 flow. Second operand 3 states and 343 transitions. [2022-11-18 20:03:44,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 121 transitions, 291 flow [2022-11-18 20:03:44,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 121 transitions, 286 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 20:03:44,811 INFO L231 Difference]: Finished difference. Result has 124 places, 115 transitions, 240 flow [2022-11-18 20:03:44,814 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=124, PETRI_TRANSITIONS=115} [2022-11-18 20:03:44,820 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, -3 predicate places. [2022-11-18 20:03:44,821 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 115 transitions, 240 flow [2022-11-18 20:03:44,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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-18 20:03:44,822 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:03:44,823 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:44,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:03:44,824 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:03:44,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:44,825 INFO L85 PathProgramCache]: Analyzing trace with hash -12578768, now seen corresponding path program 1 times [2022-11-18 20:03:44,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:44,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919930995] [2022-11-18 20:03:44,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:44,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:45,535 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-18 20:03:45,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:45,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919930995] [2022-11-18 20:03:45,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919930995] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:45,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:45,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:03:45,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702438649] [2022-11-18 20:03:45,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:45,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:03:45,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:45,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:03:45,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:03:45,545 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 122 [2022-11-18 20:03:45,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 115 transitions, 240 flow. Second operand has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 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-18 20:03:45,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:03:45,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 122 [2022-11-18 20:03:45,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:03:46,452 INFO L130 PetriNetUnfolder]: 682/1928 cut-off events. [2022-11-18 20:03:46,452 INFO L131 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2022-11-18 20:03:46,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3117 conditions, 1928 events. 682/1928 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 14737 event pairs, 122 based on Foata normal form. 0/1875 useless extension candidates. Maximal degree in co-relation 3061. Up to 553 conditions per place. [2022-11-18 20:03:46,472 INFO L137 encePairwiseOnDemand]: 116/122 looper letters, 21 selfloop transitions, 2 changer transitions 54/162 dead transitions. [2022-11-18 20:03:46,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 162 transitions, 480 flow [2022-11-18 20:03:46,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:03:46,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 20:03:46,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 959 transitions. [2022-11-18 20:03:46,478 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8734061930783242 [2022-11-18 20:03:46,478 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 959 transitions. [2022-11-18 20:03:46,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 959 transitions. [2022-11-18 20:03:46,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:03:46,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 959 transitions. [2022-11-18 20:03:46,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.55555555555556) internal successors, (959), 9 states have internal predecessors, (959), 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-18 20:03:46,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 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-18 20:03:46,488 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 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-18 20:03:46,488 INFO L175 Difference]: Start difference. First operand has 124 places, 115 transitions, 240 flow. Second operand 9 states and 959 transitions. [2022-11-18 20:03:46,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 162 transitions, 480 flow [2022-11-18 20:03:46,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 162 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:03:46,495 INFO L231 Difference]: Finished difference. Result has 137 places, 103 transitions, 232 flow [2022-11-18 20:03:46,496 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=232, PETRI_PLACES=137, PETRI_TRANSITIONS=103} [2022-11-18 20:03:46,497 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, 10 predicate places. [2022-11-18 20:03:46,497 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 103 transitions, 232 flow [2022-11-18 20:03:46,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 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-18 20:03:46,498 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:03:46,498 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:46,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:03:46,499 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:03:46,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:46,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1743516090, now seen corresponding path program 1 times [2022-11-18 20:03:46,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:46,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271344434] [2022-11-18 20:03:46,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:46,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:46,835 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-18 20:03:46,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:46,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271344434] [2022-11-18 20:03:46,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271344434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:46,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:46,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:03:46,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076792205] [2022-11-18 20:03:46,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:46,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:03:46,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:46,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:03:46,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:03:46,841 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 122 [2022-11-18 20:03:46,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 103 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 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-18 20:03:46,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:03:46,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 122 [2022-11-18 20:03:46,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:03:47,767 INFO L130 PetriNetUnfolder]: 1291/2419 cut-off events. [2022-11-18 20:03:47,767 INFO L131 PetriNetUnfolder]: For 608/608 co-relation queries the response was YES. [2022-11-18 20:03:47,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5080 conditions, 2419 events. 1291/2419 cut-off events. For 608/608 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13964 event pairs, 476 based on Foata normal form. 60/2375 useless extension candidates. Maximal degree in co-relation 5012. Up to 1115 conditions per place. [2022-11-18 20:03:47,787 INFO L137 encePairwiseOnDemand]: 115/122 looper letters, 32 selfloop transitions, 3 changer transitions 52/164 dead transitions. [2022-11-18 20:03:47,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 164 transitions, 551 flow [2022-11-18 20:03:47,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:03:47,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 20:03:47,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 999 transitions. [2022-11-18 20:03:47,792 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8188524590163935 [2022-11-18 20:03:47,792 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 999 transitions. [2022-11-18 20:03:47,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 999 transitions. [2022-11-18 20:03:47,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:03:47,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 999 transitions. [2022-11-18 20:03:47,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.9) internal successors, (999), 10 states have internal predecessors, (999), 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-18 20:03:47,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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-18 20:03:47,801 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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-18 20:03:47,801 INFO L175 Difference]: Start difference. First operand has 137 places, 103 transitions, 232 flow. Second operand 10 states and 999 transitions. [2022-11-18 20:03:47,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 164 transitions, 551 flow [2022-11-18 20:03:47,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 164 transitions, 517 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-11-18 20:03:47,839 INFO L231 Difference]: Finished difference. Result has 127 places, 103 transitions, 238 flow [2022-11-18 20:03:47,840 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=238, PETRI_PLACES=127, PETRI_TRANSITIONS=103} [2022-11-18 20:03:47,842 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, 0 predicate places. [2022-11-18 20:03:47,843 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 103 transitions, 238 flow [2022-11-18 20:03:47,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 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-18 20:03:47,844 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:03:47,845 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:47,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:03:47,846 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:03:47,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:47,847 INFO L85 PathProgramCache]: Analyzing trace with hash -338886524, now seen corresponding path program 1 times [2022-11-18 20:03:47,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:47,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888479511] [2022-11-18 20:03:47,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:47,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:48,135 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-18 20:03:48,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:48,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888479511] [2022-11-18 20:03:48,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888479511] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:48,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:48,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:03:48,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567230296] [2022-11-18 20:03:48,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:48,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:03:48,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:48,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:03:48,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:03:48,140 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 122 [2022-11-18 20:03:48,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 103 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 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-18 20:03:48,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:03:48,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 122 [2022-11-18 20:03:48,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:03:48,675 INFO L130 PetriNetUnfolder]: 354/910 cut-off events. [2022-11-18 20:03:48,676 INFO L131 PetriNetUnfolder]: For 298/298 co-relation queries the response was YES. [2022-11-18 20:03:48,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1743 conditions, 910 events. 354/910 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4972 event pairs, 168 based on Foata normal form. 24/906 useless extension candidates. Maximal degree in co-relation 1678. Up to 239 conditions per place. [2022-11-18 20:03:48,681 INFO L137 encePairwiseOnDemand]: 116/122 looper letters, 21 selfloop transitions, 2 changer transitions 34/143 dead transitions. [2022-11-18 20:03:48,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 143 transitions, 456 flow [2022-11-18 20:03:48,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:03:48,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 20:03:48,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 959 transitions. [2022-11-18 20:03:48,685 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8734061930783242 [2022-11-18 20:03:48,685 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 959 transitions. [2022-11-18 20:03:48,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 959 transitions. [2022-11-18 20:03:48,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:03:48,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 959 transitions. [2022-11-18 20:03:48,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.55555555555556) internal successors, (959), 9 states have internal predecessors, (959), 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-18 20:03:48,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 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-18 20:03:48,692 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 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-18 20:03:48,692 INFO L175 Difference]: Start difference. First operand has 127 places, 103 transitions, 238 flow. Second operand 9 states and 959 transitions. [2022-11-18 20:03:48,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 143 transitions, 456 flow [2022-11-18 20:03:48,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 143 transitions, 422 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-11-18 20:03:48,698 INFO L231 Difference]: Finished difference. Result has 127 places, 103 transitions, 240 flow [2022-11-18 20:03:48,698 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=240, PETRI_PLACES=127, PETRI_TRANSITIONS=103} [2022-11-18 20:03:48,699 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, 0 predicate places. [2022-11-18 20:03:48,699 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 103 transitions, 240 flow [2022-11-18 20:03:48,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 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-18 20:03:48,700 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:03:48,700 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:48,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:03:48,701 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:03:48,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:48,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2113382099, now seen corresponding path program 1 times [2022-11-18 20:03:48,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:48,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415311427] [2022-11-18 20:03:48,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:48,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:48,976 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-18 20:03:48,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:48,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415311427] [2022-11-18 20:03:48,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415311427] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:48,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:48,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:03:48,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915899420] [2022-11-18 20:03:48,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:48,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:03:48,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:48,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:03:48,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:03:48,980 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 122 [2022-11-18 20:03:48,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 103 transitions, 240 flow. Second operand has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 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-18 20:03:48,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:03:48,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 122 [2022-11-18 20:03:48,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:03:49,746 INFO L130 PetriNetUnfolder]: 1156/2327 cut-off events. [2022-11-18 20:03:49,746 INFO L131 PetriNetUnfolder]: For 257/257 co-relation queries the response was YES. [2022-11-18 20:03:49,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4632 conditions, 2327 events. 1156/2327 cut-off events. For 257/257 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 15751 event pairs, 87 based on Foata normal form. 0/2275 useless extension candidates. Maximal degree in co-relation 4567. Up to 583 conditions per place. [2022-11-18 20:03:49,760 INFO L137 encePairwiseOnDemand]: 112/122 looper letters, 34 selfloop transitions, 6 changer transitions 55/177 dead transitions. [2022-11-18 20:03:49,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 177 transitions, 603 flow [2022-11-18 20:03:49,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:03:49,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 20:03:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1067 transitions. [2022-11-18 20:03:49,765 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8745901639344262 [2022-11-18 20:03:49,765 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1067 transitions. [2022-11-18 20:03:49,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1067 transitions. [2022-11-18 20:03:49,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:03:49,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1067 transitions. [2022-11-18 20:03:49,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.7) internal successors, (1067), 10 states have internal predecessors, (1067), 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-18 20:03:49,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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-18 20:03:49,772 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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-18 20:03:49,772 INFO L175 Difference]: Start difference. First operand has 127 places, 103 transitions, 240 flow. Second operand 10 states and 1067 transitions. [2022-11-18 20:03:49,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 177 transitions, 603 flow [2022-11-18 20:03:49,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 177 transitions, 573 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-11-18 20:03:49,779 INFO L231 Difference]: Finished difference. Result has 128 places, 105 transitions, 278 flow [2022-11-18 20:03:49,779 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=278, PETRI_PLACES=128, PETRI_TRANSITIONS=105} [2022-11-18 20:03:49,780 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, 1 predicate places. [2022-11-18 20:03:49,780 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 105 transitions, 278 flow [2022-11-18 20:03:49,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 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-18 20:03:49,781 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:03:49,781 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:49,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:03:49,782 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:03:49,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:49,783 INFO L85 PathProgramCache]: Analyzing trace with hash 388477786, now seen corresponding path program 1 times [2022-11-18 20:03:49,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:49,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466519770] [2022-11-18 20:03:49,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:49,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:50,080 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-18 20:03:50,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:50,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466519770] [2022-11-18 20:03:50,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466519770] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:50,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:50,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:03:50,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760835055] [2022-11-18 20:03:50,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:50,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:03:50,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:50,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:03:50,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:03:50,085 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 122 [2022-11-18 20:03:50,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 105 transitions, 278 flow. Second operand has 7 states, 7 states have (on average 99.14285714285714) internal successors, (694), 7 states have internal predecessors, (694), 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-18 20:03:50,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:03:50,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 122 [2022-11-18 20:03:50,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:03:50,633 INFO L130 PetriNetUnfolder]: 388/991 cut-off events. [2022-11-18 20:03:50,633 INFO L131 PetriNetUnfolder]: For 786/792 co-relation queries the response was YES. [2022-11-18 20:03:50,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2510 conditions, 991 events. 388/991 cut-off events. For 786/792 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5910 event pairs, 36 based on Foata normal form. 36/1016 useless extension candidates. Maximal degree in co-relation 2444. Up to 205 conditions per place. [2022-11-18 20:03:50,639 INFO L137 encePairwiseOnDemand]: 113/122 looper letters, 41 selfloop transitions, 9 changer transitions 43/175 dead transitions. [2022-11-18 20:03:50,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 175 transitions, 744 flow [2022-11-18 20:03:50,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:03:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 20:03:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1065 transitions. [2022-11-18 20:03:50,643 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8729508196721312 [2022-11-18 20:03:50,643 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1065 transitions. [2022-11-18 20:03:50,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1065 transitions. [2022-11-18 20:03:50,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:03:50,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1065 transitions. [2022-11-18 20:03:50,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.5) internal successors, (1065), 10 states have internal predecessors, (1065), 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-18 20:03:50,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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-18 20:03:50,650 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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-18 20:03:50,650 INFO L175 Difference]: Start difference. First operand has 128 places, 105 transitions, 278 flow. Second operand 10 states and 1065 transitions. [2022-11-18 20:03:50,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 175 transitions, 744 flow [2022-11-18 20:03:50,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 175 transitions, 720 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-11-18 20:03:50,657 INFO L231 Difference]: Finished difference. Result has 132 places, 108 transitions, 346 flow [2022-11-18 20:03:50,657 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=346, PETRI_PLACES=132, PETRI_TRANSITIONS=108} [2022-11-18 20:03:50,658 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, 5 predicate places. [2022-11-18 20:03:50,658 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 108 transitions, 346 flow [2022-11-18 20:03:50,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.14285714285714) internal successors, (694), 7 states have internal predecessors, (694), 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-18 20:03:50,659 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:03:50,659 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:50,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:03:50,659 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:03:50,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:50,660 INFO L85 PathProgramCache]: Analyzing trace with hash -584423867, now seen corresponding path program 1 times [2022-11-18 20:03:50,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:50,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020252361] [2022-11-18 20:03:50,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:50,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:51,013 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-18 20:03:51,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:51,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020252361] [2022-11-18 20:03:51,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020252361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:51,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:51,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:03:51,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825276586] [2022-11-18 20:03:51,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:51,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:03:51,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:51,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:03:51,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:03:51,017 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 122 [2022-11-18 20:03:51,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 108 transitions, 346 flow. Second operand has 8 states, 8 states have (on average 99.125) internal successors, (793), 8 states have internal predecessors, (793), 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-18 20:03:51,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:03:51,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 122 [2022-11-18 20:03:51,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:03:51,405 INFO L130 PetriNetUnfolder]: 135/448 cut-off events. [2022-11-18 20:03:51,405 INFO L131 PetriNetUnfolder]: For 589/589 co-relation queries the response was YES. [2022-11-18 20:03:51,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1174 conditions, 448 events. 135/448 cut-off events. For 589/589 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2129 event pairs, 36 based on Foata normal form. 10/447 useless extension candidates. Maximal degree in co-relation 1141. Up to 80 conditions per place. [2022-11-18 20:03:51,409 INFO L137 encePairwiseOnDemand]: 113/122 looper letters, 29 selfloop transitions, 12 changer transitions 25/148 dead transitions. [2022-11-18 20:03:51,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 148 transitions, 668 flow [2022-11-18 20:03:51,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:03:51,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 20:03:51,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1135 transitions. [2022-11-18 20:03:51,414 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.84575260804769 [2022-11-18 20:03:51,414 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1135 transitions. [2022-11-18 20:03:51,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1135 transitions. [2022-11-18 20:03:51,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:03:51,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1135 transitions. [2022-11-18 20:03:51,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 103.18181818181819) internal successors, (1135), 11 states have internal predecessors, (1135), 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-18 20:03:51,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 122.0) internal successors, (1464), 12 states have internal predecessors, (1464), 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-18 20:03:51,422 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 122.0) internal successors, (1464), 12 states have internal predecessors, (1464), 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-18 20:03:51,422 INFO L175 Difference]: Start difference. First operand has 132 places, 108 transitions, 346 flow. Second operand 11 states and 1135 transitions. [2022-11-18 20:03:51,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 148 transitions, 668 flow [2022-11-18 20:03:51,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 148 transitions, 557 flow, removed 41 selfloop flow, removed 12 redundant places. [2022-11-18 20:03:51,430 INFO L231 Difference]: Finished difference. Result has 132 places, 108 transitions, 324 flow [2022-11-18 20:03:51,431 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=324, PETRI_PLACES=132, PETRI_TRANSITIONS=108} [2022-11-18 20:03:51,436 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, 5 predicate places. [2022-11-18 20:03:51,436 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 108 transitions, 324 flow [2022-11-18 20:03:51,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 99.125) internal successors, (793), 8 states have internal predecessors, (793), 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-18 20:03:51,437 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:03:51,437 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:51,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:03:51,438 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:03:51,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:51,439 INFO L85 PathProgramCache]: Analyzing trace with hash -202319348, now seen corresponding path program 1 times [2022-11-18 20:03:51,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:51,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665686834] [2022-11-18 20:03:51,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:51,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:51,892 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-18 20:03:51,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:51,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665686834] [2022-11-18 20:03:51,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665686834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:51,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:51,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:03:51,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500588794] [2022-11-18 20:03:51,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:51,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:03:51,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:51,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:03:51,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:03:51,896 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 122 [2022-11-18 20:03:51,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 108 transitions, 324 flow. Second operand has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 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-18 20:03:51,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:03:51,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 122 [2022-11-18 20:03:51,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:03:52,240 INFO L130 PetriNetUnfolder]: 147/529 cut-off events. [2022-11-18 20:03:52,240 INFO L131 PetriNetUnfolder]: For 291/301 co-relation queries the response was YES. [2022-11-18 20:03:52,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 529 events. 147/529 cut-off events. For 291/301 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2665 event pairs, 26 based on Foata normal form. 1/517 useless extension candidates. Maximal degree in co-relation 1061. Up to 106 conditions per place. [2022-11-18 20:03:52,244 INFO L137 encePairwiseOnDemand]: 116/122 looper letters, 24 selfloop transitions, 1 changer transitions 13/125 dead transitions. [2022-11-18 20:03:52,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 125 transitions, 434 flow [2022-11-18 20:03:52,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:03:52,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 20:03:52,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 711 transitions. [2022-11-18 20:03:52,247 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.832552693208431 [2022-11-18 20:03:52,247 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 711 transitions. [2022-11-18 20:03:52,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 711 transitions. [2022-11-18 20:03:52,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:03:52,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 711 transitions. [2022-11-18 20:03:52,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.57142857142857) internal successors, (711), 7 states have internal predecessors, (711), 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-18 20:03:52,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 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-18 20:03:52,253 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 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-18 20:03:52,253 INFO L175 Difference]: Start difference. First operand has 132 places, 108 transitions, 324 flow. Second operand 7 states and 711 transitions. [2022-11-18 20:03:52,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 125 transitions, 434 flow [2022-11-18 20:03:52,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 125 transitions, 352 flow, removed 22 selfloop flow, removed 15 redundant places. [2022-11-18 20:03:52,258 INFO L231 Difference]: Finished difference. Result has 124 places, 108 transitions, 255 flow [2022-11-18 20:03:52,259 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=124, PETRI_TRANSITIONS=108} [2022-11-18 20:03:52,259 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, -3 predicate places. [2022-11-18 20:03:52,259 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 108 transitions, 255 flow [2022-11-18 20:03:52,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 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-18 20:03:52,260 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:03:52,260 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:52,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:03:52,261 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:03:52,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:52,261 INFO L85 PathProgramCache]: Analyzing trace with hash 686677890, now seen corresponding path program 2 times [2022-11-18 20:03:52,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:52,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339020394] [2022-11-18 20:03:52,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:52,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:55,080 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-18 20:03:55,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:55,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339020394] [2022-11-18 20:03:55,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339020394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:55,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:55,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-18 20:03:55,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202001150] [2022-11-18 20:03:55,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:55,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 20:03:55,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:55,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 20:03:55,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:03:55,084 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 122 [2022-11-18 20:03:55,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 108 transitions, 255 flow. Second operand has 14 states, 14 states have (on average 91.0) internal successors, (1274), 14 states have internal predecessors, (1274), 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-18 20:03:55,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:03:55,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 122 [2022-11-18 20:03:55,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:03:56,098 INFO L130 PetriNetUnfolder]: 59/391 cut-off events. [2022-11-18 20:03:56,100 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-18 20:03:56,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 391 events. 59/391 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1713 event pairs, 6 based on Foata normal form. 1/378 useless extension candidates. Maximal degree in co-relation 610. Up to 28 conditions per place. [2022-11-18 20:03:56,103 INFO L137 encePairwiseOnDemand]: 108/122 looper letters, 31 selfloop transitions, 13 changer transitions 10/134 dead transitions. [2022-11-18 20:03:56,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 134 transitions, 433 flow [2022-11-18 20:03:56,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:03:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-18 20:03:56,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1479 transitions. [2022-11-18 20:03:56,108 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7576844262295082 [2022-11-18 20:03:56,108 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1479 transitions. [2022-11-18 20:03:56,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1479 transitions. [2022-11-18 20:03:56,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:03:56,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1479 transitions. [2022-11-18 20:03:56,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 92.4375) internal successors, (1479), 16 states have internal predecessors, (1479), 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-18 20:03:56,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 122.0) internal successors, (2074), 17 states have internal predecessors, (2074), 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-18 20:03:56,121 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 122.0) internal successors, (2074), 17 states have internal predecessors, (2074), 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-18 20:03:56,122 INFO L175 Difference]: Start difference. First operand has 124 places, 108 transitions, 255 flow. Second operand 16 states and 1479 transitions. [2022-11-18 20:03:56,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 134 transitions, 433 flow [2022-11-18 20:03:56,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 134 transitions, 418 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-11-18 20:03:56,126 INFO L231 Difference]: Finished difference. Result has 134 places, 112 transitions, 292 flow [2022-11-18 20:03:56,127 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=292, PETRI_PLACES=134, PETRI_TRANSITIONS=112} [2022-11-18 20:03:56,128 INFO L288 CegarLoopForPetriNet]: 127 programPoint places, 7 predicate places. [2022-11-18 20:03:56,128 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 112 transitions, 292 flow [2022-11-18 20:03:56,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 91.0) internal successors, (1274), 14 states have internal predecessors, (1274), 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-18 20:03:56,129 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:03:56,129 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:56,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:03:56,130 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-18 20:03:56,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:56,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1879531984, now seen corresponding path program 3 times [2022-11-18 20:03:56,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:56,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815616932] [2022-11-18 20:03:56,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:56,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:03:56,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:03:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:03:56,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:03:56,386 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:03:56,388 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-18 20:03:56,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-18 20:03:56,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-18 20:03:56,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-18 20:03:56,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-18 20:03:56,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-18 20:03:56,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:03:56,397 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:56,405 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 20:03:56,405 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:03:56,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:03:56 BasicIcfg [2022-11-18 20:03:56,593 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:03:56,594 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:03:56,595 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:03:56,595 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:03:56,595 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:03:43" (3/4) ... [2022-11-18 20:03:56,597 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 20:03:56,764 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceac05a8-f491-4f88-8f27-e3e6a171cb5f/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:03:56,764 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:03:56,766 INFO L158 Benchmark]: Toolchain (without parser) took 15551.82ms. Allocated memory was 123.7MB in the beginning and 358.6MB in the end (delta: 234.9MB). Free memory was 81.0MB in the beginning and 221.2MB in the end (delta: -140.2MB). Peak memory consumption was 94.6MB. Max. memory is 16.1GB. [2022-11-18 20:03:56,766 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 123.7MB. Free memory is still 99.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:03:56,766 INFO L158 Benchmark]: CACSL2BoogieTranslator took 804.25ms. Allocated memory is still 123.7MB. Free memory was 80.8MB in the beginning and 82.8MB in the end (delta: -2.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 20:03:56,767 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.05ms. Allocated memory is still 123.7MB. Free memory was 82.8MB in the beginning and 80.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:03:56,767 INFO L158 Benchmark]: Boogie Preprocessor took 37.70ms. Allocated memory is still 123.7MB. Free memory was 80.2MB in the beginning and 78.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:03:56,767 INFO L158 Benchmark]: RCFGBuilder took 1095.00ms. Allocated memory is still 123.7MB. Free memory was 78.1MB in the beginning and 86.6MB in the end (delta: -8.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-18 20:03:56,768 INFO L158 Benchmark]: TraceAbstraction took 13381.71ms. Allocated memory was 123.7MB in the beginning and 358.6MB in the end (delta: 234.9MB). Free memory was 86.0MB in the beginning and 248.5MB in the end (delta: -162.5MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. [2022-11-18 20:03:56,768 INFO L158 Benchmark]: Witness Printer took 170.14ms. Allocated memory is still 358.6MB. Free memory was 248.5MB in the beginning and 221.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-18 20:03:56,770 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.31ms. Allocated memory is still 123.7MB. Free memory is still 99.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 804.25ms. Allocated memory is still 123.7MB. Free memory was 80.8MB in the beginning and 82.8MB in the end (delta: -2.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.05ms. Allocated memory is still 123.7MB. Free memory was 82.8MB in the beginning and 80.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.70ms. Allocated memory is still 123.7MB. Free memory was 80.2MB in the beginning and 78.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1095.00ms. Allocated memory is still 123.7MB. Free memory was 78.1MB in the beginning and 86.6MB in the end (delta: -8.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13381.71ms. Allocated memory was 123.7MB in the beginning and 358.6MB in the end (delta: 234.9MB). Free memory was 86.0MB in the beginning and 248.5MB in the end (delta: -162.5MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. * Witness Printer took 170.14ms. Allocated memory is still 358.6MB. Free memory was 248.5MB in the beginning and 221.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L722] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_p2_EBX=0] [L739] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_p2_EBX=0, z$r_buff1_thd2=0] [L740] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_p2_EBX=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L737] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_p2_EBX=0, z$r_buff1_thd0=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L738] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_p2_EBX=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L745] 0 int z$w_buff1; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff1=0] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff1=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff1=0] [L731] 0 _Bool z$flush_delayed; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff1=0] [L743] 0 int z$w_buff0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L734] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L735] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_p0_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L716] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L733] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L736] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L732] 0 int z$mem_tmp; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$w_buff0=0, z$w_buff1=0] [L741] 0 _Bool z$read_delayed; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L720] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$w_buff0=0, z$w_buff1=0] [L742] 0 int *z$read_delayed_var; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0] [L746] 0 _Bool z$w_buff1_used; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L714] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L723] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L718] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 pthread_t t14; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t14={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L865] FCALL, FORK 0 pthread_create(&t14, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t14, ((void *)0), P0, ((void *)0))=-2, t14={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$w_buff1 = z$w_buff0 [L753] 1 z$w_buff0 = 1 [L754] 1 z$w_buff1_used = z$w_buff0_used [L755] 1 z$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L757] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L758] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L759] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L760] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L761] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 z$flush_delayed = weak$$choice2 [L767] 1 z$mem_tmp = z [L768] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 __unbuffered_p0_EAX = z [L776] 1 z = z$flush_delayed ? z$mem_tmp : z [L777] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 pthread_t t15; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t14={5:0}, t15={6:0}, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L867] FCALL, FORK 0 pthread_create(&t15, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t15, ((void *)0), P1, ((void *)0))=-1, t14={5:0}, t15={6:0}, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 pthread_t t16; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t14={5:0}, t15={6:0}, t16={3:0}, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L869] FCALL, FORK 0 pthread_create(&t16, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t16, ((void *)0), P2, ((void *)0))=0, t14={5:0}, t15={6:0}, t16={3:0}, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 3 z$flush_delayed = weak$$choice2 [L829] 3 z$mem_tmp = z [L830] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L831] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L832] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L833] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L834] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L835] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L836] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L837] 3 __unbuffered_p2_EBX = z [L838] 3 z = z$flush_delayed ? z$mem_tmp : z [L839] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L806] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L807] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L808] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L809] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L810] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L843] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L844] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L845] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L846] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L784] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L785] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L786] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L787] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t14={5:0}, t15={6:0}, t16={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L876] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L877] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L878] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L879] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t14={5:0}, t15={6:0}, t16={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t14={5:0}, t15={6:0}, t16={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 152 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 529 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 529 mSDsluCounter, 354 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 281 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1251 IncrementalHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 73 mSDtfsCounter, 1251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=6, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 850 NumberOfCodeBlocks, 850 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 745 ConstructedInterpolants, 0 QuantifiedInterpolants, 2690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-18 20:03:56,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceac05a8-f491-4f88-8f27-e3e6a171cb5f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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