./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_80079314-5de0-402d-b9c4-7e7eb743cc39/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80079314-5de0-402d-b9c4-7e7eb743cc39/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80079314-5de0-402d-b9c4-7e7eb743cc39/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80079314-5de0-402d-b9c4-7e7eb743cc39/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80079314-5de0-402d-b9c4-7e7eb743cc39/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80079314-5de0-402d-b9c4-7e7eb743cc39/bin/uautomizer-tPACEb0tL8 --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 2272010dc8e07b1cac46beb8b69d58bd905467d4d1bd6fb11b2eb1922da454c5 --- 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-e04fb08 [2022-11-16 11:39:07,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:39:07,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:39:07,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:39:07,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:39:07,877 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:39:07,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:39:07,881 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:39:07,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:39:07,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:39:07,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:39:07,887 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:39:07,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:39:07,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:39:07,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:39:07,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:39:07,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:39:07,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:39:07,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:39:07,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:39:07,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:39:07,900 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:39:07,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:39:07,903 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:39:07,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:39:07,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:39:07,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:39:07,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:39:07,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:39:07,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:39:07,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:39:07,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:39:07,912 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:39:07,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:39:07,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:39:07,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:39:07,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:39:07,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:39:07,916 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:39:07,917 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:39:07,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:39:07,919 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80079314-5de0-402d-b9c4-7e7eb743cc39/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:39:07,941 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:39:07,942 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:39:07,942 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:39:07,942 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:39:07,943 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:39:07,943 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:39:07,944 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:39:07,944 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:39:07,944 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:39:07,945 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:39:07,945 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:39:07,945 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:39:07,945 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:39:07,945 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:39:07,946 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:39:07,946 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:39:07,946 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:39:07,946 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:39:07,946 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:39:07,947 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:39:07,947 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:39:07,947 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:39:07,947 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:39:07,948 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:39:07,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:39:07,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:39:07,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:39:07,948 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:39:07,949 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:39:07,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:39:07,949 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:39:07,949 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:39:07,949 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:39:07,950 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_80079314-5de0-402d-b9c4-7e7eb743cc39/bin/uautomizer-tPACEb0tL8/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_80079314-5de0-402d-b9c4-7e7eb743cc39/bin/uautomizer-tPACEb0tL8 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 -> 2272010dc8e07b1cac46beb8b69d58bd905467d4d1bd6fb11b2eb1922da454c5 [2022-11-16 11:39:08,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:39:08,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:39:08,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:39:08,291 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:39:08,292 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:39:08,293 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80079314-5de0-402d-b9c4-7e7eb743cc39/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2022-11-16 11:39:08,375 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80079314-5de0-402d-b9c4-7e7eb743cc39/bin/uautomizer-tPACEb0tL8/data/f298443fe/7840fe31c6bb4e4ba5402d586db95814/FLAG9167439c3 [2022-11-16 11:39:08,998 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:39:08,999 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80079314-5de0-402d-b9c4-7e7eb743cc39/sv-benchmarks/c/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2022-11-16 11:39:09,014 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80079314-5de0-402d-b9c4-7e7eb743cc39/bin/uautomizer-tPACEb0tL8/data/f298443fe/7840fe31c6bb4e4ba5402d586db95814/FLAG9167439c3 [2022-11-16 11:39:09,264 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80079314-5de0-402d-b9c4-7e7eb743cc39/bin/uautomizer-tPACEb0tL8/data/f298443fe/7840fe31c6bb4e4ba5402d586db95814 [2022-11-16 11:39:09,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:39:09,269 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:39:09,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:39:09,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:39:09,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:39:09,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:39:09" (1/1) ... [2022-11-16 11:39:09,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30d9e628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:09, skipping insertion in model container [2022-11-16 11:39:09,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:39:09" (1/1) ... [2022-11-16 11:39:09,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:39:09,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:39:09,567 WARN L229 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_80079314-5de0-402d-b9c4-7e7eb743cc39/sv-benchmarks/c/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-16 11:39:09,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:39:09,832 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:39:09,848 WARN L229 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_80079314-5de0-402d-b9c4-7e7eb743cc39/sv-benchmarks/c/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-16 11:39:09,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:39:09,928 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:39:09,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:09 WrapperNode [2022-11-16 11:39:09,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:39:09,929 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:39:09,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:39:09,930 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:39:09,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:09" (1/1) ... [2022-11-16 11:39:09,955 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:09" (1/1) ... [2022-11-16 11:39:09,996 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-11-16 11:39:10,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:39:10,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:39:10,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:39:10,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:39:10,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:09" (1/1) ... [2022-11-16 11:39:10,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:09" (1/1) ... [2022-11-16 11:39:10,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:09" (1/1) ... [2022-11-16 11:39:10,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:09" (1/1) ... [2022-11-16 11:39:10,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:09" (1/1) ... [2022-11-16 11:39:10,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:09" (1/1) ... [2022-11-16 11:39:10,029 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:09" (1/1) ... [2022-11-16 11:39:10,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:09" (1/1) ... [2022-11-16 11:39:10,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:39:10,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:39:10,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:39:10,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:39:10,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:09" (1/1) ... [2022-11-16 11:39:10,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:39:10,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80079314-5de0-402d-b9c4-7e7eb743cc39/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:39:10,088 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80079314-5de0-402d-b9c4-7e7eb743cc39/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:39:10,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80079314-5de0-402d-b9c4-7e7eb743cc39/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:39:10,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:39:10,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:39:10,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:39:10,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:39:10,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:39:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:39:10,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:39:10,139 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:39:10,140 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:39:10,140 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:39:10,141 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:39:10,141 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-16 11:39:10,141 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-16 11:39:10,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:39:10,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:39:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:39:10,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:39:10,148 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:39:10,333 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:39:10,335 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:39:10,772 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:39:10,957 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:39:10,957 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:39:10,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:39:10 BoogieIcfgContainer [2022-11-16 11:39:10,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:39:10,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:39:10,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:39:10,973 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:39:10,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:39:09" (1/3) ... [2022-11-16 11:39:10,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ebab79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:39:10, skipping insertion in model container [2022-11-16 11:39:10,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:09" (2/3) ... [2022-11-16 11:39:10,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ebab79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:39:10, skipping insertion in model container [2022-11-16 11:39:10,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:39:10" (3/3) ... [2022-11-16 11:39:10,978 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_power.oepc_pso.oepc_rmo.oepc.i [2022-11-16 11:39:10,989 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:39:10,999 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:39:10,999 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 11:39:11,000 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:39:11,098 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:39:11,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 300 flow [2022-11-16 11:39:11,204 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2022-11-16 11:39:11,204 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:39:11,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-11-16 11:39:11,210 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 140 transitions, 300 flow [2022-11-16 11:39:11,220 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 136 transitions, 284 flow [2022-11-16 11:39:11,242 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:39:11,251 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;@57ca0d38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:39:11,252 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-16 11:39:11,282 INFO L130 PetriNetUnfolder]: 0/52 cut-off events. [2022-11-16 11:39:11,282 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:39:11,283 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:11,283 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] [2022-11-16 11:39:11,284 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:39:11,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:11,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1985731391, now seen corresponding path program 1 times [2022-11-16 11:39:11,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:11,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995860341] [2022-11-16 11:39:11,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:11,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:11,941 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-16 11:39:11,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:11,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995860341] [2022-11-16 11:39:11,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995860341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:11,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:11,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:39:11,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774711765] [2022-11-16 11:39:11,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:11,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:39:11,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:11,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:39:12,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:39:12,011 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 140 [2022-11-16 11:39:12,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 136 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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-16 11:39:12,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:12,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 140 [2022-11-16 11:39:12,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:12,391 INFO L130 PetriNetUnfolder]: 162/624 cut-off events. [2022-11-16 11:39:12,391 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-11-16 11:39:12,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 624 events. 162/624 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3428 event pairs, 132 based on Foata normal form. 46/629 useless extension candidates. Maximal degree in co-relation 871. Up to 191 conditions per place. [2022-11-16 11:39:12,406 INFO L137 encePairwiseOnDemand]: 135/140 looper letters, 18 selfloop transitions, 2 changer transitions 0/140 dead transitions. [2022-11-16 11:39:12,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 140 transitions, 341 flow [2022-11-16 11:39:12,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:39:12,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:39:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2022-11-16 11:39:12,430 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9452380952380952 [2022-11-16 11:39:12,431 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2022-11-16 11:39:12,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2022-11-16 11:39:12,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:12,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2022-11-16 11:39:12,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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-16 11:39:12,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 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-16 11:39:12,457 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 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-16 11:39:12,459 INFO L175 Difference]: Start difference. First operand has 147 places, 136 transitions, 284 flow. Second operand 3 states and 397 transitions. [2022-11-16 11:39:12,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 140 transitions, 341 flow [2022-11-16 11:39:12,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 140 transitions, 334 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:39:12,467 INFO L231 Difference]: Finished difference. Result has 143 places, 132 transitions, 276 flow [2022-11-16 11:39:12,469 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=143, PETRI_TRANSITIONS=132} [2022-11-16 11:39:12,473 INFO L288 CegarLoopForPetriNet]: 147 programPoint places, -4 predicate places. [2022-11-16 11:39:12,473 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 132 transitions, 276 flow [2022-11-16 11:39:12,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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-16 11:39:12,474 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:12,475 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-16 11:39:12,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:39:12,475 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:39:12,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:12,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1505014635, now seen corresponding path program 1 times [2022-11-16 11:39:12,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:12,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351303273] [2022-11-16 11:39:12,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:12,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:13,082 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-16 11:39:13,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:13,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351303273] [2022-11-16 11:39:13,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351303273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:13,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:13,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:39:13,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241443083] [2022-11-16 11:39:13,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:13,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:39:13,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:13,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:39:13,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:39:13,089 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 140 [2022-11-16 11:39:13,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 276 flow. Second operand has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 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-16 11:39:13,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:13,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 140 [2022-11-16 11:39:13,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:19,518 INFO L130 PetriNetUnfolder]: 13857/30436 cut-off events. [2022-11-16 11:39:19,518 INFO L131 PetriNetUnfolder]: For 847/847 co-relation queries the response was YES. [2022-11-16 11:39:19,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50455 conditions, 30436 events. 13857/30436 cut-off events. For 847/847 co-relation queries the response was YES. Maximal size of possible extension queue 1239. Compared 319944 event pairs, 3906 based on Foata normal form. 0/29895 useless extension candidates. Maximal degree in co-relation 50392. Up to 9046 conditions per place. [2022-11-16 11:39:19,780 INFO L137 encePairwiseOnDemand]: 128/140 looper letters, 40 selfloop transitions, 8 changer transitions 96/233 dead transitions. [2022-11-16 11:39:19,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 233 transitions, 758 flow [2022-11-16 11:39:19,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:39:19,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:39:19,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1087 transitions. [2022-11-16 11:39:19,786 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8626984126984127 [2022-11-16 11:39:19,787 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1087 transitions. [2022-11-16 11:39:19,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1087 transitions. [2022-11-16 11:39:19,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:19,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1087 transitions. [2022-11-16 11:39:19,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.77777777777777) internal successors, (1087), 9 states have internal predecessors, (1087), 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-16 11:39:19,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 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-16 11:39:19,797 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 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-16 11:39:19,797 INFO L175 Difference]: Start difference. First operand has 143 places, 132 transitions, 276 flow. Second operand 9 states and 1087 transitions. [2022-11-16 11:39:19,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 233 transitions, 758 flow [2022-11-16 11:39:19,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 233 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:39:19,806 INFO L231 Difference]: Finished difference. Result has 157 places, 125 transitions, 360 flow [2022-11-16 11:39:19,807 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=360, PETRI_PLACES=157, PETRI_TRANSITIONS=125} [2022-11-16 11:39:19,808 INFO L288 CegarLoopForPetriNet]: 147 programPoint places, 10 predicate places. [2022-11-16 11:39:19,808 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 125 transitions, 360 flow [2022-11-16 11:39:19,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 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-16 11:39:19,809 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:19,810 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] [2022-11-16 11:39:19,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:39:19,810 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:39:19,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:19,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1223653332, now seen corresponding path program 1 times [2022-11-16 11:39:19,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:19,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486008228] [2022-11-16 11:39:19,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:19,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:20,215 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-16 11:39:20,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:20,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486008228] [2022-11-16 11:39:20,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486008228] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:20,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:20,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:39:20,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738085817] [2022-11-16 11:39:20,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:20,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:39:20,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:20,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:39:20,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:39:20,220 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 140 [2022-11-16 11:39:20,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 125 transitions, 360 flow. Second operand has 7 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 states have internal predecessors, (760), 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-16 11:39:20,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:20,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 140 [2022-11-16 11:39:20,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:23,884 INFO L130 PetriNetUnfolder]: 9918/16743 cut-off events. [2022-11-16 11:39:23,885 INFO L131 PetriNetUnfolder]: For 29657/29663 co-relation queries the response was YES. [2022-11-16 11:39:23,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52746 conditions, 16743 events. 9918/16743 cut-off events. For 29657/29663 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 128289 event pairs, 1196 based on Foata normal form. 360/16939 useless extension candidates. Maximal degree in co-relation 52675. Up to 5824 conditions per place. [2022-11-16 11:39:24,057 INFO L137 encePairwiseOnDemand]: 127/140 looper letters, 49 selfloop transitions, 10 changer transitions 115/263 dead transitions. [2022-11-16 11:39:24,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 263 transitions, 1458 flow [2022-11-16 11:39:24,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:39:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:39:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1534 transitions. [2022-11-16 11:39:24,064 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8428571428571429 [2022-11-16 11:39:24,065 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1534 transitions. [2022-11-16 11:39:24,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1534 transitions. [2022-11-16 11:39:24,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:24,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1534 transitions. [2022-11-16 11:39:24,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 118.0) internal successors, (1534), 13 states have internal predecessors, (1534), 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-16 11:39:24,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-16 11:39:24,080 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-16 11:39:24,081 INFO L175 Difference]: Start difference. First operand has 157 places, 125 transitions, 360 flow. Second operand 13 states and 1534 transitions. [2022-11-16 11:39:24,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 263 transitions, 1458 flow [2022-11-16 11:39:24,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 263 transitions, 1336 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-11-16 11:39:24,263 INFO L231 Difference]: Finished difference. Result has 159 places, 130 transitions, 458 flow [2022-11-16 11:39:24,264 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=458, PETRI_PLACES=159, PETRI_TRANSITIONS=130} [2022-11-16 11:39:24,267 INFO L288 CegarLoopForPetriNet]: 147 programPoint places, 12 predicate places. [2022-11-16 11:39:24,267 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 130 transitions, 458 flow [2022-11-16 11:39:24,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 states have internal predecessors, (760), 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-16 11:39:24,268 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:24,269 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-16 11:39:24,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:39:24,269 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:39:24,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:24,270 INFO L85 PathProgramCache]: Analyzing trace with hash -293997854, now seen corresponding path program 1 times [2022-11-16 11:39:24,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:24,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574491525] [2022-11-16 11:39:24,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:24,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:24,880 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-16 11:39:24,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:24,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574491525] [2022-11-16 11:39:24,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574491525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:24,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:24,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:39:24,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722873854] [2022-11-16 11:39:24,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:24,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:39:24,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:24,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:39:24,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:39:24,892 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 140 [2022-11-16 11:39:24,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 130 transitions, 458 flow. Second operand has 7 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 states have internal predecessors, (760), 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-16 11:39:24,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:24,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 140 [2022-11-16 11:39:24,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:28,026 INFO L130 PetriNetUnfolder]: 8304/14299 cut-off events. [2022-11-16 11:39:28,026 INFO L131 PetriNetUnfolder]: For 38531/38548 co-relation queries the response was YES. [2022-11-16 11:39:28,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49356 conditions, 14299 events. 8304/14299 cut-off events. For 38531/38548 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 109966 event pairs, 2271 based on Foata normal form. 290/14430 useless extension candidates. Maximal degree in co-relation 49271. Up to 5577 conditions per place. [2022-11-16 11:39:28,159 INFO L137 encePairwiseOnDemand]: 127/140 looper letters, 50 selfloop transitions, 19 changer transitions 94/252 dead transitions. [2022-11-16 11:39:28,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 252 transitions, 1542 flow [2022-11-16 11:39:28,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:39:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:39:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1534 transitions. [2022-11-16 11:39:28,163 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8428571428571429 [2022-11-16 11:39:28,164 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1534 transitions. [2022-11-16 11:39:28,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1534 transitions. [2022-11-16 11:39:28,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:28,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1534 transitions. [2022-11-16 11:39:28,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 118.0) internal successors, (1534), 13 states have internal predecessors, (1534), 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-16 11:39:28,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-16 11:39:28,173 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-16 11:39:28,173 INFO L175 Difference]: Start difference. First operand has 159 places, 130 transitions, 458 flow. Second operand 13 states and 1534 transitions. [2022-11-16 11:39:28,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 252 transitions, 1542 flow [2022-11-16 11:39:28,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 252 transitions, 1459 flow, removed 39 selfloop flow, removed 7 redundant places. [2022-11-16 11:39:28,542 INFO L231 Difference]: Finished difference. Result has 166 places, 136 transitions, 585 flow [2022-11-16 11:39:28,550 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=585, PETRI_PLACES=166, PETRI_TRANSITIONS=136} [2022-11-16 11:39:28,551 INFO L288 CegarLoopForPetriNet]: 147 programPoint places, 19 predicate places. [2022-11-16 11:39:28,552 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 136 transitions, 585 flow [2022-11-16 11:39:28,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 states have internal predecessors, (760), 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-16 11:39:28,553 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:28,553 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] [2022-11-16 11:39:28,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:39:28,553 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:39:28,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:28,554 INFO L85 PathProgramCache]: Analyzing trace with hash 255818231, now seen corresponding path program 1 times [2022-11-16 11:39:28,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:28,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305315972] [2022-11-16 11:39:28,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:28,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:29,053 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-16 11:39:29,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:29,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305315972] [2022-11-16 11:39:29,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305315972] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:29,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:29,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:39:29,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60788612] [2022-11-16 11:39:29,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:29,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:39:29,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:29,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:39:29,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:39:29,059 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 140 [2022-11-16 11:39:29,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 136 transitions, 585 flow. Second operand has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 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-16 11:39:29,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:29,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 140 [2022-11-16 11:39:29,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:31,339 INFO L130 PetriNetUnfolder]: 4986/9541 cut-off events. [2022-11-16 11:39:31,339 INFO L131 PetriNetUnfolder]: For 26183/27619 co-relation queries the response was YES. [2022-11-16 11:39:31,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31222 conditions, 9541 events. 4986/9541 cut-off events. For 26183/27619 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 76928 event pairs, 1840 based on Foata normal form. 273/9270 useless extension candidates. Maximal degree in co-relation 31134. Up to 3530 conditions per place. [2022-11-16 11:39:31,448 INFO L137 encePairwiseOnDemand]: 134/140 looper letters, 26 selfloop transitions, 5 changer transitions 52/196 dead transitions. [2022-11-16 11:39:31,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 196 transitions, 1081 flow [2022-11-16 11:39:31,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:39:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:39:31,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1115 transitions. [2022-11-16 11:39:31,452 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8849206349206349 [2022-11-16 11:39:31,452 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1115 transitions. [2022-11-16 11:39:31,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1115 transitions. [2022-11-16 11:39:31,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:31,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1115 transitions. [2022-11-16 11:39:31,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.88888888888889) internal successors, (1115), 9 states have internal predecessors, (1115), 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-16 11:39:31,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 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-16 11:39:31,460 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 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-16 11:39:31,460 INFO L175 Difference]: Start difference. First operand has 166 places, 136 transitions, 585 flow. Second operand 9 states and 1115 transitions. [2022-11-16 11:39:31,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 196 transitions, 1081 flow [2022-11-16 11:39:32,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 196 transitions, 985 flow, removed 48 selfloop flow, removed 15 redundant places. [2022-11-16 11:39:32,071 INFO L231 Difference]: Finished difference. Result has 157 places, 136 transitions, 542 flow [2022-11-16 11:39:32,072 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=542, PETRI_PLACES=157, PETRI_TRANSITIONS=136} [2022-11-16 11:39:32,072 INFO L288 CegarLoopForPetriNet]: 147 programPoint places, 10 predicate places. [2022-11-16 11:39:32,073 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 136 transitions, 542 flow [2022-11-16 11:39:32,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 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-16 11:39:32,073 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:32,073 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] [2022-11-16 11:39:32,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:39:32,074 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:39:32,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:32,074 INFO L85 PathProgramCache]: Analyzing trace with hash 329467270, now seen corresponding path program 1 times [2022-11-16 11:39:32,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:32,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172558943] [2022-11-16 11:39:32,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:32,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:32,330 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-16 11:39:32,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:32,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172558943] [2022-11-16 11:39:32,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172558943] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:32,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:32,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:39:32,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450887438] [2022-11-16 11:39:32,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:32,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:39:32,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:32,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:39:32,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:39:32,335 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2022-11-16 11:39:32,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 136 transitions, 542 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 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-16 11:39:32,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:32,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2022-11-16 11:39:32,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:36,582 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L811-->L818: Formula: (let ((.cse4 (not (= (mod v_~a$w_buff0_used~0_87 256) 0))) (.cse3 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_88 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse5 .cse4))) (and (= v_~a~0_38 (ite .cse0 v_~a$w_buff0~0_26 (ite .cse1 v_~a$w_buff1~0_31 v_~a~0_39))) (= (ite .cse0 0 v_~a$w_buff0_used~0_88) v_~a$w_buff0_used~0_87) (= (ite (or .cse2 .cse1) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a$r_buff0_thd3~0_19 (ite .cse2 0 v_~a$r_buff0_thd3~0_20))))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_88, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_87, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][144], [278#true, 60#L847true, Black: 265#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 257#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 269#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 183#true, Black: 263#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), P2Thread1of1ForFork0InUse, Black: 185#(= ~__unbuffered_p3_EAX~0 0), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 256#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork3InUse, Black: 261#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork1InUse, Black: 186#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), P3Thread1of1ForFork2InUse, 23#L788true, 59#L778true, 41#L818true, 254#true, 219#true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 160#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 221#(= ~x~0 0), 31#L2-1true, Black: 222#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))]) [2022-11-16 11:39:36,582 INFO L383 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-11-16 11:39:36,583 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-16 11:39:36,583 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-16 11:39:36,583 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-16 11:39:36,584 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L811-->L818: Formula: (let ((.cse4 (not (= (mod v_~a$w_buff0_used~0_87 256) 0))) (.cse3 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_88 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse5 .cse4))) (and (= v_~a~0_38 (ite .cse0 v_~a$w_buff0~0_26 (ite .cse1 v_~a$w_buff1~0_31 v_~a~0_39))) (= (ite .cse0 0 v_~a$w_buff0_used~0_88) v_~a$w_buff0_used~0_87) (= (ite (or .cse2 .cse1) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a$r_buff0_thd3~0_19 (ite .cse2 0 v_~a$r_buff0_thd3~0_20))))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_88, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_87, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][193], [60#L847true, 283#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 265#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 257#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 269#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 183#true, Black: 263#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), P2Thread1of1ForFork0InUse, Black: 185#(= ~__unbuffered_p3_EAX~0 0), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 256#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork3InUse, Black: 261#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork1InUse, Black: 186#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), P3Thread1of1ForFork2InUse, 23#L788true, 59#L778true, 41#L818true, 254#true, 219#true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 160#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 140#L3-1true, Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 221#(= ~x~0 0), Black: 222#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))]) [2022-11-16 11:39:36,584 INFO L383 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-11-16 11:39:36,584 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-16 11:39:36,584 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-16 11:39:36,585 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-16 11:39:37,005 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L811-->L818: Formula: (let ((.cse4 (not (= (mod v_~a$w_buff0_used~0_87 256) 0))) (.cse3 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_88 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse5 .cse4))) (and (= v_~a~0_38 (ite .cse0 v_~a$w_buff0~0_26 (ite .cse1 v_~a$w_buff1~0_31 v_~a~0_39))) (= (ite .cse0 0 v_~a$w_buff0_used~0_88) v_~a$w_buff0_used~0_87) (= (ite (or .cse2 .cse1) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)) .cse4)) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a$r_buff0_thd3~0_19 (ite .cse2 0 v_~a$r_buff0_thd3~0_20))))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_88, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_87, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][144], [278#true, 60#L847true, Black: 265#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 257#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 269#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 183#true, Black: 263#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), P2Thread1of1ForFork0InUse, Black: 185#(= ~__unbuffered_p3_EAX~0 0), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 256#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork3InUse, Black: 261#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), P0Thread1of1ForFork1InUse, Black: 186#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), P3Thread1of1ForFork2InUse, 23#L788true, 59#L778true, 41#L818true, 254#true, 219#true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 160#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 221#(= ~x~0 0), 11#L889true, Black: 222#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))]) [2022-11-16 11:39:37,005 INFO L383 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2022-11-16 11:39:37,005 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-16 11:39:37,005 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-16 11:39:37,005 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-16 11:39:37,007 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([270] L889-->L892: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 1) (= 2 v_~x~0_4) (= v_~__unbuffered_p2_EBX~0_3 0) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][203], [278#true, 60#L847true, Black: 265#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 257#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 269#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 183#true, Black: 263#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), P2Thread1of1ForFork0InUse, Black: 185#(= ~__unbuffered_p3_EAX~0 0), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 256#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork3InUse, Black: 261#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 186#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 23#L788true, 59#L778true, 254#true, 219#true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 160#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 112#L811true, Black: 165#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 221#(= ~x~0 0), Black: 222#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 129#L892true]) [2022-11-16 11:39:37,007 INFO L383 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2022-11-16 11:39:37,007 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-16 11:39:37,007 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-16 11:39:37,007 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-16 11:39:37,746 INFO L130 PetriNetUnfolder]: 18165/32492 cut-off events. [2022-11-16 11:39:37,746 INFO L131 PetriNetUnfolder]: For 30105/40430 co-relation queries the response was YES. [2022-11-16 11:39:37,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76846 conditions, 32492 events. 18165/32492 cut-off events. For 30105/40430 co-relation queries the response was YES. Maximal size of possible extension queue 1844. Compared 299129 event pairs, 2364 based on Foata normal form. 12/30615 useless extension candidates. Maximal degree in co-relation 76764. Up to 9774 conditions per place. [2022-11-16 11:39:38,001 INFO L137 encePairwiseOnDemand]: 129/140 looper letters, 93 selfloop transitions, 20 changer transitions 0/225 dead transitions. [2022-11-16 11:39:38,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 225 transitions, 1071 flow [2022-11-16 11:39:38,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:39:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:39:38,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1237 transitions. [2022-11-16 11:39:38,008 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8835714285714286 [2022-11-16 11:39:38,009 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1237 transitions. [2022-11-16 11:39:38,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1237 transitions. [2022-11-16 11:39:38,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:38,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1237 transitions. [2022-11-16 11:39:38,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.7) internal successors, (1237), 10 states have internal predecessors, (1237), 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-16 11:39:38,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 140.0) internal successors, (1540), 11 states have internal predecessors, (1540), 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-16 11:39:38,016 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 140.0) internal successors, (1540), 11 states have internal predecessors, (1540), 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-16 11:39:38,017 INFO L175 Difference]: Start difference. First operand has 157 places, 136 transitions, 542 flow. Second operand 10 states and 1237 transitions. [2022-11-16 11:39:38,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 225 transitions, 1071 flow [2022-11-16 11:39:38,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 225 transitions, 1049 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-11-16 11:39:38,103 INFO L231 Difference]: Finished difference. Result has 158 places, 154 transitions, 663 flow [2022-11-16 11:39:38,103 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=663, PETRI_PLACES=158, PETRI_TRANSITIONS=154} [2022-11-16 11:39:38,104 INFO L288 CegarLoopForPetriNet]: 147 programPoint places, 11 predicate places. [2022-11-16 11:39:38,104 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 154 transitions, 663 flow [2022-11-16 11:39:38,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 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-16 11:39:38,105 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:38,105 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, 1, 1] [2022-11-16 11:39:38,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:39:38,105 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:39:38,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:38,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1763919384, now seen corresponding path program 1 times [2022-11-16 11:39:38,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:38,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905556016] [2022-11-16 11:39:38,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:38,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:38,417 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-16 11:39:38,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:38,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905556016] [2022-11-16 11:39:38,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905556016] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:38,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:38,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:39:38,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561116550] [2022-11-16 11:39:38,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:38,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:39:38,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:38,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:39:38,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:39:38,421 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140 [2022-11-16 11:39:38,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 154 transitions, 663 flow. Second operand has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 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-16 11:39:38,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:38,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140 [2022-11-16 11:39:38,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:42,119 INFO L130 PetriNetUnfolder]: 6637/18849 cut-off events. [2022-11-16 11:39:42,120 INFO L131 PetriNetUnfolder]: For 24904/28115 co-relation queries the response was YES. [2022-11-16 11:39:42,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50578 conditions, 18849 events. 6637/18849 cut-off events. For 24904/28115 co-relation queries the response was YES. Maximal size of possible extension queue 1238. Compared 226440 event pairs, 2754 based on Foata normal form. 373/17932 useless extension candidates. Maximal degree in co-relation 50495. Up to 3178 conditions per place. [2022-11-16 11:39:42,323 INFO L137 encePairwiseOnDemand]: 134/140 looper letters, 63 selfloop transitions, 16 changer transitions 4/207 dead transitions. [2022-11-16 11:39:42,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 207 transitions, 1047 flow [2022-11-16 11:39:42,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:39:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:39:42,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1111 transitions. [2022-11-16 11:39:42,327 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8817460317460317 [2022-11-16 11:39:42,327 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1111 transitions. [2022-11-16 11:39:42,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1111 transitions. [2022-11-16 11:39:42,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:42,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1111 transitions. [2022-11-16 11:39:42,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.44444444444444) internal successors, (1111), 9 states have internal predecessors, (1111), 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-16 11:39:42,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 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-16 11:39:42,333 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 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-16 11:39:42,333 INFO L175 Difference]: Start difference. First operand has 158 places, 154 transitions, 663 flow. Second operand 9 states and 1111 transitions. [2022-11-16 11:39:42,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 207 transitions, 1047 flow [2022-11-16 11:39:42,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 207 transitions, 1045 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:39:42,696 INFO L231 Difference]: Finished difference. Result has 172 places, 161 transitions, 784 flow [2022-11-16 11:39:42,696 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=784, PETRI_PLACES=172, PETRI_TRANSITIONS=161} [2022-11-16 11:39:42,697 INFO L288 CegarLoopForPetriNet]: 147 programPoint places, 25 predicate places. [2022-11-16 11:39:42,697 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 161 transitions, 784 flow [2022-11-16 11:39:42,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 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-16 11:39:42,698 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:42,698 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, 1, 1] [2022-11-16 11:39:42,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:39:42,698 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:39:42,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:42,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2143920718, now seen corresponding path program 1 times [2022-11-16 11:39:42,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:42,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717888503] [2022-11-16 11:39:42,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:42,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:42,960 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-16 11:39:42,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:42,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717888503] [2022-11-16 11:39:42,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717888503] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:42,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:42,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:39:42,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367599598] [2022-11-16 11:39:42,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:42,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:39:42,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:42,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:39:42,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:39:42,968 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2022-11-16 11:39:42,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 161 transitions, 784 flow. Second operand has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 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-16 11:39:42,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:42,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2022-11-16 11:39:42,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:50,682 INFO L130 PetriNetUnfolder]: 22505/41630 cut-off events. [2022-11-16 11:39:50,682 INFO L131 PetriNetUnfolder]: For 75998/86955 co-relation queries the response was YES. [2022-11-16 11:39:50,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130461 conditions, 41630 events. 22505/41630 cut-off events. For 75998/86955 co-relation queries the response was YES. Maximal size of possible extension queue 2558. Compared 415488 event pairs, 1564 based on Foata normal form. 763/40966 useless extension candidates. Maximal degree in co-relation 130371. Up to 8371 conditions per place. [2022-11-16 11:39:51,032 INFO L137 encePairwiseOnDemand]: 129/140 looper letters, 121 selfloop transitions, 38 changer transitions 0/278 dead transitions. [2022-11-16 11:39:51,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 278 transitions, 1712 flow [2022-11-16 11:39:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:39:51,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:39:51,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1613 transitions. [2022-11-16 11:39:51,035 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8862637362637362 [2022-11-16 11:39:51,035 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1613 transitions. [2022-11-16 11:39:51,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1613 transitions. [2022-11-16 11:39:51,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:51,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1613 transitions. [2022-11-16 11:39:51,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 124.07692307692308) internal successors, (1613), 13 states have internal predecessors, (1613), 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-16 11:39:51,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-16 11:39:51,045 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-16 11:39:51,045 INFO L175 Difference]: Start difference. First operand has 172 places, 161 transitions, 784 flow. Second operand 13 states and 1613 transitions. [2022-11-16 11:39:51,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 278 transitions, 1712 flow [2022-11-16 11:39:52,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 278 transitions, 1694 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-11-16 11:39:52,195 INFO L231 Difference]: Finished difference. Result has 189 places, 181 transitions, 1059 flow [2022-11-16 11:39:52,195 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1059, PETRI_PLACES=189, PETRI_TRANSITIONS=181} [2022-11-16 11:39:52,196 INFO L288 CegarLoopForPetriNet]: 147 programPoint places, 42 predicate places. [2022-11-16 11:39:52,196 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 181 transitions, 1059 flow [2022-11-16 11:39:52,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 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-16 11:39:52,196 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:52,196 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, 1, 1, 1, 1, 1] [2022-11-16 11:39:52,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:39:52,197 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:39:52,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:52,197 INFO L85 PathProgramCache]: Analyzing trace with hash -277426436, now seen corresponding path program 1 times [2022-11-16 11:39:52,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:52,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406909383] [2022-11-16 11:39:52,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:52,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:52,698 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-16 11:39:52,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:52,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406909383] [2022-11-16 11:39:52,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406909383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:52,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:52,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:39:52,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156277029] [2022-11-16 11:39:52,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:52,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:39:52,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:52,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:39:52,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:39:52,702 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2022-11-16 11:39:52,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 181 transitions, 1059 flow. Second operand has 7 states, 7 states have (on average 115.57142857142857) internal successors, (809), 7 states have internal predecessors, (809), 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-16 11:39:52,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:52,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2022-11-16 11:39:52,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:57,281 INFO L130 PetriNetUnfolder]: 7444/24046 cut-off events. [2022-11-16 11:39:57,281 INFO L131 PetriNetUnfolder]: For 76215/91681 co-relation queries the response was YES. [2022-11-16 11:39:57,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84058 conditions, 24046 events. 7444/24046 cut-off events. For 76215/91681 co-relation queries the response was YES. Maximal size of possible extension queue 2558. Compared 333546 event pairs, 1054 based on Foata normal form. 517/23067 useless extension candidates. Maximal degree in co-relation 83959. Up to 5585 conditions per place. [2022-11-16 11:39:57,558 INFO L137 encePairwiseOnDemand]: 134/140 looper letters, 68 selfloop transitions, 12 changer transitions 7/236 dead transitions. [2022-11-16 11:39:57,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 236 transitions, 1543 flow [2022-11-16 11:39:57,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:39:57,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 11:39:57,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 854 transitions. [2022-11-16 11:39:57,562 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8714285714285714 [2022-11-16 11:39:57,562 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 854 transitions. [2022-11-16 11:39:57,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 854 transitions. [2022-11-16 11:39:57,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:57,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 854 transitions. [2022-11-16 11:39:57,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-16 11:39:57,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 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-16 11:39:57,568 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 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-16 11:39:57,568 INFO L175 Difference]: Start difference. First operand has 189 places, 181 transitions, 1059 flow. Second operand 7 states and 854 transitions. [2022-11-16 11:39:57,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 236 transitions, 1543 flow [2022-11-16 11:40:04,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 236 transitions, 1448 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-11-16 11:40:04,666 INFO L231 Difference]: Finished difference. Result has 196 places, 191 transitions, 1124 flow [2022-11-16 11:40:04,666 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=964, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1124, PETRI_PLACES=196, PETRI_TRANSITIONS=191} [2022-11-16 11:40:04,667 INFO L288 CegarLoopForPetriNet]: 147 programPoint places, 49 predicate places. [2022-11-16 11:40:04,667 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 191 transitions, 1124 flow [2022-11-16 11:40:04,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.57142857142857) internal successors, (809), 7 states have internal predecessors, (809), 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-16 11:40:04,667 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:40:04,668 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, 1, 1, 1, 1, 1] [2022-11-16 11:40:04,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:40:04,668 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 11:40:04,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:40:04,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1946361502, now seen corresponding path program 2 times [2022-11-16 11:40:04,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:40:04,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947273777] [2022-11-16 11:40:04,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:04,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:40:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:04,995 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-16 11:40:04,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:40:04,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947273777] [2022-11-16 11:40:04,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947273777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:40:04,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:40:04,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:40:04,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062573583] [2022-11-16 11:40:04,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:40:04,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:40:04,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:40:04,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:40:04,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:40:04,999 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 140 [2022-11-16 11:40:05,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 191 transitions, 1124 flow. Second operand has 8 states, 8 states have (on average 107.25) internal successors, (858), 8 states have internal predecessors, (858), 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-16 11:40:05,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:40:05,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 140 [2022-11-16 11:40:05,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand