./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix047_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_b0658a19-816c-425d-96bd-80e2c46c6b50/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0658a19-816c-425d-96bd-80e2c46c6b50/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_b0658a19-816c-425d-96bd-80e2c46c6b50/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0658a19-816c-425d-96bd-80e2c46c6b50/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0658a19-816c-425d-96bd-80e2c46c6b50/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_b0658a19-816c-425d-96bd-80e2c46c6b50/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 dcc3fad0768415d67ba0b5226238487b935d262c55e83ab1790d239680fbb73d --- 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:52:26,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:52:26,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:52:26,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:52:26,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:52:26,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:52:26,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:52:26,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:52:26,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:52:26,613 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:52:26,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:52:26,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:52:26,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:52:26,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:52:26,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:52:26,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:52:26,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:52:26,623 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:52:26,625 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:52:26,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:52:26,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:52:26,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:52:26,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:52:26,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:52:26,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:52:26,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:52:26,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:52:26,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:52:26,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:52:26,644 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:52:26,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:52:26,645 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:52:26,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:52:26,647 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:52:26,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:52:26,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:52:26,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:52:26,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:52:26,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:52:26,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:52:26,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:52:26,662 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0658a19-816c-425d-96bd-80e2c46c6b50/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:52:26,696 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:52:26,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:52:26,707 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:52:26,708 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:52:26,708 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:52:26,709 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:52:26,709 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:52:26,710 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:52:26,710 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:52:26,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:52:26,711 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:52:26,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:52:26,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:52:26,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:52:26,712 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:52:26,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:52:26,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:52:26,712 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:52:26,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:52:26,713 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:52:26,713 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:52:26,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:52:26,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:52:26,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:52:26,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:52:26,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:52:26,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:52:26,715 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:52:26,715 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:52:26,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:52:26,715 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:52:26,716 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:52:26,716 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:52:26,716 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_b0658a19-816c-425d-96bd-80e2c46c6b50/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_b0658a19-816c-425d-96bd-80e2c46c6b50/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 -> dcc3fad0768415d67ba0b5226238487b935d262c55e83ab1790d239680fbb73d [2022-11-16 11:52:27,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:52:27,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:52:27,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:52:27,059 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:52:27,060 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:52:27,061 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0658a19-816c-425d-96bd-80e2c46c6b50/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i [2022-11-16 11:52:27,177 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0658a19-816c-425d-96bd-80e2c46c6b50/bin/uautomizer-tPACEb0tL8/data/9ee1017b9/0e8c854a01a74aa4b19070091602f831/FLAGf9e8e0a4b [2022-11-16 11:52:27,847 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:52:27,848 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0658a19-816c-425d-96bd-80e2c46c6b50/sv-benchmarks/c/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i [2022-11-16 11:52:27,881 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0658a19-816c-425d-96bd-80e2c46c6b50/bin/uautomizer-tPACEb0tL8/data/9ee1017b9/0e8c854a01a74aa4b19070091602f831/FLAGf9e8e0a4b [2022-11-16 11:52:28,124 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0658a19-816c-425d-96bd-80e2c46c6b50/bin/uautomizer-tPACEb0tL8/data/9ee1017b9/0e8c854a01a74aa4b19070091602f831 [2022-11-16 11:52:28,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:52:28,129 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:52:28,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:52:28,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:52:28,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:52:28,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:52:28" (1/1) ... [2022-11-16 11:52:28,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d7b8887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:28, skipping insertion in model container [2022-11-16 11:52:28,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:52:28" (1/1) ... [2022-11-16 11:52:28,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:52:28,210 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:52:28,478 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_b0658a19-816c-425d-96bd-80e2c46c6b50/sv-benchmarks/c/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-16 11:52:28,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:52:28,713 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:52:28,727 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_b0658a19-816c-425d-96bd-80e2c46c6b50/sv-benchmarks/c/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-16 11:52:28,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:52:28,848 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:52:28,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:28 WrapperNode [2022-11-16 11:52:28,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:52:28,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:52:28,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:52:28,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:52:28,858 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:52:28" (1/1) ... [2022-11-16 11:52:28,875 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:52:28" (1/1) ... [2022-11-16 11:52:28,902 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-11-16 11:52:28,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:52:28,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:52:28,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:52:28,903 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:52:28,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:28" (1/1) ... [2022-11-16 11:52:28,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:28" (1/1) ... [2022-11-16 11:52:28,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:28" (1/1) ... [2022-11-16 11:52:28,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:28" (1/1) ... [2022-11-16 11:52:28,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:28" (1/1) ... [2022-11-16 11:52:28,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:28" (1/1) ... [2022-11-16 11:52:28,935 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:28" (1/1) ... [2022-11-16 11:52:28,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:28" (1/1) ... [2022-11-16 11:52:28,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:52:28,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:52:28,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:52:28,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:52:28,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:28" (1/1) ... [2022-11-16 11:52:28,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:52:28,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0658a19-816c-425d-96bd-80e2c46c6b50/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:52:28,976 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0658a19-816c-425d-96bd-80e2c46c6b50/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:52:29,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0658a19-816c-425d-96bd-80e2c46c6b50/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:52:29,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:52:29,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:52:29,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:52:29,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:52:29,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:52:29,040 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:52:29,040 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:52:29,042 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:52:29,043 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:52:29,043 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:52:29,044 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:52:29,045 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-16 11:52:29,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-16 11:52:29,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:52:29,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:52:29,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:52:29,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:52:29,049 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:52:29,265 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:52:29,268 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:52:29,792 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:52:30,151 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:52:30,158 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:52:30,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:52:30 BoogieIcfgContainer [2022-11-16 11:52:30,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:52:30,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:52:30,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:52:30,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:52:30,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:52:28" (1/3) ... [2022-11-16 11:52:30,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a73dc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:52:30, skipping insertion in model container [2022-11-16 11:52:30,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:28" (2/3) ... [2022-11-16 11:52:30,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a73dc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:52:30, skipping insertion in model container [2022-11-16 11:52:30,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:52:30" (3/3) ... [2022-11-16 11:52:30,188 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.oepc_pso.oepc_rmo.oepc.i [2022-11-16 11:52:30,198 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:52:30,211 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:52:30,211 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 11:52:30,211 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:52:30,285 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:52:30,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 296 flow [2022-11-16 11:52:30,397 INFO L130 PetriNetUnfolder]: 2/134 cut-off events. [2022-11-16 11:52:30,397 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:52:30,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-11-16 11:52:30,404 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 138 transitions, 296 flow [2022-11-16 11:52:30,410 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 134 transitions, 280 flow [2022-11-16 11:52:30,422 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:52:30,431 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;@2b8a6002, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:52:30,431 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-16 11:52:30,445 INFO L130 PetriNetUnfolder]: 0/50 cut-off events. [2022-11-16 11:52:30,446 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:52:30,446 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:52:30,447 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:52:30,448 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:52:30,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:30,454 INFO L85 PathProgramCache]: Analyzing trace with hash -699704802, now seen corresponding path program 1 times [2022-11-16 11:52:30,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:30,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285705437] [2022-11-16 11:52:30,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:30,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:31,117 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:52:31,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:31,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285705437] [2022-11-16 11:52:31,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285705437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:52:31,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:52:31,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:52:31,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389416919] [2022-11-16 11:52:31,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:52:31,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:52:31,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:31,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:52:31,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:52:31,194 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 138 [2022-11-16 11:52:31,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 134 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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:52:31,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:52:31,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 138 [2022-11-16 11:52:31,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:52:31,540 INFO L130 PetriNetUnfolder]: 162/548 cut-off events. [2022-11-16 11:52:31,540 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-11-16 11:52:31,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 548 events. 162/548 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2850 event pairs, 34 based on Foata normal form. 53/572 useless extension candidates. Maximal degree in co-relation 797. Up to 191 conditions per place. [2022-11-16 11:52:31,562 INFO L137 encePairwiseOnDemand]: 133/138 looper letters, 18 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2022-11-16 11:52:31,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 138 transitions, 337 flow [2022-11-16 11:52:31,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:52:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:52:31,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2022-11-16 11:52:31,582 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2022-11-16 11:52:31,583 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 391 transitions. [2022-11-16 11:52:31,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions. [2022-11-16 11:52:31,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:52:31,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions. [2022-11-16 11:52:31,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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:52:31,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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:52:31,602 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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:52:31,605 INFO L175 Difference]: Start difference. First operand has 145 places, 134 transitions, 280 flow. Second operand 3 states and 391 transitions. [2022-11-16 11:52:31,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 138 transitions, 337 flow [2022-11-16 11:52:31,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 138 transitions, 330 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:52:31,616 INFO L231 Difference]: Finished difference. Result has 141 places, 130 transitions, 272 flow [2022-11-16 11:52:31,618 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=141, PETRI_TRANSITIONS=130} [2022-11-16 11:52:31,623 INFO L288 CegarLoopForPetriNet]: 145 programPoint places, -4 predicate places. [2022-11-16 11:52:31,623 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 130 transitions, 272 flow [2022-11-16 11:52:31,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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:52:31,624 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:52:31,625 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] [2022-11-16 11:52:31,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:52:31,625 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:52:31,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:31,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1128804172, now seen corresponding path program 1 times [2022-11-16 11:52:31,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:31,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479411907] [2022-11-16 11:52:31,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:31,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:32,389 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:52:32,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:32,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479411907] [2022-11-16 11:52:32,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479411907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:52:32,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:52:32,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:52:32,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994895545] [2022-11-16 11:52:32,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:52:32,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:52:32,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:32,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:52:32,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:52:32,395 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 138 [2022-11-16 11:52:32,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 130 transitions, 272 flow. Second operand has 7 states, 7 states have (on average 106.28571428571429) internal successors, (744), 7 states have internal predecessors, (744), 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:52:32,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:52:32,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 138 [2022-11-16 11:52:32,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:52:41,287 INFO L130 PetriNetUnfolder]: 19160/41549 cut-off events. [2022-11-16 11:52:41,287 INFO L131 PetriNetUnfolder]: For 1621/1621 co-relation queries the response was YES. [2022-11-16 11:52:41,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69394 conditions, 41549 events. 19160/41549 cut-off events. For 1621/1621 co-relation queries the response was YES. Maximal size of possible extension queue 1617. Compared 447658 event pairs, 1646 based on Foata normal form. 0/40454 useless extension candidates. Maximal degree in co-relation 69334. Up to 7909 conditions per place. [2022-11-16 11:52:41,578 INFO L137 encePairwiseOnDemand]: 124/138 looper letters, 49 selfloop transitions, 12 changer transitions 137/285 dead transitions. [2022-11-16 11:52:41,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 285 transitions, 980 flow [2022-11-16 11:52:41,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:52:41,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:52:41,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1540 transitions. [2022-11-16 11:52:41,586 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8584169453734671 [2022-11-16 11:52:41,586 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1540 transitions. [2022-11-16 11:52:41,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1540 transitions. [2022-11-16 11:52:41,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:52:41,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1540 transitions. [2022-11-16 11:52:41,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 118.46153846153847) internal successors, (1540), 13 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:52:41,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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:52:41,601 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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:52:41,601 INFO L175 Difference]: Start difference. First operand has 141 places, 130 transitions, 272 flow. Second operand 13 states and 1540 transitions. [2022-11-16 11:52:41,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 285 transitions, 980 flow [2022-11-16 11:52:41,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 285 transitions, 954 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:52:41,610 INFO L231 Difference]: Finished difference. Result has 163 places, 126 transitions, 382 flow [2022-11-16 11:52:41,611 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=382, PETRI_PLACES=163, PETRI_TRANSITIONS=126} [2022-11-16 11:52:41,612 INFO L288 CegarLoopForPetriNet]: 145 programPoint places, 18 predicate places. [2022-11-16 11:52:41,612 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 126 transitions, 382 flow [2022-11-16 11:52:41,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.28571428571429) internal successors, (744), 7 states have internal predecessors, (744), 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:52:41,613 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:52:41,614 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:52:41,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:52:41,614 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:52:41,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:41,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1317320459, now seen corresponding path program 1 times [2022-11-16 11:52:41,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:41,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685718786] [2022-11-16 11:52:41,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:41,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:42,068 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:52:42,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:42,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685718786] [2022-11-16 11:52:42,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685718786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:52:42,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:52:42,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:52:42,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142281043] [2022-11-16 11:52:42,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:52:42,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:52:42,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:42,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:52:42,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:52:42,078 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 138 [2022-11-16 11:52:42,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 126 transitions, 382 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:52:42,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:52:42,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 138 [2022-11-16 11:52:42,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:52:45,987 INFO L130 PetriNetUnfolder]: 9725/17799 cut-off events. [2022-11-16 11:52:45,995 INFO L131 PetriNetUnfolder]: For 31418/32227 co-relation queries the response was YES. [2022-11-16 11:52:46,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52065 conditions, 17799 events. 9725/17799 cut-off events. For 31418/32227 co-relation queries the response was YES. Maximal size of possible extension queue 1074. Compared 157030 event pairs, 3119 based on Foata normal form. 583/17480 useless extension candidates. Maximal degree in co-relation 51995. Up to 7767 conditions per place. [2022-11-16 11:52:46,225 INFO L137 encePairwiseOnDemand]: 131/138 looper letters, 31 selfloop transitions, 5 changer transitions 67/206 dead transitions. [2022-11-16 11:52:46,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 206 transitions, 1034 flow [2022-11-16 11:52:46,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:52:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:52:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1098 transitions. [2022-11-16 11:52:46,232 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8840579710144928 [2022-11-16 11:52:46,233 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1098 transitions. [2022-11-16 11:52:46,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1098 transitions. [2022-11-16 11:52:46,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:52:46,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1098 transitions. [2022-11-16 11:52:46,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.0) internal successors, (1098), 9 states have internal predecessors, (1098), 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:52:46,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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:52:46,243 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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:52:46,244 INFO L175 Difference]: Start difference. First operand has 163 places, 126 transitions, 382 flow. Second operand 9 states and 1098 transitions. [2022-11-16 11:52:46,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 206 transitions, 1034 flow [2022-11-16 11:52:46,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 206 transitions, 1020 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-11-16 11:52:46,610 INFO L231 Difference]: Finished difference. Result has 152 places, 130 transitions, 469 flow [2022-11-16 11:52:46,610 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=469, PETRI_PLACES=152, PETRI_TRANSITIONS=130} [2022-11-16 11:52:46,611 INFO L288 CegarLoopForPetriNet]: 145 programPoint places, 7 predicate places. [2022-11-16 11:52:46,611 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 130 transitions, 469 flow [2022-11-16 11:52:46,612 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:52:46,612 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:52:46,612 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:52:46,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:52:46,613 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:52:46,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:46,613 INFO L85 PathProgramCache]: Analyzing trace with hash -345262318, now seen corresponding path program 1 times [2022-11-16 11:52:46,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:46,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783102079] [2022-11-16 11:52:46,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:46,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:46,903 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:52:46,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:46,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783102079] [2022-11-16 11:52:46,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783102079] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:52:46,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:52:46,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:52:46,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308988440] [2022-11-16 11:52:46,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:52:46,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:52:46,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:46,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:52:46,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:52:46,908 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 138 [2022-11-16 11:52:46,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 130 transitions, 469 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:52:46,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:52:46,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 138 [2022-11-16 11:52:46,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:52:50,429 INFO L130 PetriNetUnfolder]: 9545/17132 cut-off events. [2022-11-16 11:52:50,429 INFO L131 PetriNetUnfolder]: For 49968/50242 co-relation queries the response was YES. [2022-11-16 11:52:50,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55641 conditions, 17132 events. 9545/17132 cut-off events. For 49968/50242 co-relation queries the response was YES. Maximal size of possible extension queue 998. Compared 145792 event pairs, 2560 based on Foata normal form. 412/17094 useless extension candidates. Maximal degree in co-relation 55565. Up to 7765 conditions per place. [2022-11-16 11:52:50,674 INFO L137 encePairwiseOnDemand]: 131/138 looper letters, 27 selfloop transitions, 5 changer transitions 61/200 dead transitions. [2022-11-16 11:52:50,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 200 transitions, 1039 flow [2022-11-16 11:52:50,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:52:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:52:50,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1092 transitions. [2022-11-16 11:52:50,680 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8792270531400966 [2022-11-16 11:52:50,680 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1092 transitions. [2022-11-16 11:52:50,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1092 transitions. [2022-11-16 11:52:50,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:52:50,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1092 transitions. [2022-11-16 11:52:50,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.33333333333333) internal successors, (1092), 9 states have internal predecessors, (1092), 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:52:50,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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:52:50,693 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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:52:50,694 INFO L175 Difference]: Start difference. First operand has 152 places, 130 transitions, 469 flow. Second operand 9 states and 1092 transitions. [2022-11-16 11:52:50,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 200 transitions, 1039 flow [2022-11-16 11:52:50,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 200 transitions, 1014 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-11-16 11:52:50,837 INFO L231 Difference]: Finished difference. Result has 157 places, 134 transitions, 545 flow [2022-11-16 11:52:50,843 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=545, PETRI_PLACES=157, PETRI_TRANSITIONS=134} [2022-11-16 11:52:50,845 INFO L288 CegarLoopForPetriNet]: 145 programPoint places, 12 predicate places. [2022-11-16 11:52:50,845 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 134 transitions, 545 flow [2022-11-16 11:52:50,846 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:52:50,846 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:52:50,846 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:52:50,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:52:50,847 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:52:50,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:50,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1137230063, now seen corresponding path program 1 times [2022-11-16 11:52:50,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:50,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537000289] [2022-11-16 11:52:50,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:50,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:51,233 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:52:51,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:51,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537000289] [2022-11-16 11:52:51,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537000289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:52:51,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:52:51,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:52:51,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002461778] [2022-11-16 11:52:51,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:52:51,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:52:51,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:51,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:52:51,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:52:51,238 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 138 [2022-11-16 11:52:51,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 134 transitions, 545 flow. Second operand has 7 states, 7 states have (on average 106.71428571428571) internal successors, (747), 7 states have internal predecessors, (747), 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:52:51,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:52:51,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 138 [2022-11-16 11:52:51,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:52:55,992 INFO L130 PetriNetUnfolder]: 10819/18761 cut-off events. [2022-11-16 11:52:55,992 INFO L131 PetriNetUnfolder]: For 92173/92320 co-relation queries the response was YES. [2022-11-16 11:52:56,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69258 conditions, 18761 events. 10819/18761 cut-off events. For 92173/92320 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 151586 event pairs, 1376 based on Foata normal form. 396/18898 useless extension candidates. Maximal degree in co-relation 69173. Up to 4130 conditions per place. [2022-11-16 11:52:56,175 INFO L137 encePairwiseOnDemand]: 126/138 looper letters, 67 selfloop transitions, 17 changer transitions 130/301 dead transitions. [2022-11-16 11:52:56,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 301 transitions, 2319 flow [2022-11-16 11:52:56,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:52:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:52:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1519 transitions. [2022-11-16 11:52:56,186 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.846711259754738 [2022-11-16 11:52:56,186 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1519 transitions. [2022-11-16 11:52:56,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1519 transitions. [2022-11-16 11:52:56,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:52:56,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1519 transitions. [2022-11-16 11:52:56,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 116.84615384615384) internal successors, (1519), 13 states have internal predecessors, (1519), 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:52:56,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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:52:56,198 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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:52:56,198 INFO L175 Difference]: Start difference. First operand has 157 places, 134 transitions, 545 flow. Second operand 13 states and 1519 transitions. [2022-11-16 11:52:56,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 301 transitions, 2319 flow [2022-11-16 11:52:56,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 301 transitions, 2274 flow, removed 20 selfloop flow, removed 4 redundant places. [2022-11-16 11:52:56,362 INFO L231 Difference]: Finished difference. Result has 171 places, 147 transitions, 808 flow [2022-11-16 11:52:56,362 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=808, PETRI_PLACES=171, PETRI_TRANSITIONS=147} [2022-11-16 11:52:56,363 INFO L288 CegarLoopForPetriNet]: 145 programPoint places, 26 predicate places. [2022-11-16 11:52:56,363 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 147 transitions, 808 flow [2022-11-16 11:52:56,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.71428571428571) internal successors, (747), 7 states have internal predecessors, (747), 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:52:56,364 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:52:56,364 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:52:56,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:52:56,365 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:52:56,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:56,368 INFO L85 PathProgramCache]: Analyzing trace with hash -495667460, now seen corresponding path program 1 times [2022-11-16 11:52:56,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:56,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645330505] [2022-11-16 11:52:56,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:56,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:56,699 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:52:56,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:56,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645330505] [2022-11-16 11:52:56,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645330505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:52:56,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:52:56,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:52:56,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082570264] [2022-11-16 11:52:56,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:52:56,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:52:56,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:56,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:52:56,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:52:56,705 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 138 [2022-11-16 11:52:56,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 147 transitions, 808 flow. Second operand has 7 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 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:52:56,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:52:56,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 138 [2022-11-16 11:52:56,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:53:01,473 INFO L130 PetriNetUnfolder]: 11015/19634 cut-off events. [2022-11-16 11:53:01,474 INFO L131 PetriNetUnfolder]: For 143793/144097 co-relation queries the response was YES. [2022-11-16 11:53:01,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79813 conditions, 19634 events. 11015/19634 cut-off events. For 143793/144097 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 162626 event pairs, 1744 based on Foata normal form. 403/19323 useless extension candidates. Maximal degree in co-relation 79718. Up to 4484 conditions per place. [2022-11-16 11:53:01,684 INFO L137 encePairwiseOnDemand]: 125/138 looper letters, 65 selfloop transitions, 36 changer transitions 101/289 dead transitions. [2022-11-16 11:53:01,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 289 transitions, 2472 flow [2022-11-16 11:53:01,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:53:01,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:53:01,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1507 transitions. [2022-11-16 11:53:01,690 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8400222965440357 [2022-11-16 11:53:01,690 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1507 transitions. [2022-11-16 11:53:01,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1507 transitions. [2022-11-16 11:53:01,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:53:01,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1507 transitions. [2022-11-16 11:53:01,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 115.92307692307692) internal successors, (1507), 13 states have internal predecessors, (1507), 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:53:01,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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:53:01,701 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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:53:01,702 INFO L175 Difference]: Start difference. First operand has 171 places, 147 transitions, 808 flow. Second operand 13 states and 1507 transitions. [2022-11-16 11:53:01,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 289 transitions, 2472 flow [2022-11-16 11:53:02,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 289 transitions, 2362 flow, removed 52 selfloop flow, removed 4 redundant places. [2022-11-16 11:53:02,251 INFO L231 Difference]: Finished difference. Result has 182 places, 160 transitions, 1157 flow [2022-11-16 11:53:02,252 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1157, PETRI_PLACES=182, PETRI_TRANSITIONS=160} [2022-11-16 11:53:02,253 INFO L288 CegarLoopForPetriNet]: 145 programPoint places, 37 predicate places. [2022-11-16 11:53:02,253 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 160 transitions, 1157 flow [2022-11-16 11:53:02,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 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:53:02,254 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:53:02,254 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:53:02,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:53:02,254 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:53:02,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:53:02,255 INFO L85 PathProgramCache]: Analyzing trace with hash -953240334, now seen corresponding path program 1 times [2022-11-16 11:53:02,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:53:02,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990837731] [2022-11-16 11:53:02,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:53:02,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:53:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:02,576 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:53:02,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:53:02,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990837731] [2022-11-16 11:53:02,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990837731] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:53:02,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:53:02,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:53:02,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975205155] [2022-11-16 11:53:02,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:53:02,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:53:02,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:53:02,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:53:02,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:53:02,589 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 138 [2022-11-16 11:53:02,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 160 transitions, 1157 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 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:53:02,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:53:02,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 138 [2022-11-16 11:53:02,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:53:15,372 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([421] L827-->L843: Formula: (let ((.cse3 (= (mod v_~b$r_buff1_thd4~0_62 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse7)) (.cse12 (= (mod v_~b$w_buff0_used~0_154 256) 0)) (.cse5 (and .cse3 .cse7)) (.cse6 (and .cse7 (= (mod v_~b$w_buff1_used~0_141 256) 0)))) (let ((.cse9 (or .cse12 .cse5 .cse6)) (.cse10 (and .cse8 (not .cse12)))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_140 256) 0)) (.cse4 (= (mod v_~b$w_buff0_used~0_153 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse11 (ite .cse9 v_~b~0_78 (ite .cse10 v_~b$w_buff0~0_51 v_~b$w_buff1~0_46)))) (and (= v_~b$mem_tmp~0_18 v_~b~0_78) (= v_~weak$$choice2~0_34 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~b$flush_delayed~0_25 0) (= v_~b$r_buff1_thd4~0_61 (ite .cse0 v_~b$r_buff1_thd4~0_62 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~b$r_buff1_thd4~0_62 0))) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~b$w_buff0~0_51 v_~b$w_buff0~0_50) (= (ite .cse0 v_~b$w_buff1_used~0_141 (ite (or .cse4 .cse5 .cse6) v_~b$w_buff1_used~0_141 0)) v_~b$w_buff1_used~0_140) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or .cse4 .cse5 (and .cse1 .cse7)) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse4)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= v_~b$w_buff1~0_45 v_~b$w_buff1~0_46) (= v_~b$w_buff0_used~0_153 (ite .cse0 v_~b$w_buff0_used~0_154 (ite .cse9 v_~b$w_buff0_used~0_154 (ite .cse10 0 v_~b$w_buff0_used~0_154)))) (= .cse11 v_~__unbuffered_p3_EBX~0_16) (= v_~b~0_76 (ite .cse0 v_~b$mem_tmp~0_18 .cse11))))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_154, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~b~0=v_~b~0_78, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_141, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_62, ~b$w_buff1~0=v_~b$w_buff1~0_46, ~b$w_buff0~0=v_~b$w_buff0~0_51, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_153, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_76, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_140, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_61, ~b$w_buff1~0=v_~b$w_buff1~0_45, ~b$w_buff0~0=v_~b$w_buff0~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][192], [278#(= ~y~0 1), 240#true, Black: 260#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 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|))), 312#true, Black: 262#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 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|))), Black: 243#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 244#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 242#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork0InUse, Black: 252#(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: 201#(and (= ~x~0 0) (<= 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: 256#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 205#(and (= ~x~0 0) (<= 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|))), P1Thread1of1ForFork3InUse, Black: 258#(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|))), Black: 194#(= ~x~0 0), P0Thread1of1ForFork1InUse, 156#true, Black: 199#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork2InUse, 21#L774true, 46#L843true, 45#L784true, 48#L18-2true, Black: 225#(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|)) (= ~z~0 0)), Black: 229#(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|)) (= ~z~0 0)), Black: 218#(= ~z~0 0), Black: 288#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 125#L814true, Black: 223#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 298#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 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|))), Black: 292#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 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: 294#(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|)) (= ~y~0 1)), Black: 276#true, Black: 286#(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|)) (= ~y~0 1)), Black: 280#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 290#(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: 170#(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: 296#(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|))), Black: 284#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 279#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 176#(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|))), Black: 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 174#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 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: 178#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 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|))), Black: 158#(= ~y~0 0)]) [2022-11-16 11:53:15,373 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-16 11:53:15,373 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 11:53:15,374 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 11:53:15,374 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 11:53:15,410 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([399] L764-->L771: Formula: (let ((.cse3 (not (= (mod v_~b$r_buff1_thd1~0_16 256) 0))) (.cse4 (not (= (mod v_~b$w_buff0_used~0_111 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd1~0_23 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~b$w_buff0_used~0_112 256) 0)))) (.cse1 (and .cse4 .cse5)) (.cse2 (and (not (= 0 (mod v_~b$w_buff1_used~0_105 256))) .cse3))) (and (= v_~b$w_buff0_used~0_111 (ite .cse0 0 v_~b$w_buff0_used~0_112)) (= v_~b$r_buff0_thd1~0_22 (ite .cse1 0 v_~b$r_buff0_thd1~0_23)) (= (ite .cse0 v_~b$w_buff0~0_28 (ite .cse2 v_~b$w_buff1~0_27 v_~b~0_53)) v_~b~0_52) (= (ite (or .cse1 .cse2) 0 v_~b$w_buff1_used~0_105) v_~b$w_buff1_used~0_104) (= v_~b$r_buff1_thd1~0_15 (ite (or (and .cse3 (not (= (mod v_~b$w_buff1_used~0_104 256) 0))) (and .cse4 (not (= (mod v_~b$r_buff0_thd1~0_22 256) 0)))) 0 v_~b$r_buff1_thd1~0_16))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_112, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_23, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_16, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_105, ~b~0=v_~b~0_53, ~b$w_buff1~0=v_~b$w_buff1~0_27, ~b$w_buff0~0=v_~b$w_buff0~0_28} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_111, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_22, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_15, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_104, ~b~0=v_~b~0_52, ~b$w_buff1~0=v_~b$w_buff1~0_27, ~b$w_buff0~0=v_~b$w_buff0~0_28} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$w_buff1_used~0, ~b~0][195], [278#(= ~y~0 1), 33#L853true, Black: 260#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 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|))), 243#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 312#true, Black: 240#true, Black: 262#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 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|))), Black: 244#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 242#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork0InUse, Black: 252#(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: 201#(and (= ~x~0 0) (<= 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: 205#(and (= ~x~0 0) (<= 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|))), Black: 256#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, Black: 258#(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|))), Black: 194#(= ~x~0 0), P0Thread1of1ForFork1InUse, Black: 199#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork2InUse, 6#L889-1true, Black: 225#(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|)) (= ~z~0 0)), 36#L794true, 159#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 229#(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|)) (= ~z~0 0)), Black: 288#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 218#(= ~z~0 0), Black: 298#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 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|))), 125#L814true, Black: 223#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 292#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 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: 294#(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|)) (= ~y~0 1)), Black: 276#true, Black: 286#(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|)) (= ~y~0 1)), Black: 280#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 140#L771true, Black: 170#(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: 290#(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: 296#(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|))), Black: 156#true, Black: 284#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y~0 1)), Black: 279#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 168#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 176#(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|))), Black: 174#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 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: 178#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 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|))), Black: 158#(= ~y~0 0)]) [2022-11-16 11:53:15,410 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-16 11:53:15,411 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 11:53:15,411 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 11:53:15,411 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-16 11:53:15,821 INFO L130 PetriNetUnfolder]: 31872/56207 cut-off events. [2022-11-16 11:53:15,821 INFO L131 PetriNetUnfolder]: For 159028/183346 co-relation queries the response was YES. [2022-11-16 11:53:16,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146216 conditions, 56207 events. 31872/56207 cut-off events. For 159028/183346 co-relation queries the response was YES. Maximal size of possible extension queue 3345. Compared 553337 event pairs, 1756 based on Foata normal form. 542/53774 useless extension candidates. Maximal degree in co-relation 146115. Up to 18146 conditions per place. [2022-11-16 11:53:16,488 INFO L137 encePairwiseOnDemand]: 127/138 looper letters, 109 selfloop transitions, 20 changer transitions 0/263 dead transitions. [2022-11-16 11:53:16,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 263 transitions, 2005 flow [2022-11-16 11:53:16,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:53:16,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:53:16,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1217 transitions. [2022-11-16 11:53:16,492 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8818840579710145 [2022-11-16 11:53:16,492 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1217 transitions. [2022-11-16 11:53:16,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1217 transitions. [2022-11-16 11:53:16,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:53:16,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1217 transitions. [2022-11-16 11:53:16,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 121.7) internal successors, (1217), 10 states have internal predecessors, (1217), 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:53:16,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 138.0) internal successors, (1518), 11 states have internal predecessors, (1518), 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:53:16,501 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 138.0) internal successors, (1518), 11 states have internal predecessors, (1518), 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:53:16,501 INFO L175 Difference]: Start difference. First operand has 182 places, 160 transitions, 1157 flow. Second operand 10 states and 1217 transitions. [2022-11-16 11:53:16,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 263 transitions, 2005 flow [2022-11-16 11:53:16,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 263 transitions, 1971 flow, removed 17 selfloop flow, removed 9 redundant places. [2022-11-16 11:53:16,722 INFO L231 Difference]: Finished difference. Result has 179 places, 178 transitions, 1266 flow [2022-11-16 11:53:16,723 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1266, PETRI_PLACES=179, PETRI_TRANSITIONS=178} [2022-11-16 11:53:16,724 INFO L288 CegarLoopForPetriNet]: 145 programPoint places, 34 predicate places. [2022-11-16 11:53:16,724 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 178 transitions, 1266 flow [2022-11-16 11:53:16,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 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:53:16,725 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:53:16,725 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:53:16,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:53:16,726 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:53:16,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:53:16,726 INFO L85 PathProgramCache]: Analyzing trace with hash -457602436, now seen corresponding path program 1 times [2022-11-16 11:53:16,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:53:16,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528176633] [2022-11-16 11:53:16,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:53:16,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:53:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:53:17,042 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:53:17,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:53:17,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528176633] [2022-11-16 11:53:17,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528176633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:53:17,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:53:17,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:53:17,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932285426] [2022-11-16 11:53:17,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:53:17,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:53:17,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:53:17,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:53:17,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:53:17,046 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 138 [2022-11-16 11:53:17,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 178 transitions, 1266 flow. Second operand has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:53:17,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:53:17,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 138 [2022-11-16 11:53:17,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand