./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN --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 4018a1168c08743b2a9b9283b6137e1dcc53bdf8ab8362348f4bbe02762305c3 --- 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-6b4ec56 [2022-11-20 09:36:03,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:36:03,263 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:36:03,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:36:03,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:36:03,296 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:36:03,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:36:03,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:36:03,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:36:03,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:36:03,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:36:03,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:36:03,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:36:03,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:36:03,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:36:03,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:36:03,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:36:03,337 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:36:03,339 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:36:03,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:36:03,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:36:03,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:36:03,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:36:03,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:36:03,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:36:03,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:36:03,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:36:03,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:36:03,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:36:03,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:36:03,357 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:36:03,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:36:03,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:36:03,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:36:03,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:36:03,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:36:03,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:36:03,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:36:03,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:36:03,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:36:03,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:36:03,371 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 09:36:03,415 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:36:03,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:36:03,416 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:36:03,416 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:36:03,417 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:36:03,417 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:36:03,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:36:03,418 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:36:03,418 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:36:03,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:36:03,419 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:36:03,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:36:03,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:36:03,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:36:03,419 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 09:36:03,420 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:36:03,420 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 09:36:03,420 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:36:03,420 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:36:03,420 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:36:03,421 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 09:36:03,421 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:36:03,421 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:36:03,421 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:36:03,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:36:03,422 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:36:03,422 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:36:03,422 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 09:36:03,422 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:36:03,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:36:03,423 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 09:36:03,423 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 09:36:03,423 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 09:36:03,423 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_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/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_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN 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 -> 4018a1168c08743b2a9b9283b6137e1dcc53bdf8ab8362348f4bbe02762305c3 [2022-11-20 09:36:03,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:36:03,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:36:03,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:36:03,732 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:36:03,732 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:36:03,733 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c [2022-11-20 09:36:06,885 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:36:07,093 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:36:07,094 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c [2022-11-20 09:36:07,101 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/data/47557b85f/488bc559fa1a4c0c84033e60e1263031/FLAG6bc3cb84a [2022-11-20 09:36:07,117 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/data/47557b85f/488bc559fa1a4c0c84033e60e1263031 [2022-11-20 09:36:07,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:36:07,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:36:07,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:36:07,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:36:07,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:36:07,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:36:07" (1/1) ... [2022-11-20 09:36:07,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4066ab25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:36:07, skipping insertion in model container [2022-11-20 09:36:07,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:36:07" (1/1) ... [2022-11-20 09:36:07,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:36:07,157 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:36:07,339 WARN L237 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_2cf0fe98-de40-44d2-908c-da7d9262b258/sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2022-11-20 09:36:07,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:36:07,360 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:36:07,384 WARN L237 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_2cf0fe98-de40-44d2-908c-da7d9262b258/sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2022-11-20 09:36:07,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:36:07,401 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:36:07,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:36:07 WrapperNode [2022-11-20 09:36:07,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:36:07,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:36:07,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:36:07,403 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:36:07,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:36:07" (1/1) ... [2022-11-20 09:36:07,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:36:07" (1/1) ... [2022-11-20 09:36:07,444 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 191 [2022-11-20 09:36:07,445 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:36:07,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:36:07,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:36:07,446 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:36:07,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:36:07" (1/1) ... [2022-11-20 09:36:07,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:36:07" (1/1) ... [2022-11-20 09:36:07,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:36:07" (1/1) ... [2022-11-20 09:36:07,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:36:07" (1/1) ... [2022-11-20 09:36:07,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:36:07" (1/1) ... [2022-11-20 09:36:07,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:36:07" (1/1) ... [2022-11-20 09:36:07,485 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:36:07" (1/1) ... [2022-11-20 09:36:07,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:36:07" (1/1) ... [2022-11-20 09:36:07,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:36:07,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:36:07,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:36:07,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:36:07,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:36:07" (1/1) ... [2022-11-20 09:36:07,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:36:07,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:07,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:36:07,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:36:07,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:36:07,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 09:36:07,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 09:36:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 09:36:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-20 09:36:07,577 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-20 09:36:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-20 09:36:07,577 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-20 09:36:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-20 09:36:07,578 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-20 09:36:07,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:36:07,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 09:36:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 09:36:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 09:36:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:36:07,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:36:07,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 09:36:07,582 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 09:36:07,691 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:36:07,693 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:36:08,059 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:36:08,272 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:36:08,273 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-20 09:36:08,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:36:08 BoogieIcfgContainer [2022-11-20 09:36:08,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:36:08,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:36:08,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:36:08,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:36:08,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:36:07" (1/3) ... [2022-11-20 09:36:08,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2921c99b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:36:08, skipping insertion in model container [2022-11-20 09:36:08,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:36:07" (2/3) ... [2022-11-20 09:36:08,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2921c99b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:36:08, skipping insertion in model container [2022-11-20 09:36:08,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:36:08" (3/3) ... [2022-11-20 09:36:08,287 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2022-11-20 09:36:08,300 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 09:36:08,311 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:36:08,311 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 09:36:08,311 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 09:36:08,455 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-20 09:36:08,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 153 transitions, 330 flow [2022-11-20 09:36:08,612 INFO L130 PetriNetUnfolder]: 12/150 cut-off events. [2022-11-20 09:36:08,612 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 09:36:08,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 12/150 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 88 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 112. Up to 2 conditions per place. [2022-11-20 09:36:08,618 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 153 transitions, 330 flow [2022-11-20 09:36:08,623 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 139 transitions, 296 flow [2022-11-20 09:36:08,634 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:36:08,641 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;@20e660c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:36:08,641 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-20 09:36:08,680 INFO L130 PetriNetUnfolder]: 12/138 cut-off events. [2022-11-20 09:36:08,680 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 09:36:08,680 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:36:08,681 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:08,682 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:36:08,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:08,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1885809601, now seen corresponding path program 1 times [2022-11-20 09:36:08,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:08,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901324634] [2022-11-20 09:36:08,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:08,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:08,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:36:08,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:08,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901324634] [2022-11-20 09:36:08,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901324634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:36:08,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:36:08,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:36:08,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625997830] [2022-11-20 09:36:08,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:36:08,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 09:36:08,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:09,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 09:36:09,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:36:09,013 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 153 [2022-11-20 09:36:09,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 139 transitions, 296 flow. Second operand has 2 states, 2 states have (on average 140.0) internal successors, (280), 2 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:09,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:36:09,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 153 [2022-11-20 09:36:09,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:36:09,200 INFO L130 PetriNetUnfolder]: 41/264 cut-off events. [2022-11-20 09:36:09,201 INFO L131 PetriNetUnfolder]: For 49/50 co-relation queries the response was YES. [2022-11-20 09:36:09,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 264 events. 41/264 cut-off events. For 49/50 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 697 event pairs, 15 based on Foata normal form. 42/275 useless extension candidates. Maximal degree in co-relation 216. Up to 59 conditions per place. [2022-11-20 09:36:09,210 INFO L137 encePairwiseOnDemand]: 145/153 looper letters, 9 selfloop transitions, 0 changer transitions 4/131 dead transitions. [2022-11-20 09:36:09,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 131 transitions, 298 flow [2022-11-20 09:36:09,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 09:36:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-20 09:36:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2022-11-20 09:36:09,228 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9379084967320261 [2022-11-20 09:36:09,231 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 287 transitions. [2022-11-20 09:36:09,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 287 transitions. [2022-11-20 09:36:09,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:36:09,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 287 transitions. [2022-11-20 09:36:09,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:09,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:09,251 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:09,253 INFO L175 Difference]: Start difference. First operand has 137 places, 139 transitions, 296 flow. Second operand 2 states and 287 transitions. [2022-11-20 09:36:09,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 131 transitions, 298 flow [2022-11-20 09:36:09,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 131 transitions, 286 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-20 09:36:09,265 INFO L231 Difference]: Finished difference. Result has 132 places, 127 transitions, 260 flow [2022-11-20 09:36:09,267 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=260, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2022-11-20 09:36:09,275 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, -5 predicate places. [2022-11-20 09:36:09,275 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 260 flow [2022-11-20 09:36:09,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 140.0) internal successors, (280), 2 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:09,276 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:36:09,276 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:09,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:36:09,277 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:36:09,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:09,278 INFO L85 PathProgramCache]: Analyzing trace with hash 740750995, now seen corresponding path program 1 times [2022-11-20 09:36:09,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:09,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76571089] [2022-11-20 09:36:09,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:09,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:09,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:36:09,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:09,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76571089] [2022-11-20 09:36:09,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76571089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:36:09,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:36:09,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:36:09,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437059427] [2022-11-20 09:36:09,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:36:09,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:36:09,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:09,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:36:09,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:36:09,864 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 153 [2022-11-20 09:36:09,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:09,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:36:09,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 153 [2022-11-20 09:36:09,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:36:10,113 INFO L130 PetriNetUnfolder]: 54/344 cut-off events. [2022-11-20 09:36:10,114 INFO L131 PetriNetUnfolder]: For 21/22 co-relation queries the response was YES. [2022-11-20 09:36:10,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 344 events. 54/344 cut-off events. For 21/22 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1156 event pairs, 6 based on Foata normal form. 2/311 useless extension candidates. Maximal degree in co-relation 459. Up to 52 conditions per place. [2022-11-20 09:36:10,116 INFO L137 encePairwiseOnDemand]: 145/153 looper letters, 39 selfloop transitions, 6 changer transitions 4/149 dead transitions. [2022-11-20 09:36:10,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 149 transitions, 411 flow [2022-11-20 09:36:10,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:36:10,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 09:36:10,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 728 transitions. [2022-11-20 09:36:10,123 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7930283224400871 [2022-11-20 09:36:10,124 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 728 transitions. [2022-11-20 09:36:10,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 728 transitions. [2022-11-20 09:36:10,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:36:10,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 728 transitions. [2022-11-20 09:36:10,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:10,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 153.0) internal successors, (1071), 7 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:10,132 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 153.0) internal successors, (1071), 7 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:10,133 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 260 flow. Second operand 6 states and 728 transitions. [2022-11-20 09:36:10,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 149 transitions, 411 flow [2022-11-20 09:36:10,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 149 transitions, 411 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 09:36:10,137 INFO L231 Difference]: Finished difference. Result has 136 places, 131 transitions, 296 flow [2022-11-20 09:36:10,138 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=296, PETRI_PLACES=136, PETRI_TRANSITIONS=131} [2022-11-20 09:36:10,139 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, -1 predicate places. [2022-11-20 09:36:10,140 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 131 transitions, 296 flow [2022-11-20 09:36:10,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:10,141 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:36:10,141 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:10,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:36:10,142 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:36:10,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:10,143 INFO L85 PathProgramCache]: Analyzing trace with hash -565445877, now seen corresponding path program 1 times [2022-11-20 09:36:10,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:10,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911812754] [2022-11-20 09:36:10,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:10,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:36:10,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:10,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911812754] [2022-11-20 09:36:10,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911812754] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:36:10,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:36:10,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:36:10,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900576470] [2022-11-20 09:36:10,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:36:10,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:36:10,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:10,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:36:10,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:36:10,493 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 153 [2022-11-20 09:36:10,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 131 transitions, 296 flow. Second operand has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:10,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:36:10,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 153 [2022-11-20 09:36:10,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:36:10,921 INFO L130 PetriNetUnfolder]: 378/1242 cut-off events. [2022-11-20 09:36:10,921 INFO L131 PetriNetUnfolder]: For 239/267 co-relation queries the response was YES. [2022-11-20 09:36:10,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2173 conditions, 1242 events. 378/1242 cut-off events. For 239/267 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7883 event pairs, 144 based on Foata normal form. 0/1052 useless extension candidates. Maximal degree in co-relation 2166. Up to 429 conditions per place. [2022-11-20 09:36:10,934 INFO L137 encePairwiseOnDemand]: 144/153 looper letters, 55 selfloop transitions, 8 changer transitions 0/159 dead transitions. [2022-11-20 09:36:10,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 159 transitions, 506 flow [2022-11-20 09:36:10,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:36:10,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 09:36:10,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 960 transitions. [2022-11-20 09:36:10,940 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7843137254901961 [2022-11-20 09:36:10,941 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 960 transitions. [2022-11-20 09:36:10,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 960 transitions. [2022-11-20 09:36:10,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:36:10,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 960 transitions. [2022-11-20 09:36:10,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:10,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:10,949 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:10,949 INFO L175 Difference]: Start difference. First operand has 136 places, 131 transitions, 296 flow. Second operand 8 states and 960 transitions. [2022-11-20 09:36:10,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 159 transitions, 506 flow [2022-11-20 09:36:10,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 159 transitions, 502 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-20 09:36:10,958 INFO L231 Difference]: Finished difference. Result has 142 places, 134 transitions, 328 flow [2022-11-20 09:36:10,959 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=328, PETRI_PLACES=142, PETRI_TRANSITIONS=134} [2022-11-20 09:36:10,961 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 5 predicate places. [2022-11-20 09:36:10,962 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 134 transitions, 328 flow [2022-11-20 09:36:10,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:10,963 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:36:10,963 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:10,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 09:36:10,963 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:36:10,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:10,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1447802893, now seen corresponding path program 1 times [2022-11-20 09:36:10,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:10,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105063568] [2022-11-20 09:36:10,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:10,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:36:11,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:11,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105063568] [2022-11-20 09:36:11,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105063568] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:36:11,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:36:11,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 09:36:11,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020171767] [2022-11-20 09:36:11,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:36:11,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 09:36:11,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:11,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 09:36:11,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:36:11,461 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 153 [2022-11-20 09:36:11,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 134 transitions, 328 flow. Second operand has 10 states, 10 states have (on average 95.1) internal successors, (951), 10 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:11,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:36:11,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 153 [2022-11-20 09:36:11,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:36:12,373 INFO L130 PetriNetUnfolder]: 870/1937 cut-off events. [2022-11-20 09:36:12,374 INFO L131 PetriNetUnfolder]: For 377/401 co-relation queries the response was YES. [2022-11-20 09:36:12,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3794 conditions, 1937 events. 870/1937 cut-off events. For 377/401 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 13113 event pairs, 583 based on Foata normal form. 24/1735 useless extension candidates. Maximal degree in co-relation 3785. Up to 1139 conditions per place. [2022-11-20 09:36:12,389 INFO L137 encePairwiseOnDemand]: 141/153 looper letters, 77 selfloop transitions, 11 changer transitions 0/167 dead transitions. [2022-11-20 09:36:12,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 167 transitions, 590 flow [2022-11-20 09:36:12,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 09:36:12,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 09:36:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1084 transitions. [2022-11-20 09:36:12,392 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6440879382055853 [2022-11-20 09:36:12,393 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1084 transitions. [2022-11-20 09:36:12,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1084 transitions. [2022-11-20 09:36:12,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:36:12,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1084 transitions. [2022-11-20 09:36:12,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.54545454545455) internal successors, (1084), 11 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:12,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:12,400 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:12,401 INFO L175 Difference]: Start difference. First operand has 142 places, 134 transitions, 328 flow. Second operand 11 states and 1084 transitions. [2022-11-20 09:36:12,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 167 transitions, 590 flow [2022-11-20 09:36:12,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 167 transitions, 580 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 09:36:12,405 INFO L231 Difference]: Finished difference. Result has 153 places, 138 transitions, 367 flow [2022-11-20 09:36:12,406 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=367, PETRI_PLACES=153, PETRI_TRANSITIONS=138} [2022-11-20 09:36:12,407 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 16 predicate places. [2022-11-20 09:36:12,407 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 138 transitions, 367 flow [2022-11-20 09:36:12,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.1) internal successors, (951), 10 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:12,408 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:36:12,408 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:12,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 09:36:12,409 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:36:12,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:12,409 INFO L85 PathProgramCache]: Analyzing trace with hash 343247993, now seen corresponding path program 1 times [2022-11-20 09:36:12,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:12,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51046685] [2022-11-20 09:36:12,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:12,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:12,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:36:12,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:12,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51046685] [2022-11-20 09:36:12,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51046685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:36:12,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:36:12,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 09:36:12,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592056008] [2022-11-20 09:36:12,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:36:12,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 09:36:12,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:12,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 09:36:12,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:36:12,802 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 153 [2022-11-20 09:36:12,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 138 transitions, 367 flow. Second operand has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:12,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:36:12,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 153 [2022-11-20 09:36:12,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:36:13,547 INFO L130 PetriNetUnfolder]: 688/1427 cut-off events. [2022-11-20 09:36:13,547 INFO L131 PetriNetUnfolder]: For 443/461 co-relation queries the response was YES. [2022-11-20 09:36:13,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3030 conditions, 1427 events. 688/1427 cut-off events. For 443/461 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 8428 event pairs, 433 based on Foata normal form. 18/1316 useless extension candidates. Maximal degree in co-relation 3016. Up to 983 conditions per place. [2022-11-20 09:36:13,561 INFO L137 encePairwiseOnDemand]: 141/153 looper letters, 50 selfloop transitions, 6 changer transitions 21/156 dead transitions. [2022-11-20 09:36:13,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 156 transitions, 561 flow [2022-11-20 09:36:13,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 09:36:13,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 09:36:13,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1084 transitions. [2022-11-20 09:36:13,565 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6440879382055853 [2022-11-20 09:36:13,565 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1084 transitions. [2022-11-20 09:36:13,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1084 transitions. [2022-11-20 09:36:13,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:36:13,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1084 transitions. [2022-11-20 09:36:13,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.54545454545455) internal successors, (1084), 11 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:13,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:13,572 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:13,572 INFO L175 Difference]: Start difference. First operand has 153 places, 138 transitions, 367 flow. Second operand 11 states and 1084 transitions. [2022-11-20 09:36:13,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 156 transitions, 561 flow [2022-11-20 09:36:13,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 156 transitions, 548 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-20 09:36:13,603 INFO L231 Difference]: Finished difference. Result has 160 places, 132 transitions, 332 flow [2022-11-20 09:36:13,604 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=332, PETRI_PLACES=160, PETRI_TRANSITIONS=132} [2022-11-20 09:36:13,605 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 23 predicate places. [2022-11-20 09:36:13,605 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 132 transitions, 332 flow [2022-11-20 09:36:13,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:13,605 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:36:13,606 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:13,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 09:36:13,606 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:36:13,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:13,607 INFO L85 PathProgramCache]: Analyzing trace with hash 502341716, now seen corresponding path program 1 times [2022-11-20 09:36:13,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:13,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400985021] [2022-11-20 09:36:13,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:13,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:36:13,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:13,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400985021] [2022-11-20 09:36:13,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400985021] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:36:13,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473773375] [2022-11-20 09:36:13,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:13,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:13,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:13,841 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:13,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 09:36:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:13,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 09:36:14,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:36:14,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:14,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:36:14,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473773375] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:36:14,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:36:14,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-11-20 09:36:14,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4465979] [2022-11-20 09:36:14,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:14,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 09:36:14,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:14,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 09:36:14,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-11-20 09:36:14,575 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2022-11-20 09:36:14,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 132 transitions, 332 flow. Second operand has 18 states, 18 states have (on average 108.94444444444444) internal successors, (1961), 18 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:14,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:36:14,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2022-11-20 09:36:14,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:36:15,606 INFO L130 PetriNetUnfolder]: 1493/2888 cut-off events. [2022-11-20 09:36:15,606 INFO L131 PetriNetUnfolder]: For 1019/1019 co-relation queries the response was YES. [2022-11-20 09:36:15,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6359 conditions, 2888 events. 1493/2888 cut-off events. For 1019/1019 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 20072 event pairs, 417 based on Foata normal form. 10/2838 useless extension candidates. Maximal degree in co-relation 6343. Up to 680 conditions per place. [2022-11-20 09:36:15,629 INFO L137 encePairwiseOnDemand]: 141/153 looper letters, 106 selfloop transitions, 19 changer transitions 0/214 dead transitions. [2022-11-20 09:36:15,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 214 transitions, 855 flow [2022-11-20 09:36:15,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 09:36:15,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 09:36:15,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1484 transitions. [2022-11-20 09:36:15,633 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7461035696329814 [2022-11-20 09:36:15,633 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1484 transitions. [2022-11-20 09:36:15,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1484 transitions. [2022-11-20 09:36:15,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:36:15,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1484 transitions. [2022-11-20 09:36:15,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.15384615384616) internal successors, (1484), 13 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:15,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 153.0) internal successors, (2142), 14 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:15,642 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 153.0) internal successors, (2142), 14 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:15,642 INFO L175 Difference]: Start difference. First operand has 160 places, 132 transitions, 332 flow. Second operand 13 states and 1484 transitions. [2022-11-20 09:36:15,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 214 transitions, 855 flow [2022-11-20 09:36:15,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 214 transitions, 795 flow, removed 24 selfloop flow, removed 14 redundant places. [2022-11-20 09:36:15,653 INFO L231 Difference]: Finished difference. Result has 151 places, 145 transitions, 401 flow [2022-11-20 09:36:15,653 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=401, PETRI_PLACES=151, PETRI_TRANSITIONS=145} [2022-11-20 09:36:15,654 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 14 predicate places. [2022-11-20 09:36:15,654 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 145 transitions, 401 flow [2022-11-20 09:36:15,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 108.94444444444444) internal successors, (1961), 18 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:15,655 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:36:15,655 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:15,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:15,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:15,871 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:36:15,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash -610844560, now seen corresponding path program 2 times [2022-11-20 09:36:15,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:15,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690628383] [2022-11-20 09:36:15,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:15,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:36:16,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:16,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690628383] [2022-11-20 09:36:16,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690628383] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:36:16,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145430189] [2022-11-20 09:36:16,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:36:16,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:16,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:16,144 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:16,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 09:36:16,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:36:16,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:36:16,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 09:36:16,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:36:16,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:36:16,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145430189] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:36:16,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:36:16,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 17 [2022-11-20 09:36:16,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65319495] [2022-11-20 09:36:16,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:16,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 09:36:16,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:16,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 09:36:16,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-11-20 09:36:16,554 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 153 [2022-11-20 09:36:16,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 145 transitions, 401 flow. Second operand has 17 states, 17 states have (on average 106.52941176470588) internal successors, (1811), 17 states have internal predecessors, (1811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:16,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:36:16,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 153 [2022-11-20 09:36:16,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:36:18,630 INFO L130 PetriNetUnfolder]: 3567/6361 cut-off events. [2022-11-20 09:36:18,631 INFO L131 PetriNetUnfolder]: For 2781/2784 co-relation queries the response was YES. [2022-11-20 09:36:18,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15816 conditions, 6361 events. 3567/6361 cut-off events. For 2781/2784 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 46113 event pairs, 240 based on Foata normal form. 16/6051 useless extension candidates. Maximal degree in co-relation 15804. Up to 725 conditions per place. [2022-11-20 09:36:18,680 INFO L137 encePairwiseOnDemand]: 137/153 looper letters, 247 selfloop transitions, 90 changer transitions 0/423 dead transitions. [2022-11-20 09:36:18,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 423 transitions, 2040 flow [2022-11-20 09:36:18,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 09:36:18,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-20 09:36:18,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2759 transitions. [2022-11-20 09:36:18,687 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7513616557734205 [2022-11-20 09:36:18,688 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2759 transitions. [2022-11-20 09:36:18,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2759 transitions. [2022-11-20 09:36:18,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:36:18,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2759 transitions. [2022-11-20 09:36:18,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 114.95833333333333) internal successors, (2759), 24 states have internal predecessors, (2759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:18,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 153.0) internal successors, (3825), 25 states have internal predecessors, (3825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:18,704 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 153.0) internal successors, (3825), 25 states have internal predecessors, (3825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:18,704 INFO L175 Difference]: Start difference. First operand has 151 places, 145 transitions, 401 flow. Second operand 24 states and 2759 transitions. [2022-11-20 09:36:18,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 423 transitions, 2040 flow [2022-11-20 09:36:18,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 423 transitions, 2033 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 09:36:18,729 INFO L231 Difference]: Finished difference. Result has 188 places, 227 transitions, 1140 flow [2022-11-20 09:36:18,730 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1140, PETRI_PLACES=188, PETRI_TRANSITIONS=227} [2022-11-20 09:36:18,731 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 51 predicate places. [2022-11-20 09:36:18,732 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 227 transitions, 1140 flow [2022-11-20 09:36:18,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 106.52941176470588) internal successors, (1811), 17 states have internal predecessors, (1811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:18,733 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:36:18,733 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:18,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:18,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:18,944 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:36:18,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:18,945 INFO L85 PathProgramCache]: Analyzing trace with hash -109719994, now seen corresponding path program 1 times [2022-11-20 09:36:18,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:18,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626739196] [2022-11-20 09:36:18,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:18,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:19,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:36:19,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:19,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626739196] [2022-11-20 09:36:19,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626739196] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:36:19,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104007809] [2022-11-20 09:36:19,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:19,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:19,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:19,147 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:19,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 09:36:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:19,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 09:36:19,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:19,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:36:19,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:36:19,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104007809] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 09:36:19,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:19,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-20 09:36:19,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235687501] [2022-11-20 09:36:19,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:36:19,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:36:19,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:19,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:36:19,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-20 09:36:19,653 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 153 [2022-11-20 09:36:19,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 227 transitions, 1140 flow. Second operand has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:19,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:36:19,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 153 [2022-11-20 09:36:19,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:36:20,549 INFO L130 PetriNetUnfolder]: 1317/2979 cut-off events. [2022-11-20 09:36:20,549 INFO L131 PetriNetUnfolder]: For 12177/12695 co-relation queries the response was YES. [2022-11-20 09:36:20,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9611 conditions, 2979 events. 1317/2979 cut-off events. For 12177/12695 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 21999 event pairs, 322 based on Foata normal form. 161/3037 useless extension candidates. Maximal degree in co-relation 9581. Up to 954 conditions per place. [2022-11-20 09:36:20,582 INFO L137 encePairwiseOnDemand]: 145/153 looper letters, 73 selfloop transitions, 24 changer transitions 0/248 dead transitions. [2022-11-20 09:36:20,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 248 transitions, 1473 flow [2022-11-20 09:36:20,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:36:20,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 09:36:20,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 831 transitions. [2022-11-20 09:36:20,585 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7759103641456583 [2022-11-20 09:36:20,586 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 831 transitions. [2022-11-20 09:36:20,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 831 transitions. [2022-11-20 09:36:20,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:36:20,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 831 transitions. [2022-11-20 09:36:20,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:20,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:20,592 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:20,592 INFO L175 Difference]: Start difference. First operand has 188 places, 227 transitions, 1140 flow. Second operand 7 states and 831 transitions. [2022-11-20 09:36:20,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 248 transitions, 1473 flow [2022-11-20 09:36:20,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 248 transitions, 1427 flow, removed 7 selfloop flow, removed 8 redundant places. [2022-11-20 09:36:20,637 INFO L231 Difference]: Finished difference. Result has 187 places, 227 transitions, 1150 flow [2022-11-20 09:36:20,638 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1077, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1150, PETRI_PLACES=187, PETRI_TRANSITIONS=227} [2022-11-20 09:36:20,641 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 50 predicate places. [2022-11-20 09:36:20,642 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 227 transitions, 1150 flow [2022-11-20 09:36:20,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:20,642 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:36:20,643 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:20,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:20,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-20 09:36:20,849 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:36:20,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:20,849 INFO L85 PathProgramCache]: Analyzing trace with hash -221605580, now seen corresponding path program 3 times [2022-11-20 09:36:20,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:20,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830168241] [2022-11-20 09:36:20,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:20,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:21,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:36:21,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:21,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830168241] [2022-11-20 09:36:21,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830168241] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:36:21,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376573015] [2022-11-20 09:36:21,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 09:36:21,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:21,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:21,139 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:21,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 09:36:21,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 09:36:21,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:36:21,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 09:36:21,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:21,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:36:21,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:21,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:36:21,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376573015] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 09:36:21,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:21,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 7] total 18 [2022-11-20 09:36:21,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379902146] [2022-11-20 09:36:21,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:36:21,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:36:21,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:21,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:36:21,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-11-20 09:36:21,480 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 153 [2022-11-20 09:36:21,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 227 transitions, 1150 flow. Second operand has 7 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:21,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:36:21,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 153 [2022-11-20 09:36:21,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:36:23,655 INFO L130 PetriNetUnfolder]: 4603/8274 cut-off events. [2022-11-20 09:36:23,656 INFO L131 PetriNetUnfolder]: For 29468/29533 co-relation queries the response was YES. [2022-11-20 09:36:23,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29353 conditions, 8274 events. 4603/8274 cut-off events. For 29468/29533 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 60354 event pairs, 790 based on Foata normal form. 25/8248 useless extension candidates. Maximal degree in co-relation 29325. Up to 1458 conditions per place. [2022-11-20 09:36:23,781 INFO L137 encePairwiseOnDemand]: 141/153 looper letters, 269 selfloop transitions, 178 changer transitions 0/546 dead transitions. [2022-11-20 09:36:23,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 546 transitions, 4282 flow [2022-11-20 09:36:23,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 09:36:23,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-20 09:36:23,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1988 transitions. [2022-11-20 09:36:23,787 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8120915032679739 [2022-11-20 09:36:23,788 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1988 transitions. [2022-11-20 09:36:23,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1988 transitions. [2022-11-20 09:36:23,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:36:23,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1988 transitions. [2022-11-20 09:36:23,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 124.25) internal successors, (1988), 16 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:23,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 153.0) internal successors, (2601), 17 states have internal predecessors, (2601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:23,800 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 153.0) internal successors, (2601), 17 states have internal predecessors, (2601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:23,800 INFO L175 Difference]: Start difference. First operand has 187 places, 227 transitions, 1150 flow. Second operand 16 states and 1988 transitions. [2022-11-20 09:36:23,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 546 transitions, 4282 flow [2022-11-20 09:36:23,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 546 transitions, 4208 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-20 09:36:23,951 INFO L231 Difference]: Finished difference. Result has 207 places, 362 transitions, 2798 flow [2022-11-20 09:36:23,952 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2798, PETRI_PLACES=207, PETRI_TRANSITIONS=362} [2022-11-20 09:36:23,953 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 70 predicate places. [2022-11-20 09:36:23,953 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 362 transitions, 2798 flow [2022-11-20 09:36:23,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:23,954 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:36:23,954 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:23,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:24,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-20 09:36:24,173 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:36:24,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:24,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1693336392, now seen corresponding path program 4 times [2022-11-20 09:36:24,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:24,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858689039] [2022-11-20 09:36:24,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:24,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:24,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:36:24,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:24,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858689039] [2022-11-20 09:36:24,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858689039] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:36:24,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646637988] [2022-11-20 09:36:24,448 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 09:36:24,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:24,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:24,450 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:24,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 09:36:24,568 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 09:36:24,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:36:24,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 09:36:24,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:36:24,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:36:25,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646637988] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 09:36:25,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:25,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2022-11-20 09:36:25,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734669091] [2022-11-20 09:36:25,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:36:25,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:36:25,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:25,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:36:25,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-11-20 09:36:25,208 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2022-11-20 09:36:25,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 362 transitions, 2798 flow. Second operand has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:25,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:36:25,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2022-11-20 09:36:25,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:36:27,022 INFO L130 PetriNetUnfolder]: 3795/7388 cut-off events. [2022-11-20 09:36:27,022 INFO L131 PetriNetUnfolder]: For 30448/30635 co-relation queries the response was YES. [2022-11-20 09:36:27,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28368 conditions, 7388 events. 3795/7388 cut-off events. For 30448/30635 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 57617 event pairs, 556 based on Foata normal form. 138/7474 useless extension candidates. Maximal degree in co-relation 28330. Up to 1805 conditions per place. [2022-11-20 09:36:27,110 INFO L137 encePairwiseOnDemand]: 140/153 looper letters, 213 selfloop transitions, 162 changer transitions 0/487 dead transitions. [2022-11-20 09:36:27,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 487 transitions, 4463 flow [2022-11-20 09:36:27,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 09:36:27,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 09:36:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1271 transitions. [2022-11-20 09:36:27,114 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7551990493166963 [2022-11-20 09:36:27,114 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1271 transitions. [2022-11-20 09:36:27,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1271 transitions. [2022-11-20 09:36:27,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:36:27,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1271 transitions. [2022-11-20 09:36:27,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 115.54545454545455) internal successors, (1271), 11 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:27,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:27,122 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:27,122 INFO L175 Difference]: Start difference. First operand has 207 places, 362 transitions, 2798 flow. Second operand 11 states and 1271 transitions. [2022-11-20 09:36:27,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 487 transitions, 4463 flow [2022-11-20 09:36:27,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 487 transitions, 4387 flow, removed 37 selfloop flow, removed 1 redundant places. [2022-11-20 09:36:27,393 INFO L231 Difference]: Finished difference. Result has 221 places, 399 transitions, 3763 flow [2022-11-20 09:36:27,394 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2756, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3763, PETRI_PLACES=221, PETRI_TRANSITIONS=399} [2022-11-20 09:36:27,395 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 84 predicate places. [2022-11-20 09:36:27,395 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 399 transitions, 3763 flow [2022-11-20 09:36:27,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:27,411 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:36:27,411 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:27,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:27,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 09:36:27,617 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:36:27,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:27,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1084582762, now seen corresponding path program 5 times [2022-11-20 09:36:27,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:27,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015690158] [2022-11-20 09:36:27,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:27,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:27,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:36:27,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:27,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015690158] [2022-11-20 09:36:27,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015690158] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:36:27,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096735959] [2022-11-20 09:36:27,836 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 09:36:27,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:27,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:27,838 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:27,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 09:36:27,972 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:36:27,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:36:27,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 09:36:27,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:28,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:36:28,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:36:28,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096735959] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:36:28,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:36:28,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 13 [2022-11-20 09:36:28,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607898113] [2022-11-20 09:36:28,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:36:28,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:36:28,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:28,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:36:28,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-20 09:36:28,042 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 153 [2022-11-20 09:36:28,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 399 transitions, 3763 flow. Second operand has 7 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:28,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:36:28,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 153 [2022-11-20 09:36:28,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:36:31,332 INFO L130 PetriNetUnfolder]: 7153/12631 cut-off events. [2022-11-20 09:36:31,332 INFO L131 PetriNetUnfolder]: For 82057/82419 co-relation queries the response was YES. [2022-11-20 09:36:31,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55769 conditions, 12631 events. 7153/12631 cut-off events. For 82057/82419 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 98133 event pairs, 1919 based on Foata normal form. 73/12639 useless extension candidates. Maximal degree in co-relation 55725. Up to 3665 conditions per place. [2022-11-20 09:36:31,597 INFO L137 encePairwiseOnDemand]: 143/153 looper letters, 586 selfloop transitions, 163 changer transitions 0/848 dead transitions. [2022-11-20 09:36:31,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 848 transitions, 10425 flow [2022-11-20 09:36:31,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 09:36:31,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 09:36:31,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1404 transitions. [2022-11-20 09:36:31,600 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8342245989304813 [2022-11-20 09:36:31,600 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1404 transitions. [2022-11-20 09:36:31,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1404 transitions. [2022-11-20 09:36:31,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:36:31,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1404 transitions. [2022-11-20 09:36:31,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 127.63636363636364) internal successors, (1404), 11 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:31,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:31,607 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:31,608 INFO L175 Difference]: Start difference. First operand has 221 places, 399 transitions, 3763 flow. Second operand 11 states and 1404 transitions. [2022-11-20 09:36:31,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 848 transitions, 10425 flow [2022-11-20 09:36:32,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 848 transitions, 10288 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-11-20 09:36:32,127 INFO L231 Difference]: Finished difference. Result has 234 places, 499 transitions, 5720 flow [2022-11-20 09:36:32,127 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=3717, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5720, PETRI_PLACES=234, PETRI_TRANSITIONS=499} [2022-11-20 09:36:32,128 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 97 predicate places. [2022-11-20 09:36:32,128 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 499 transitions, 5720 flow [2022-11-20 09:36:32,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:32,129 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:36:32,129 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:32,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:32,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 09:36:32,334 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:36:32,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:32,335 INFO L85 PathProgramCache]: Analyzing trace with hash -796944308, now seen corresponding path program 6 times [2022-11-20 09:36:32,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:32,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799229766] [2022-11-20 09:36:32,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:32,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:32,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:36:32,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:32,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799229766] [2022-11-20 09:36:32,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799229766] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:36:32,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393654647] [2022-11-20 09:36:32,578 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 09:36:32,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:32,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:32,580 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:32,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 09:36:32,711 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-11-20 09:36:32,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:36:32,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 09:36:32,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:36:32,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:32,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:36:32,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393654647] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:36:32,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:36:32,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2022-11-20 09:36:32,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844739846] [2022-11-20 09:36:32,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:32,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 09:36:32,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:32,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 09:36:32,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-11-20 09:36:32,954 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 153 [2022-11-20 09:36:32,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 499 transitions, 5720 flow. Second operand has 16 states, 16 states have (on average 106.5625) internal successors, (1705), 16 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:32,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:36:32,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 153 [2022-11-20 09:36:32,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:36:37,244 INFO L130 PetriNetUnfolder]: 7401/13500 cut-off events. [2022-11-20 09:36:37,244 INFO L131 PetriNetUnfolder]: For 102198/102507 co-relation queries the response was YES. [2022-11-20 09:36:37,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61619 conditions, 13500 events. 7401/13500 cut-off events. For 102198/102507 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 108958 event pairs, 783 based on Foata normal form. 49/13457 useless extension candidates. Maximal degree in co-relation 61567. Up to 1519 conditions per place. [2022-11-20 09:36:37,399 INFO L137 encePairwiseOnDemand]: 136/153 looper letters, 319 selfloop transitions, 426 changer transitions 0/831 dead transitions. [2022-11-20 09:36:37,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 831 transitions, 10189 flow [2022-11-20 09:36:37,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 09:36:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-20 09:36:37,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2739 transitions. [2022-11-20 09:36:37,406 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7459150326797386 [2022-11-20 09:36:37,406 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2739 transitions. [2022-11-20 09:36:37,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2739 transitions. [2022-11-20 09:36:37,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:36:37,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2739 transitions. [2022-11-20 09:36:37,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 114.125) internal successors, (2739), 24 states have internal predecessors, (2739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:37,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 153.0) internal successors, (3825), 25 states have internal predecessors, (3825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:37,423 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 153.0) internal successors, (3825), 25 states have internal predecessors, (3825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:37,423 INFO L175 Difference]: Start difference. First operand has 234 places, 499 transitions, 5720 flow. Second operand 24 states and 2739 transitions. [2022-11-20 09:36:37,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 831 transitions, 10189 flow [2022-11-20 09:36:38,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 831 transitions, 9987 flow, removed 20 selfloop flow, removed 2 redundant places. [2022-11-20 09:36:38,135 INFO L231 Difference]: Finished difference. Result has 269 places, 642 transitions, 8976 flow [2022-11-20 09:36:38,135 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=5648, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=283, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=8976, PETRI_PLACES=269, PETRI_TRANSITIONS=642} [2022-11-20 09:36:38,136 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 132 predicate places. [2022-11-20 09:36:38,136 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 642 transitions, 8976 flow [2022-11-20 09:36:38,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 106.5625) internal successors, (1705), 16 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:38,136 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:36:38,137 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:38,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:38,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 09:36:38,338 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:36:38,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:38,338 INFO L85 PathProgramCache]: Analyzing trace with hash -892807730, now seen corresponding path program 7 times [2022-11-20 09:36:38,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:38,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670028789] [2022-11-20 09:36:38,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:38,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:38,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:36:38,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:38,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670028789] [2022-11-20 09:36:38,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670028789] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:36:38,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537469568] [2022-11-20 09:36:38,548 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 09:36:38,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:38,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:38,550 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:38,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 09:36:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:38,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 09:36:38,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:38,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:36:38,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:39,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:36:39,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537469568] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 09:36:39,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:39,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 20 [2022-11-20 09:36:39,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339923363] [2022-11-20 09:36:39,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:36:39,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:36:39,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:39,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:36:39,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-11-20 09:36:39,109 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2022-11-20 09:36:39,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 642 transitions, 8976 flow. Second operand has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:39,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:36:39,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2022-11-20 09:36:39,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:36:42,229 INFO L130 PetriNetUnfolder]: 5407/10740 cut-off events. [2022-11-20 09:36:42,229 INFO L131 PetriNetUnfolder]: For 99474/99901 co-relation queries the response was YES. [2022-11-20 09:36:42,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51368 conditions, 10740 events. 5407/10740 cut-off events. For 99474/99901 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 91543 event pairs, 805 based on Foata normal form. 49/10738 useless extension candidates. Maximal degree in co-relation 51303. Up to 3703 conditions per place. [2022-11-20 09:36:42,382 INFO L137 encePairwiseOnDemand]: 141/153 looper letters, 211 selfloop transitions, 300 changer transitions 0/700 dead transitions. [2022-11-20 09:36:42,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 700 transitions, 10460 flow [2022-11-20 09:36:42,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 09:36:42,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-20 09:36:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1146 transitions. [2022-11-20 09:36:42,385 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7490196078431373 [2022-11-20 09:36:42,385 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1146 transitions. [2022-11-20 09:36:42,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1146 transitions. [2022-11-20 09:36:42,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:36:42,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1146 transitions. [2022-11-20 09:36:42,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 114.6) internal successors, (1146), 10 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:42,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:42,391 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:42,391 INFO L175 Difference]: Start difference. First operand has 269 places, 642 transitions, 8976 flow. Second operand 10 states and 1146 transitions. [2022-11-20 09:36:42,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 700 transitions, 10460 flow [2022-11-20 09:36:43,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 700 transitions, 10253 flow, removed 99 selfloop flow, removed 5 redundant places. [2022-11-20 09:36:43,353 INFO L231 Difference]: Finished difference. Result has 276 places, 657 transitions, 10040 flow [2022-11-20 09:36:43,354 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=8762, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=283, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10040, PETRI_PLACES=276, PETRI_TRANSITIONS=657} [2022-11-20 09:36:43,354 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 139 predicate places. [2022-11-20 09:36:43,355 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 657 transitions, 10040 flow [2022-11-20 09:36:43,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:43,355 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:36:43,356 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:43,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:43,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:43,557 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:36:43,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:43,557 INFO L85 PathProgramCache]: Analyzing trace with hash -860730632, now seen corresponding path program 8 times [2022-11-20 09:36:43,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:43,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446723675] [2022-11-20 09:36:43,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:43,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:36:43,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:43,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446723675] [2022-11-20 09:36:43,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446723675] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:36:43,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678401200] [2022-11-20 09:36:43,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:36:43,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:43,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:43,811 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:43,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 09:36:43,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:36:43,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:36:43,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 09:36:43,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:36:44,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:44,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:36:44,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678401200] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 09:36:44,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:44,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-11-20 09:36:44,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385181365] [2022-11-20 09:36:44,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:36:44,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:36:44,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:44,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:36:44,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-11-20 09:36:44,359 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2022-11-20 09:36:44,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 657 transitions, 10040 flow. Second operand has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:44,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:36:44,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2022-11-20 09:36:44,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:36:47,687 INFO L130 PetriNetUnfolder]: 5421/10632 cut-off events. [2022-11-20 09:36:47,688 INFO L131 PetriNetUnfolder]: For 117083/117529 co-relation queries the response was YES. [2022-11-20 09:36:47,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54297 conditions, 10632 events. 5421/10632 cut-off events. For 117083/117529 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 90018 event pairs, 874 based on Foata normal form. 65/10638 useless extension candidates. Maximal degree in co-relation 54229. Up to 2823 conditions per place. [2022-11-20 09:36:47,819 INFO L137 encePairwiseOnDemand]: 141/153 looper letters, 210 selfloop transitions, 306 changer transitions 0/704 dead transitions. [2022-11-20 09:36:47,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 704 transitions, 11323 flow [2022-11-20 09:36:47,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 09:36:47,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 09:36:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1253 transitions. [2022-11-20 09:36:47,824 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.744503862150921 [2022-11-20 09:36:47,824 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1253 transitions. [2022-11-20 09:36:47,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1253 transitions. [2022-11-20 09:36:47,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:36:47,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1253 transitions. [2022-11-20 09:36:47,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 113.9090909090909) internal successors, (1253), 11 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:47,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:47,831 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:47,832 INFO L175 Difference]: Start difference. First operand has 276 places, 657 transitions, 10040 flow. Second operand 11 states and 1253 transitions. [2022-11-20 09:36:47,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 704 transitions, 11323 flow [2022-11-20 09:36:48,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 704 transitions, 11265 flow, removed 17 selfloop flow, removed 5 redundant places. [2022-11-20 09:36:48,818 INFO L231 Difference]: Finished difference. Result has 283 places, 656 transitions, 10721 flow [2022-11-20 09:36:48,818 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=9932, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=304, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10721, PETRI_PLACES=283, PETRI_TRANSITIONS=656} [2022-11-20 09:36:48,819 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 146 predicate places. [2022-11-20 09:36:48,819 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 656 transitions, 10721 flow [2022-11-20 09:36:48,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:48,819 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:36:48,820 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:48,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:49,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 09:36:49,020 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:36:49,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:49,021 INFO L85 PathProgramCache]: Analyzing trace with hash -492088392, now seen corresponding path program 1 times [2022-11-20 09:36:49,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:49,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752608252] [2022-11-20 09:36:49,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:49,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:36:51,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:51,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752608252] [2022-11-20 09:36:51,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752608252] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:36:51,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678609044] [2022-11-20 09:36:51,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:51,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:51,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:51,252 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:51,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 09:36:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:51,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-20 09:36:51,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:52,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 09:36:52,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:36:52,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:36:52,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:36:52,823 INFO L350 Elim1Store]: Elim1 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-11-20 09:36:52,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:36:52,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:53,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:36:53,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678609044] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:36:53,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:36:53,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 9] total 38 [2022-11-20 09:36:53,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118784600] [2022-11-20 09:36:53,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:53,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-20 09:36:53,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:53,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-20 09:36:53,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1232, Unknown=0, NotChecked=0, Total=1406 [2022-11-20 09:36:53,496 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 153 [2022-11-20 09:36:53,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 656 transitions, 10721 flow. Second operand has 38 states, 38 states have (on average 71.8157894736842) internal successors, (2729), 38 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:53,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:36:53,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 153 [2022-11-20 09:36:53,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:37:02,531 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([581] L68-->L70: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|))) (and (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_1| |v_thread3Thread1of1ForFork1_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~res2~0_57) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|) (not (= (ite (or (<= 0 (+ 2147483648 |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|)) (<= 0 |v_thread3Thread1of1ForFork1_plus_~b#1_1|)) 1 0) 0)) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (= v_~res2~0_58 |v_thread3Thread1of1ForFork1_plus_#in~a#1_1|) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0)) (= (select (select |v_#memory_int_51| v_~A~0.base_40) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_7| 4) v_~A~0.offset_40)) |v_thread3Thread1of1ForFork1_plus_#in~b#1_1|))) InVars {#memory_int=|v_#memory_int_51|, ~A~0.base=v_~A~0.base_40, ~A~0.offset=v_~A~0.offset_40, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|, ~res2~0=v_~res2~0_58} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~A~0.base=v_~A~0.base_40, thread3Thread1of1ForFork1_#t~ret9#1=|v_thread3Thread1of1ForFork1_#t~ret9#1_1|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~A~0.offset=v_~A~0.offset_40, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, #memory_int=|v_#memory_int_51|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_1|, ~res2~0=v_~res2~0_57} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_#t~ret9#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_plus_~b#1, thread3Thread1of1ForFork1_#t~mem8#1, ~res2~0][389], [154#true, Black: 3215#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3209#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3202#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0))), Black: 3204#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 2491#(<= 1 ~M~0), Black: 3200#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0))), 6578#true, Black: 3207#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0))), Black: 3213#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3211#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~M~0)), Black: 2950#(or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)), Black: 164#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), 97#L70true, Black: 6570#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1771#(<= 1 ~N~0), Black: 6574#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), 4324#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), 1745#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 3198#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 183#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 980#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 157#true, 5842#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1733#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1725#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1739#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5840#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1719#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5838#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1731#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1715#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1741#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 974#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 978#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 972#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1709#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 966#(and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1721#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 1727#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 3955#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 1735#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 1711#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1717#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 6572#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= 1 ~M~0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0)), 5099#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 36#L90-2true, Black: 5091#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5079#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5073#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5093#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5085#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 17#L57-2true, Black: 4231#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 4335#(and (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 5077#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5087#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4329#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 5064#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5083#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3233#(<= 1 ~N~0), Black: 4333#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 3968#(<= 1 ~N~0), Black: 5075#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3951#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0)), Black: 4327#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 5095#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5066#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4331#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 3947#(and (<= 1 ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 5081#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 5089#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0))]) [2022-11-20 09:37:02,531 INFO L383 tUnfolder$Statistics]: this new event has 107 ancestors and is cut-off event [2022-11-20 09:37:02,532 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-11-20 09:37:02,532 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-11-20 09:37:02,532 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-11-20 09:37:02,587 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L57-2-->L57-3: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_11| (+ |v_thread2Thread1of1ForFork0_#t~post4#1_3| 1)) InVars {thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_3|} OutVars{thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_3|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1][1221], [154#true, Black: 3215#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3209#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3202#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0))), Black: 3204#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 2491#(<= 1 ~M~0), Black: 3200#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0))), 6578#true, Black: 3207#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0))), Black: 3213#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3211#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~M~0)), 5838#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 2950#(or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)), Black: 164#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), 43#L57-3true, Black: 6570#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1771#(<= 1 ~N~0), Black: 6574#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), 4324#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), 2936#(or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0)), Black: 183#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 157#true, Black: 1733#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1725#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5842#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1739#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5840#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1719#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 1731#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1715#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 980#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1741#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 974#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 978#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= ~M~0 0)), 22#L68true, Black: 972#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1709#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 6568#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= 1 ~M~0)) (<= 1 ~N~0)), Black: 966#(and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 976#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1721#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 1745#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 1727#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1735#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 1717#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 5099#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 36#L90-2true, Black: 5091#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5079#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5073#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5093#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4231#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 5085#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4335#(and (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 5077#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5087#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5064#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4329#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 5083#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4333#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 3233#(<= 1 ~N~0), Black: 3968#(<= 1 ~N~0), Black: 3951#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0)), Black: 5075#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4327#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 5095#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3955#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 4331#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 3947#(and (<= 1 ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 5066#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5081#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 5089#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 1711#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0))]) [2022-11-20 09:37:02,587 INFO L383 tUnfolder$Statistics]: this new event has 107 ancestors and is not cut-off event [2022-11-20 09:37:02,587 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is not cut-off event [2022-11-20 09:37:02,587 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is not cut-off event [2022-11-20 09:37:02,587 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is not cut-off event [2022-11-20 09:37:02,663 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([581] L68-->L70: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|))) (and (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_1| |v_thread3Thread1of1ForFork1_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~res2~0_57) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (not (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|) (not (= (ite (or (<= 0 (+ 2147483648 |v_thread3Thread1of1ForFork1_plus_~a#1_1| |v_thread3Thread1of1ForFork1_plus_~b#1_1|)) (<= 0 |v_thread3Thread1of1ForFork1_plus_~b#1_1|)) 1 0) 0)) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (= v_~res2~0_58 |v_thread3Thread1of1ForFork1_plus_#in~a#1_1|) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_1| 0) (<= .cse0 2147483647)) 1 0)) (= (select (select |v_#memory_int_51| v_~A~0.base_40) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_7| 4) v_~A~0.offset_40)) |v_thread3Thread1of1ForFork1_plus_#in~b#1_1|))) InVars {#memory_int=|v_#memory_int_51|, ~A~0.base=v_~A~0.base_40, ~A~0.offset=v_~A~0.offset_40, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|, ~res2~0=v_~res2~0_58} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~A~0.base=v_~A~0.base_40, thread3Thread1of1ForFork1_#t~ret9#1=|v_thread3Thread1of1ForFork1_#t~ret9#1_1|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_7|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~A~0.offset=v_~A~0.offset_40, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, #memory_int=|v_#memory_int_51|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|, thread3Thread1of1ForFork1_#t~mem8#1=|v_thread3Thread1of1ForFork1_#t~mem8#1_1|, ~res2~0=v_~res2~0_57} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_#t~ret9#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_plus_~b#1, thread3Thread1of1ForFork1_#t~mem8#1, ~res2~0][389], [154#true, Black: 3215#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3209#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3202#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0))), Black: 3204#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 2491#(<= 1 ~M~0), Black: 3200#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0))), 6578#true, Black: 3207#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0))), 39#L91-1true, Black: 3213#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3211#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~M~0)), Black: 2950#(or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)), Black: 164#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), 97#L70true, Black: 6570#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1771#(<= 1 ~N~0), Black: 6574#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), 4324#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), 1745#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 3198#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 183#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 980#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 157#true, 5842#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1733#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1725#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1739#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5840#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1719#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5838#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1731#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1715#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1741#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 974#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 978#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 972#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1709#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 966#(and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1721#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 1727#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 3955#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 1735#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 1711#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1717#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 6572#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= 1 ~M~0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0)), 5099#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5091#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5079#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5073#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5093#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5085#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 17#L57-2true, Black: 4231#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 4335#(and (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 5077#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5087#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4329#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 5064#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5083#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3233#(<= 1 ~N~0), Black: 4333#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 3968#(<= 1 ~N~0), Black: 5075#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3951#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0)), Black: 4327#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 5095#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5066#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4331#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 3947#(and (<= 1 ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 5081#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 5089#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0))]) [2022-11-20 09:37:02,663 INFO L383 tUnfolder$Statistics]: this new event has 109 ancestors and is cut-off event [2022-11-20 09:37:02,663 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-11-20 09:37:02,663 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-11-20 09:37:02,663 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-11-20 09:37:02,715 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L57-2-->L57-3: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_11| (+ |v_thread2Thread1of1ForFork0_#t~post4#1_3| 1)) InVars {thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_3|} OutVars{thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_3|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1][1221], [154#true, Black: 3215#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3209#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3202#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0))), Black: 3204#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 2491#(<= 1 ~M~0), Black: 3200#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0))), 6578#true, Black: 3207#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (< ~N~0 1) (<= 1 ~M~0))), 39#L91-1true, Black: 3213#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)) (or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0))), Black: 3211#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~M~0)), 5838#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 2950#(or (< |thread3Thread1of1ForFork1_~i~2#1| 1) (<= 1 ~M~0)), Black: 164#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), 43#L57-3true, Black: 6570#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1771#(<= 1 ~N~0), Black: 6574#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), 4324#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), 2936#(or (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)) (<= 1 ~M~0)), Black: 183#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 157#true, Black: 1733#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1725#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5842#(and (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 1739#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5840#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 1719#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 1731#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1715#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 980#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1741#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 974#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 978#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= ~M~0 0)), 22#L68true, Black: 972#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1709#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 966#(and (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 6568#(and (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (<= 1 ~M~0)) (<= 1 ~N~0)), Black: 1721#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 976#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1745#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 1727#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 1735#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 1717#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 5099#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5091#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5079#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5073#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5093#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4231#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 5085#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4335#(and (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 5077#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5087#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5064#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4329#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 5083#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4333#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 3233#(<= 1 ~N~0), Black: 3968#(<= 1 ~N~0), Black: 3951#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0)), Black: 5075#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 4327#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 5095#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3955#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 4331#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 3947#(and (<= 1 ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 5066#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5081#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)) (<= 1 ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~N~0)), Black: 5089#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 1711#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0))]) [2022-11-20 09:37:02,716 INFO L383 tUnfolder$Statistics]: this new event has 109 ancestors and is not cut-off event [2022-11-20 09:37:02,716 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is not cut-off event [2022-11-20 09:37:02,716 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is not cut-off event [2022-11-20 09:37:02,716 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is not cut-off event [2022-11-20 09:37:02,941 INFO L130 PetriNetUnfolder]: 14729/27266 cut-off events. [2022-11-20 09:37:02,942 INFO L131 PetriNetUnfolder]: For 342953/344772 co-relation queries the response was YES. [2022-11-20 09:37:03,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138949 conditions, 27266 events. 14729/27266 cut-off events. For 342953/344772 co-relation queries the response was YES. Maximal size of possible extension queue 1603. Compared 257933 event pairs, 1925 based on Foata normal form. 609/27360 useless extension candidates. Maximal degree in co-relation 138880. Up to 13305 conditions per place. [2022-11-20 09:37:03,463 INFO L137 encePairwiseOnDemand]: 127/153 looper letters, 790 selfloop transitions, 226 changer transitions 4/1266 dead transitions. [2022-11-20 09:37:03,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 1266 transitions, 22428 flow [2022-11-20 09:37:03,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-20 09:37:03,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-11-20 09:37:03,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2115 transitions. [2022-11-20 09:37:03,477 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49369747899159666 [2022-11-20 09:37:03,477 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 2115 transitions. [2022-11-20 09:37:03,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 2115 transitions. [2022-11-20 09:37:03,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:37:03,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 2115 transitions. [2022-11-20 09:37:03,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 75.53571428571429) internal successors, (2115), 28 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:03,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 153.0) internal successors, (4437), 29 states have internal predecessors, (4437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:03,491 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 153.0) internal successors, (4437), 29 states have internal predecessors, (4437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:03,491 INFO L175 Difference]: Start difference. First operand has 283 places, 656 transitions, 10721 flow. Second operand 28 states and 2115 transitions. [2022-11-20 09:37:03,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 1266 transitions, 22428 flow [2022-11-20 09:37:08,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 1266 transitions, 21996 flow, removed 22 selfloop flow, removed 7 redundant places. [2022-11-20 09:37:08,151 INFO L231 Difference]: Finished difference. Result has 315 places, 862 transitions, 15027 flow [2022-11-20 09:37:08,152 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=10464, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=15027, PETRI_PLACES=315, PETRI_TRANSITIONS=862} [2022-11-20 09:37:08,153 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 178 predicate places. [2022-11-20 09:37:08,153 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 862 transitions, 15027 flow [2022-11-20 09:37:08,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 71.8157894736842) internal successors, (2729), 38 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:08,154 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:37:08,154 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:37:08,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 09:37:08,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:37:08,360 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 09:37:08,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:37:08,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1828263944, now seen corresponding path program 1 times [2022-11-20 09:37:08,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:37:08,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783389409] [2022-11-20 09:37:08,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:37:08,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:37:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:37:10,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:37:10,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:37:10,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783389409] [2022-11-20 09:37:10,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783389409] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:37:10,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832110318] [2022-11-20 09:37:10,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:37:10,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:37:10,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:37:10,758 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:37:10,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cf0fe98-de40-44d2-908c-da7d9262b258/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 09:37:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:37:10,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-20 09:37:10,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:37:10,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:37:10,998 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 09:37:10,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 09:37:11,072 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 09:37:11,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-20 09:37:11,770 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 09:37:11,770 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 18 [2022-11-20 09:37:12,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 09:37:12,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:37:13,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:37:13,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:37:13,540 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:37:13,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 17 [2022-11-20 09:37:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:37:13,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:37:15,078 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4)))) (and (forall ((v_ArrVal_435 (Array Int Int)) (~M~0 Int) (v_ArrVal_434 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_435) c_~A~0.base))) (< (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ (select .cse0 .cse1) c_~res1~0 1))))) (forall ((v_ArrVal_435 (Array Int Int)) (~M~0 Int) (v_ArrVal_434 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_435) c_~A~0.base))) (<= (+ (select .cse2 .cse1) c_~res1~0) (+ c_~res2~0 (select .cse2 (+ c_~A~0.offset (* ~M~0 4)))))) (not (< ~M~0 c_~N~0)))))) is different from false [2022-11-20 09:37:15,545 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_435 (Array Int Int)) (~M~0 Int) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_433) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_435) c_~A~0.base))) (<= (+ c_~res1~0 (select .cse0 c_~A~0.offset)) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))))) (forall ((v_ArrVal_435 (Array Int Int)) (~M~0 Int) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_433) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_435) c_~A~0.base))) (< (+ c_~res2~0 (select .cse1 (+ c_~A~0.offset (* ~M~0 4)))) (+ c_~res1~0 (select .cse1 c_~A~0.offset) 1))) (not (< ~M~0 c_~N~0))))) is different from false [2022-11-20 09:37:16,133 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_435 (Array Int Int)) (~M~0 Int) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_433) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (< (+ c_~res2~0 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 1))))) (forall ((v_ArrVal_435 (Array Int Int)) (~M~0 Int) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_433) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (<= (+ c_~res1~0 (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ c_~res2~0 (select .cse1 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))))) is different from false [2022-11-20 09:37:19,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:37:19,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 51 [2022-11-20 09:37:19,942 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:37:19,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 838 treesize of output 800 [2022-11-20 09:37:19,964 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:37:19,964 INFO L350 Elim1Store]: Elim1 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 790 treesize of output 736 [2022-11-20 09:37:19,991 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:37:19,991 INFO L350 Elim1Store]: Elim1 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 363 treesize of output 342 [2022-11-20 09:37:20,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:37:20,015 INFO L350 Elim1Store]: Elim1 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 694 treesize of output 576 [2022-11-20 09:37:20,739 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:37:20,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 50 [2022-11-20 09:37:20,756 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 09:37:20,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 194 treesize of output 186 [2022-11-20 09:37:20,776 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 09:37:20,776 INFO L350 Elim1Store]: Elim1 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 178 treesize of output 166 [2022-11-20 09:37:20,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:37:20,791 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 70 [2022-11-20 09:37:20,806 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 09:37:20,806 INFO L350 Elim1Store]: Elim1 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 142 treesize of output 114 [2022-11-20 09:37:24,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:37:24,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832110318] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:37:24,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:37:24,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31, 30] total 78 [2022-11-20 09:37:24,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306042997] [2022-11-20 09:37:24,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:37:24,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-11-20 09:37:24,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:37:24,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-11-20 09:37:24,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=768, Invalid=4728, Unknown=66, NotChecked=444, Total=6006 [2022-11-20 09:37:24,385 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 153 [2022-11-20 09:37:24,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 862 transitions, 15027 flow. Second operand has 78 states, 78 states have (on average 61.32051282051282) internal successors, (4783), 78 states have internal predecessors, (4783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:24,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:37:24,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 153 [2022-11-20 09:37:24,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand