./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ --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 8e4241de9ab6aaee40e34a0aea220f2af2541cd79c1f3c4ee08672ad0bf05f65 --- 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-dbf71c6-m [2022-10-17 10:34:40,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 10:34:40,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 10:34:40,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 10:34:40,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 10:34:40,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 10:34:40,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 10:34:40,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 10:34:40,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 10:34:40,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 10:34:40,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 10:34:40,480 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 10:34:40,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 10:34:40,481 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 10:34:40,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 10:34:40,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 10:34:40,485 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 10:34:40,487 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 10:34:40,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 10:34:40,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 10:34:40,494 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 10:34:40,496 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 10:34:40,497 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 10:34:40,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 10:34:40,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 10:34:40,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 10:34:40,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 10:34:40,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 10:34:40,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 10:34:40,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 10:34:40,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 10:34:40,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 10:34:40,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 10:34:40,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 10:34:40,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 10:34:40,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 10:34:40,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 10:34:40,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 10:34:40,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 10:34:40,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 10:34:40,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 10:34:40,517 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-10-17 10:34:40,548 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 10:34:40,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 10:34:40,550 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 10:34:40,550 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 10:34:40,551 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 10:34:40,551 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 10:34:40,552 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 10:34:40,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 10:34:40,552 INFO L138 SettingsManager]: * Use SBE=true [2022-10-17 10:34:40,553 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 10:34:40,553 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 10:34:40,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 10:34:40,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 10:34:40,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 10:34:40,554 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 10:34:40,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 10:34:40,554 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 10:34:40,554 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 10:34:40,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 10:34:40,554 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 10:34:40,555 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 10:34:40,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 10:34:40,555 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-17 10:34:40,555 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 10:34:40,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:34:40,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 10:34:40,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 10:34:40,556 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 10:34:40,556 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-17 10:34:40,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 10:34:40,557 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-17 10:34:40,557 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-10-17 10:34:40,557 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 10:34:40,557 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_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ/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_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ 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 -> 8e4241de9ab6aaee40e34a0aea220f2af2541cd79c1f3c4ee08672ad0bf05f65 [2022-10-17 10:34:40,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 10:34:40,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 10:34:40,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 10:34:40,837 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 10:34:40,838 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 10:34:40,840 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ/../../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i [2022-10-17 10:34:40,913 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ/data/e746875df/d5ed62580f8e4d5ebddfa74130566fc9/FLAG2720d5efa [2022-10-17 10:34:41,493 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 10:34:41,494 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i [2022-10-17 10:34:41,516 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ/data/e746875df/d5ed62580f8e4d5ebddfa74130566fc9/FLAG2720d5efa [2022-10-17 10:34:41,937 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ/data/e746875df/d5ed62580f8e4d5ebddfa74130566fc9 [2022-10-17 10:34:41,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 10:34:41,942 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 10:34:41,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 10:34:41,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 10:34:41,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 10:34:41,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:34:41" (1/1) ... [2022-10-17 10:34:41,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b3c3ee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:34:41, skipping insertion in model container [2022-10-17 10:34:41,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:34:41" (1/1) ... [2022-10-17 10:34:41,962 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 10:34:42,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 10:34:42,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i[47038,47051] [2022-10-17 10:34:42,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:34:42,647 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 10:34:42,712 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing.i[47038,47051] [2022-10-17 10:34:42,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:34:42,795 INFO L208 MainTranslator]: Completed translation [2022-10-17 10:34:42,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:34:42 WrapperNode [2022-10-17 10:34:42,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 10:34:42,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 10:34:42,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 10:34:42,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 10:34:42,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:34:42" (1/1) ... [2022-10-17 10:34:42,825 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:34:42" (1/1) ... [2022-10-17 10:34:42,859 INFO L138 Inliner]: procedures = 271, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 198 [2022-10-17 10:34:42,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 10:34:42,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 10:34:42,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 10:34:42,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 10:34:42,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:34:42" (1/1) ... [2022-10-17 10:34:42,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:34:42" (1/1) ... [2022-10-17 10:34:42,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:34:42" (1/1) ... [2022-10-17 10:34:42,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:34:42" (1/1) ... [2022-10-17 10:34:42,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:34:42" (1/1) ... [2022-10-17 10:34:42,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:34:42" (1/1) ... [2022-10-17 10:34:42,897 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:34:42" (1/1) ... [2022-10-17 10:34:42,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:34:42" (1/1) ... [2022-10-17 10:34:42,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 10:34:42,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 10:34:42,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 10:34:42,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 10:34:42,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:34:42" (1/1) ... [2022-10-17 10:34:42,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:34:42,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:34:42,971 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 10:34:42,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 10:34:43,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-17 10:34:43,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-17 10:34:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-17 10:34:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-17 10:34:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-10-17 10:34:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 10:34:43,023 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-10-17 10:34:43,023 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-10-17 10:34:43,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 10:34:43,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 10:34:43,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 10:34:43,026 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-17 10:34:43,200 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 10:34:43,203 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 10:34:43,645 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 10:34:43,660 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 10:34:43,660 INFO L300 CfgBuilder]: Removed 22 assume(true) statements. [2022-10-17 10:34:43,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:34:43 BoogieIcfgContainer [2022-10-17 10:34:43,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 10:34:43,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 10:34:43,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 10:34:43,674 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 10:34:43,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 10:34:41" (1/3) ... [2022-10-17 10:34:43,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205d47a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:34:43, skipping insertion in model container [2022-10-17 10:34:43,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:34:42" (2/3) ... [2022-10-17 10:34:43,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205d47a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:34:43, skipping insertion in model container [2022-10-17 10:34:43,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:34:43" (3/3) ... [2022-10-17 10:34:43,678 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_78-equ_racing.i [2022-10-17 10:34:43,688 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-17 10:34:43,700 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 10:34:43,700 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-17 10:34:43,700 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-17 10:34:43,808 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-10-17 10:34:43,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 203 transitions, 414 flow [2022-10-17 10:34:44,020 INFO L130 PetriNetUnfolder]: 42/275 cut-off events. [2022-10-17 10:34:44,021 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-10-17 10:34:44,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 275 events. 42/275 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 875 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 135. Up to 8 conditions per place. [2022-10-17 10:34:44,028 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 203 transitions, 414 flow [2022-10-17 10:34:44,037 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 198 transitions, 401 flow [2022-10-17 10:34:44,079 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 10:34:44,094 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;@2815c454, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 10:34:44,095 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-10-17 10:34:44,154 INFO L130 PetriNetUnfolder]: 14/161 cut-off events. [2022-10-17 10:34:44,154 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-10-17 10:34:44,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:34:44,155 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-17 10:34:44,156 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-10-17 10:34:44,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:34:44,162 INFO L85 PathProgramCache]: Analyzing trace with hash 341960441, now seen corresponding path program 1 times [2022-10-17 10:34:44,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:34:44,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954971656] [2022-10-17 10:34:44,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:34:44,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:34:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:34:44,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:34:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:34:44,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:34:44,506 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-17 10:34:44,507 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2022-10-17 10:34:44,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-10-17 10:34:44,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-10-17 10:34:44,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-10-17 10:34:44,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 10:34:44,512 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-10-17 10:34:44,523 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-10-17 10:34:44,523 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-10-17 10:34:44,586 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-10-17 10:34:44,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 227 places, 263 transitions, 544 flow [2022-10-17 10:34:44,712 INFO L130 PetriNetUnfolder]: 71/432 cut-off events. [2022-10-17 10:34:44,713 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-10-17 10:34:44,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 432 events. 71/432 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1658 event pairs, 0 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 277. Up to 12 conditions per place. [2022-10-17 10:34:44,725 INFO L82 GeneralOperation]: Start removeDead. Operand has 227 places, 263 transitions, 544 flow [2022-10-17 10:34:44,735 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 227 places, 263 transitions, 544 flow [2022-10-17 10:34:44,738 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 10:34:44,741 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;@2815c454, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 10:34:44,741 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-10-17 10:34:44,772 INFO L130 PetriNetUnfolder]: 17/170 cut-off events. [2022-10-17 10:34:44,772 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-10-17 10:34:44,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:34:44,774 INFO L208 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] [2022-10-17 10:34:44,774 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-10-17 10:34:44,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:34:44,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1802144360, now seen corresponding path program 1 times [2022-10-17 10:34:44,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:34:44,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631765262] [2022-10-17 10:34:44,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:34:44,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:34:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:34:44,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:34:44,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:34:44,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631765262] [2022-10-17 10:34:44,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631765262] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:34:44,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:34:44,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:34:44,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465313433] [2022-10-17 10:34:44,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:34:44,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-17 10:34:44,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:34:45,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-17 10:34:45,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-17 10:34:45,029 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 263 [2022-10-17 10:34:45,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 263 transitions, 544 flow. Second operand has 2 states, 2 states have (on average 221.5) internal successors, (443), 2 states have internal predecessors, (443), 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-10-17 10:34:45,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:34:45,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 263 [2022-10-17 10:34:45,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:34:45,130 INFO L130 PetriNetUnfolder]: 9/365 cut-off events. [2022-10-17 10:34:45,130 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-10-17 10:34:45,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 365 events. 9/365 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1341 event pairs, 0 based on Foata normal form. 88/435 useless extension candidates. Maximal degree in co-relation 239. Up to 7 conditions per place. [2022-10-17 10:34:45,137 INFO L137 encePairwiseOnDemand]: 228/263 looper letters, 4 selfloop transitions, 0 changer transitions 0/225 dead transitions. [2022-10-17 10:34:45,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 225 transitions, 476 flow [2022-10-17 10:34:45,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-17 10:34:45,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-10-17 10:34:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 481 transitions. [2022-10-17 10:34:45,153 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9144486692015209 [2022-10-17 10:34:45,154 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 481 transitions. [2022-10-17 10:34:45,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 481 transitions. [2022-10-17 10:34:45,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:34:45,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 481 transitions. [2022-10-17 10:34:45,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 240.5) internal successors, (481), 2 states have internal predecessors, (481), 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-10-17 10:34:45,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 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-10-17 10:34:45,170 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 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-10-17 10:34:45,172 INFO L175 Difference]: Start difference. First operand has 227 places, 263 transitions, 544 flow. Second operand 2 states and 481 transitions. [2022-10-17 10:34:45,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 225 transitions, 476 flow [2022-10-17 10:34:45,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 225 transitions, 476 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-10-17 10:34:45,183 INFO L231 Difference]: Finished difference. Result has 225 places, 225 transitions, 468 flow [2022-10-17 10:34:45,186 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=468, PETRI_PLACES=225, PETRI_TRANSITIONS=225} [2022-10-17 10:34:45,189 INFO L287 CegarLoopForPetriNet]: 227 programPoint places, -2 predicate places. [2022-10-17 10:34:45,189 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 225 transitions, 468 flow [2022-10-17 10:34:45,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 221.5) internal successors, (443), 2 states have internal predecessors, (443), 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-10-17 10:34:45,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:34:45,190 INFO L208 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] [2022-10-17 10:34:45,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 10:34:45,191 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-10-17 10:34:45,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:34:45,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1928054093, now seen corresponding path program 1 times [2022-10-17 10:34:45,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:34:45,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822401460] [2022-10-17 10:34:45,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:34:45,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:34:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:34:45,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:34:45,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:34:45,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822401460] [2022-10-17 10:34:45,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822401460] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:34:45,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:34:45,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:34:45,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042619374] [2022-10-17 10:34:45,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:34:45,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:34:45,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:34:45,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:34:45,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:34:45,321 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 263 [2022-10-17 10:34:45,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 225 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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-10-17 10:34:45,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:34:45,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 263 [2022-10-17 10:34:45,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:34:45,420 INFO L130 PetriNetUnfolder]: 7/320 cut-off events. [2022-10-17 10:34:45,420 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-10-17 10:34:45,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 320 events. 7/320 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1018 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 351. Up to 16 conditions per place. [2022-10-17 10:34:45,425 INFO L137 encePairwiseOnDemand]: 260/263 looper letters, 13 selfloop transitions, 2 changer transitions 0/229 dead transitions. [2022-10-17 10:34:45,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 229 transitions, 506 flow [2022-10-17 10:34:45,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:34:45,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-10-17 10:34:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2022-10-17 10:34:45,430 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8339670468948035 [2022-10-17 10:34:45,430 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 658 transitions. [2022-10-17 10:34:45,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions. [2022-10-17 10:34:45,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:34:45,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions. [2022-10-17 10:34:45,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 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-10-17 10:34:45,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 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-10-17 10:34:45,438 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 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-10-17 10:34:45,438 INFO L175 Difference]: Start difference. First operand has 225 places, 225 transitions, 468 flow. Second operand 3 states and 658 transitions. [2022-10-17 10:34:45,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 229 transitions, 506 flow [2022-10-17 10:34:45,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 229 transitions, 506 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-10-17 10:34:45,447 INFO L231 Difference]: Finished difference. Result has 228 places, 226 transitions, 480 flow [2022-10-17 10:34:45,448 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=228, PETRI_TRANSITIONS=226} [2022-10-17 10:34:45,449 INFO L287 CegarLoopForPetriNet]: 227 programPoint places, 1 predicate places. [2022-10-17 10:34:45,449 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 226 transitions, 480 flow [2022-10-17 10:34:45,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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-10-17 10:34:45,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:34:45,451 INFO L208 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] [2022-10-17 10:34:45,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-17 10:34:45,451 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-10-17 10:34:45,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:34:45,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1124980622, now seen corresponding path program 1 times [2022-10-17 10:34:45,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:34:45,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446751315] [2022-10-17 10:34:45,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:34:45,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:34:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:34:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:34:45,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:34:45,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446751315] [2022-10-17 10:34:45,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446751315] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:34:45,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:34:45,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-17 10:34:45,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679653744] [2022-10-17 10:34:45,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:34:45,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-17 10:34:45,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:34:45,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-17 10:34:45,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-10-17 10:34:45,997 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 263 [2022-10-17 10:34:45,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 226 transitions, 480 flow. Second operand has 10 states, 10 states have (on average 166.1) internal successors, (1661), 10 states have internal predecessors, (1661), 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-10-17 10:34:46,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:34:46,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 263 [2022-10-17 10:34:46,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:34:48,729 INFO L130 PetriNetUnfolder]: 2243/8613 cut-off events. [2022-10-17 10:34:48,729 INFO L131 PetriNetUnfolder]: For 206/206 co-relation queries the response was YES. [2022-10-17 10:34:48,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12502 conditions, 8613 events. 2243/8613 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 99092 event pairs, 600 based on Foata normal form. 0/8227 useless extension candidates. Maximal degree in co-relation 12495. Up to 1371 conditions per place. [2022-10-17 10:34:48,817 INFO L137 encePairwiseOnDemand]: 248/263 looper letters, 188 selfloop transitions, 44 changer transitions 57/452 dead transitions. [2022-10-17 10:34:48,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 452 transitions, 1574 flow [2022-10-17 10:34:48,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-17 10:34:48,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-10-17 10:34:48,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4181 transitions. [2022-10-17 10:34:48,833 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6623891001267427 [2022-10-17 10:34:48,834 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4181 transitions. [2022-10-17 10:34:48,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4181 transitions. [2022-10-17 10:34:48,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:34:48,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4181 transitions. [2022-10-17 10:34:48,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 174.20833333333334) internal successors, (4181), 24 states have internal predecessors, (4181), 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-10-17 10:34:48,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 263.0) internal successors, (6575), 25 states have internal predecessors, (6575), 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-10-17 10:34:48,919 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 263.0) internal successors, (6575), 25 states have internal predecessors, (6575), 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-10-17 10:34:48,919 INFO L175 Difference]: Start difference. First operand has 228 places, 226 transitions, 480 flow. Second operand 24 states and 4181 transitions. [2022-10-17 10:34:48,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 452 transitions, 1574 flow [2022-10-17 10:34:48,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 452 transitions, 1572 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-10-17 10:34:48,935 INFO L231 Difference]: Finished difference. Result has 261 places, 276 transitions, 783 flow [2022-10-17 10:34:48,936 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=783, PETRI_PLACES=261, PETRI_TRANSITIONS=276} [2022-10-17 10:34:48,937 INFO L287 CegarLoopForPetriNet]: 227 programPoint places, 34 predicate places. [2022-10-17 10:34:48,937 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 276 transitions, 783 flow [2022-10-17 10:34:48,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 166.1) internal successors, (1661), 10 states have internal predecessors, (1661), 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-10-17 10:34:48,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:34:48,939 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-17 10:34:48,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-17 10:34:48,939 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-10-17 10:34:48,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:34:48,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1556719885, now seen corresponding path program 1 times [2022-10-17 10:34:48,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:34:48,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532043613] [2022-10-17 10:34:48,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:34:48,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:34:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:34:48,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:34:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:34:49,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:34:49,031 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-17 10:34:49,032 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-10-17 10:34:49,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-10-17 10:34:49,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-10-17 10:34:49,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-10-17 10:34:49,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-10-17 10:34:49,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-17 10:34:49,033 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-10-17 10:34:49,034 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-10-17 10:34:49,034 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-10-17 10:34:49,079 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-10-17 10:34:49,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 323 transitions, 676 flow [2022-10-17 10:34:49,195 INFO L130 PetriNetUnfolder]: 105/622 cut-off events. [2022-10-17 10:34:49,195 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-10-17 10:34:49,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 622 events. 105/622 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2638 event pairs, 1 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 440. Up to 16 conditions per place. [2022-10-17 10:34:49,208 INFO L82 GeneralOperation]: Start removeDead. Operand has 276 places, 323 transitions, 676 flow [2022-10-17 10:34:49,218 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 276 places, 323 transitions, 676 flow [2022-10-17 10:34:49,221 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 10:34:49,227 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;@2815c454, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 10:34:49,227 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-10-17 10:34:49,243 INFO L130 PetriNetUnfolder]: 17/174 cut-off events. [2022-10-17 10:34:49,244 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-10-17 10:34:49,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:34:49,244 INFO L208 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] [2022-10-17 10:34:49,244 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-10-17 10:34:49,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:34:49,245 INFO L85 PathProgramCache]: Analyzing trace with hash -736023184, now seen corresponding path program 1 times [2022-10-17 10:34:49,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:34:49,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907526188] [2022-10-17 10:34:49,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:34:49,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:34:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:34:49,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:34:49,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:34:49,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907526188] [2022-10-17 10:34:49,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907526188] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:34:49,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:34:49,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:34:49,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528802817] [2022-10-17 10:34:49,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:34:49,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:34:49,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:34:49,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:34:49,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:34:49,351 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 323 [2022-10-17 10:34:49,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 323 transitions, 676 flow. Second operand has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 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-10-17 10:34:49,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:34:49,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 323 [2022-10-17 10:34:49,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:34:49,533 INFO L130 PetriNetUnfolder]: 14/481 cut-off events. [2022-10-17 10:34:49,533 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-10-17 10:34:49,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 481 events. 14/481 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1917 event pairs, 1 based on Foata normal form. 335/792 useless extension candidates. Maximal degree in co-relation 348. Up to 30 conditions per place. [2022-10-17 10:34:49,549 INFO L137 encePairwiseOnDemand]: 274/323 looper letters, 15 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2022-10-17 10:34:49,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 277 transitions, 618 flow [2022-10-17 10:34:49,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:34:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-10-17 10:34:49,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 856 transitions. [2022-10-17 10:34:49,554 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8833849329205367 [2022-10-17 10:34:49,554 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 856 transitions. [2022-10-17 10:34:49,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 856 transitions. [2022-10-17 10:34:49,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:34:49,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 856 transitions. [2022-10-17 10:34:49,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 285.3333333333333) internal successors, (856), 3 states have internal predecessors, (856), 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-10-17 10:34:49,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 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-10-17 10:34:49,562 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 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-10-17 10:34:49,562 INFO L175 Difference]: Start difference. First operand has 276 places, 323 transitions, 676 flow. Second operand 3 states and 856 transitions. [2022-10-17 10:34:49,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 277 transitions, 618 flow [2022-10-17 10:34:49,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 277 transitions, 618 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-10-17 10:34:49,570 INFO L231 Difference]: Finished difference. Result has 275 places, 274 transitions, 588 flow [2022-10-17 10:34:49,571 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=275, PETRI_TRANSITIONS=274} [2022-10-17 10:34:49,573 INFO L287 CegarLoopForPetriNet]: 276 programPoint places, -1 predicate places. [2022-10-17 10:34:49,574 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 274 transitions, 588 flow [2022-10-17 10:34:49,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 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-10-17 10:34:49,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:34:49,575 INFO L208 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] [2022-10-17 10:34:49,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-17 10:34:49,575 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-10-17 10:34:49,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:34:49,576 INFO L85 PathProgramCache]: Analyzing trace with hash -245225620, now seen corresponding path program 1 times [2022-10-17 10:34:49,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:34:49,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111001585] [2022-10-17 10:34:49,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:34:49,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:34:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:34:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:34:49,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:34:49,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111001585] [2022-10-17 10:34:49,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111001585] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:34:49,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:34:49,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-17 10:34:49,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962537192] [2022-10-17 10:34:49,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:34:49,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-17 10:34:49,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:34:49,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-17 10:34:49,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-10-17 10:34:49,973 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 323 [2022-10-17 10:34:49,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 274 transitions, 588 flow. Second operand has 10 states, 10 states have (on average 207.0) internal successors, (2070), 10 states have internal predecessors, (2070), 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-10-17 10:34:49,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:34:49,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 323 [2022-10-17 10:34:49,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:35:06,039 INFO L130 PetriNetUnfolder]: 23971/72143 cut-off events. [2022-10-17 10:35:06,040 INFO L131 PetriNetUnfolder]: For 2761/2761 co-relation queries the response was YES. [2022-10-17 10:35:06,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107751 conditions, 72143 events. 23971/72143 cut-off events. For 2761/2761 co-relation queries the response was YES. Maximal size of possible extension queue 2961. Compared 1039759 event pairs, 5334 based on Foata normal form. 0/70062 useless extension candidates. Maximal degree in co-relation 107633. Up to 13661 conditions per place. [2022-10-17 10:35:06,791 INFO L137 encePairwiseOnDemand]: 307/323 looper letters, 343 selfloop transitions, 58 changer transitions 0/605 dead transitions. [2022-10-17 10:35:06,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 605 transitions, 2216 flow [2022-10-17 10:35:06,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-17 10:35:06,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-10-17 10:35:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 5277 transitions. [2022-10-17 10:35:07,019 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6807275541795665 [2022-10-17 10:35:07,019 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 5277 transitions. [2022-10-17 10:35:07,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 5277 transitions. [2022-10-17 10:35:07,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:35:07,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 5277 transitions. [2022-10-17 10:35:07,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 219.875) internal successors, (5277), 24 states have internal predecessors, (5277), 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-10-17 10:35:07,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 323.0) internal successors, (8075), 25 states have internal predecessors, (8075), 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-10-17 10:35:07,092 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 323.0) internal successors, (8075), 25 states have internal predecessors, (8075), 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-10-17 10:35:07,092 INFO L175 Difference]: Start difference. First operand has 275 places, 274 transitions, 588 flow. Second operand 24 states and 5277 transitions. [2022-10-17 10:35:07,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 605 transitions, 2216 flow [2022-10-17 10:35:07,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 605 transitions, 2214 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-10-17 10:35:07,118 INFO L231 Difference]: Finished difference. Result has 311 places, 335 transitions, 1008 flow [2022-10-17 10:35:07,119 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1008, PETRI_PLACES=311, PETRI_TRANSITIONS=335} [2022-10-17 10:35:07,123 INFO L287 CegarLoopForPetriNet]: 276 programPoint places, 35 predicate places. [2022-10-17 10:35:07,127 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 335 transitions, 1008 flow [2022-10-17 10:35:07,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 207.0) internal successors, (2070), 10 states have internal predecessors, (2070), 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-10-17 10:35:07,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:35:07,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:35:07,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-17 10:35:07,134 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-10-17 10:35:07,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:07,135 INFO L85 PathProgramCache]: Analyzing trace with hash -367962712, now seen corresponding path program 1 times [2022-10-17 10:35:07,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:07,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656362019] [2022-10-17 10:35:07,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:07,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:07,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:07,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656362019] [2022-10-17 10:35:07,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656362019] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:35:07,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228174466] [2022-10-17 10:35:07,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:07,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:35:07,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:35:07,261 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:35:07,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-17 10:35:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:07,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-17 10:35:07,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:35:07,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:07,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:35:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:35:07,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228174466] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:35:07,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:35:07,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-10-17 10:35:07,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270059419] [2022-10-17 10:35:07,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:35:07,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-17 10:35:07,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:07,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-17 10:35:07,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-10-17 10:35:07,560 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 323 [2022-10-17 10:35:07,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 335 transitions, 1008 flow. Second operand has 10 states, 10 states have (on average 261.3) internal successors, (2613), 10 states have internal predecessors, (2613), 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-10-17 10:35:07,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:35:07,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 323 [2022-10-17 10:35:07,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:35:08,598 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1282] t_funEXIT-->L1037-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][295], [164#L1013-30true, 79#L1037-5true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 305#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 286#(= |~#B~0.base| 5), t_funThread1of3ForFork0InUse, Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread2of3ForFork0NotInUse, Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread3of3ForFork0NotInUse, 347#true, Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2022-10-17 10:35:08,598 INFO L383 tUnfolder$Statistics]: this new event has 186 ancestors and is cut-off event [2022-10-17 10:35:08,599 INFO L386 tUnfolder$Statistics]: existing Event has 186 ancestors and is cut-off event [2022-10-17 10:35:08,599 INFO L386 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-10-17 10:35:08,599 INFO L386 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-10-17 10:35:08,624 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1282] t_funEXIT-->L1037-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][295], [79#L1037-5true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 286#(= |~#B~0.base| 5), t_funThread1of3ForFork0InUse, Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread2of3ForFork0NotInUse, Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread3of3ForFork0NotInUse, 347#true, Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), 160#L1013-32true, Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0), 307#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5))]) [2022-10-17 10:35:08,625 INFO L383 tUnfolder$Statistics]: this new event has 188 ancestors and is cut-off event [2022-10-17 10:35:08,625 INFO L386 tUnfolder$Statistics]: existing Event has 180 ancestors and is cut-off event [2022-10-17 10:35:08,625 INFO L386 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-10-17 10:35:08,626 INFO L386 tUnfolder$Statistics]: existing Event has 180 ancestors and is cut-off event [2022-10-17 10:35:08,634 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1282] t_funEXIT-->L1037-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][295], [3#L1013-8true, 79#L1037-5true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 286#(= |~#B~0.base| 5), t_funThread1of3ForFork0InUse, Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread2of3ForFork0NotInUse, Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), t_funThread3of3ForFork0NotInUse, 347#true, Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0), 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-10-17 10:35:08,635 INFO L383 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2022-10-17 10:35:08,635 INFO L386 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-10-17 10:35:08,635 INFO L386 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-10-17 10:35:08,635 INFO L386 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-10-17 10:35:08,803 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1282] t_funEXIT-->L1037-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][295], [235#L999-1true, 79#L1037-5true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 286#(= |~#B~0.base| 5), t_funThread1of3ForFork0InUse, Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread2of3ForFork0NotInUse, Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), t_funThread3of3ForFork0NotInUse, 347#true, Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2022-10-17 10:35:08,803 INFO L383 tUnfolder$Statistics]: this new event has 190 ancestors and is cut-off event [2022-10-17 10:35:08,803 INFO L386 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-10-17 10:35:08,803 INFO L386 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-10-17 10:35:08,803 INFO L386 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2022-10-17 10:35:08,825 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1282] t_funEXIT-->L1037-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][295], [79#L1037-5true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 286#(= |~#B~0.base| 5), t_funThread1of3ForFork0InUse, Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread2of3ForFork0NotInUse, Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), t_funThread3of3ForFork0NotInUse, 347#true, 200#L1013-34true, Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), 315#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2022-10-17 10:35:08,825 INFO L383 tUnfolder$Statistics]: this new event has 193 ancestors and is cut-off event [2022-10-17 10:35:08,825 INFO L386 tUnfolder$Statistics]: existing Event has 185 ancestors and is cut-off event [2022-10-17 10:35:08,826 INFO L386 tUnfolder$Statistics]: existing Event has 185 ancestors and is cut-off event [2022-10-17 10:35:08,826 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-10-17 10:35:08,861 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1281] t_funEXIT-->L1037-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][293], [164#L1013-30true, 79#L1037-5true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 305#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 286#(= |~#B~0.base| 5), Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread1of3ForFork0InUse, Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread2of3ForFork0NotInUse, Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 347#true, t_funThread3of3ForFork0NotInUse, Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2022-10-17 10:35:08,861 INFO L383 tUnfolder$Statistics]: this new event has 178 ancestors and is not cut-off event [2022-10-17 10:35:08,862 INFO L386 tUnfolder$Statistics]: existing Event has 194 ancestors and is not cut-off event [2022-10-17 10:35:08,862 INFO L386 tUnfolder$Statistics]: existing Event has 186 ancestors and is not cut-off event [2022-10-17 10:35:08,862 INFO L386 tUnfolder$Statistics]: existing Event has 178 ancestors and is not cut-off event [2022-10-17 10:35:08,875 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1281] t_funEXIT-->L1037-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][293], [79#L1037-5true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 286#(= |~#B~0.base| 5), Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread1of3ForFork0InUse, Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread2of3ForFork0NotInUse, Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread3of3ForFork0NotInUse, 347#true, Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), 160#L1013-32true, Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0), 307#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5))]) [2022-10-17 10:35:08,875 INFO L383 tUnfolder$Statistics]: this new event has 180 ancestors and is not cut-off event [2022-10-17 10:35:08,876 INFO L386 tUnfolder$Statistics]: existing Event has 180 ancestors and is not cut-off event [2022-10-17 10:35:08,876 INFO L386 tUnfolder$Statistics]: existing Event has 196 ancestors and is not cut-off event [2022-10-17 10:35:08,876 INFO L386 tUnfolder$Statistics]: existing Event has 188 ancestors and is not cut-off event [2022-10-17 10:35:08,879 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1281] t_funEXIT-->L1037-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][293], [79#L1037-5true, 3#L1013-8true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 286#(= |~#B~0.base| 5), t_funThread1of3ForFork0InUse, Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread2of3ForFork0NotInUse, Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), 347#true, Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread3of3ForFork0NotInUse, Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0), 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-10-17 10:35:08,879 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is not cut-off event [2022-10-17 10:35:08,879 INFO L386 tUnfolder$Statistics]: existing Event has 181 ancestors and is not cut-off event [2022-10-17 10:35:08,879 INFO L386 tUnfolder$Statistics]: existing Event has 197 ancestors and is not cut-off event [2022-10-17 10:35:08,879 INFO L386 tUnfolder$Statistics]: existing Event has 189 ancestors and is not cut-off event [2022-10-17 10:35:08,888 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1281] t_funEXIT-->L1037-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][293], [235#L999-1true, 79#L1037-5true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 286#(= |~#B~0.base| 5), Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread1of3ForFork0InUse, Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread2of3ForFork0NotInUse, Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread3of3ForFork0NotInUse, 347#true, Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2022-10-17 10:35:08,888 INFO L383 tUnfolder$Statistics]: this new event has 182 ancestors and is not cut-off event [2022-10-17 10:35:08,888 INFO L386 tUnfolder$Statistics]: existing Event has 182 ancestors and is not cut-off event [2022-10-17 10:35:08,889 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is not cut-off event [2022-10-17 10:35:08,889 INFO L386 tUnfolder$Statistics]: existing Event has 190 ancestors and is not cut-off event [2022-10-17 10:35:08,897 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1281] t_funEXIT-->L1037-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][293], [79#L1037-5true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 286#(= |~#B~0.base| 5), Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread1of3ForFork0InUse, Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread2of3ForFork0NotInUse, Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread3of3ForFork0NotInUse, 200#L1013-34true, 347#true, Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), 315#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2022-10-17 10:35:08,898 INFO L383 tUnfolder$Statistics]: this new event has 185 ancestors and is not cut-off event [2022-10-17 10:35:08,898 INFO L386 tUnfolder$Statistics]: existing Event has 185 ancestors and is not cut-off event [2022-10-17 10:35:08,898 INFO L386 tUnfolder$Statistics]: existing Event has 193 ancestors and is not cut-off event [2022-10-17 10:35:08,898 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is not cut-off event [2022-10-17 10:35:08,904 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1282] t_funEXIT-->L1037-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][295], [79#L1037-5true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0NotInUse, Black: 286#(= |~#B~0.base| 5), Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread2of3ForFork0NotInUse, Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), t_funThread3of3ForFork0NotInUse, 347#true, Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), 315#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2022-10-17 10:35:08,904 INFO L383 tUnfolder$Statistics]: this new event has 206 ancestors and is cut-off event [2022-10-17 10:35:08,904 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-10-17 10:35:08,904 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-10-17 10:35:08,904 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-10-17 10:35:08,926 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1281] t_funEXIT-->L1037-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_13|} AuxVars[] AssignedVars[][293], [79#L1037-5true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 286#(= |~#B~0.base| 5), t_funThread1of3ForFork0NotInUse, Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread2of3ForFork0NotInUse, Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), t_funThread3of3ForFork0NotInUse, Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 347#true, Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), 315#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2022-10-17 10:35:08,926 INFO L383 tUnfolder$Statistics]: this new event has 214 ancestors and is cut-off event [2022-10-17 10:35:08,926 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-10-17 10:35:08,926 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-10-17 10:35:08,926 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-10-17 10:35:08,939 INFO L130 PetriNetUnfolder]: 572/4362 cut-off events. [2022-10-17 10:35:08,939 INFO L131 PetriNetUnfolder]: For 7267/7936 co-relation queries the response was YES. [2022-10-17 10:35:08,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8738 conditions, 4362 events. 572/4362 cut-off events. For 7267/7936 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 44014 event pairs, 138 based on Foata normal form. 37/4155 useless extension candidates. Maximal degree in co-relation 8573. Up to 500 conditions per place. [2022-10-17 10:35:09,005 INFO L137 encePairwiseOnDemand]: 317/323 looper letters, 16 selfloop transitions, 9 changer transitions 0/345 dead transitions. [2022-10-17 10:35:09,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 345 transitions, 1080 flow [2022-10-17 10:35:09,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 10:35:09,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-10-17 10:35:09,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2358 transitions. [2022-10-17 10:35:09,013 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8111455108359134 [2022-10-17 10:35:09,014 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2358 transitions. [2022-10-17 10:35:09,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2358 transitions. [2022-10-17 10:35:09,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:35:09,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2358 transitions. [2022-10-17 10:35:09,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 262.0) internal successors, (2358), 9 states have internal predecessors, (2358), 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-10-17 10:35:09,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 323.0) internal successors, (3230), 10 states have internal predecessors, (3230), 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-10-17 10:35:09,032 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 323.0) internal successors, (3230), 10 states have internal predecessors, (3230), 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-10-17 10:35:09,032 INFO L175 Difference]: Start difference. First operand has 311 places, 335 transitions, 1008 flow. Second operand 9 states and 2358 transitions. [2022-10-17 10:35:09,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 345 transitions, 1080 flow [2022-10-17 10:35:09,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 345 transitions, 1079 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-10-17 10:35:09,075 INFO L231 Difference]: Finished difference. Result has 321 places, 341 transitions, 1057 flow [2022-10-17 10:35:09,076 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1057, PETRI_PLACES=321, PETRI_TRANSITIONS=341} [2022-10-17 10:35:09,076 INFO L287 CegarLoopForPetriNet]: 276 programPoint places, 45 predicate places. [2022-10-17 10:35:09,077 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 341 transitions, 1057 flow [2022-10-17 10:35:09,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 261.3) internal successors, (2613), 10 states have internal predecessors, (2613), 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-10-17 10:35:09,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:35:09,079 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-17 10:35:09,117 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-17 10:35:09,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:35:09,305 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-10-17 10:35:09,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:35:09,306 INFO L85 PathProgramCache]: Analyzing trace with hash -550974725, now seen corresponding path program 1 times [2022-10-17 10:35:09,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:35:09,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772767120] [2022-10-17 10:35:09,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:09,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:35:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:09,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-17 10:35:09,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:35:09,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772767120] [2022-10-17 10:35:09,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772767120] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:35:09,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031559835] [2022-10-17 10:35:09,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:35:09,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:35:09,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:35:09,724 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:35:09,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8eb66d-7ad8-45f7-8ada-c98c18783fe0/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-17 10:35:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:35:09,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 15 conjunts are in the unsatisfiable core [2022-10-17 10:35:09,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:35:10,074 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-17 10:35:10,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-17 10:35:10,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-17 10:35:10,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-17 10:35:10,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-17 10:35:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-17 10:35:10,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:35:10,351 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_130 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_130) |c_~#B~0.base|) |c_~#B~0.offset|) 0)) is different from false [2022-10-17 10:35:10,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-10-17 10:35:10,789 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-17 10:35:10,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-10-17 10:35:10,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2022-10-17 10:35:10,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031559835] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:35:10,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:35:10,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2022-10-17 10:35:10,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715917690] [2022-10-17 10:35:10,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:35:10,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-17 10:35:10,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:35:10,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-17 10:35:10,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=168, Unknown=1, NotChecked=26, Total=240 [2022-10-17 10:35:10,804 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 323 [2022-10-17 10:35:10,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 341 transitions, 1057 flow. Second operand has 16 states, 16 states have (on average 206.9375) internal successors, (3311), 16 states have internal predecessors, (3311), 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-10-17 10:35:10,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:35:10,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 323 [2022-10-17 10:35:10,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand