./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:46:36,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:46:36,197 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:46:36,205 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:46:36,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:46:36,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:46:36,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:46:36,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:46:36,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:46:36,253 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:46:36,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:46:36,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:46:36,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:46:36,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:46:36,258 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:46:36,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:46:36,259 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:46:36,259 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:46:36,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:46:36,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:46:36,262 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:46:36,262 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:46:36,263 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:46:36,263 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:46:36,264 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:46:36,264 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:46:36,264 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:46:36,265 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:46:36,266 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:46:36,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:46:36,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:46:36,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:46:36,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:46:36,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:46:36,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:46:36,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:46:36,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:46:36,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:46:36,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:46:36,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:46:36,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:46:36,270 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/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_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 [2023-11-24 21:46:36,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:46:36,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:46:36,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:46:36,602 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:46:36,602 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:46:36,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2023-11-24 21:46:39,673 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:46:39,863 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:46:39,864 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2023-11-24 21:46:39,872 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/data/c4f1c3c4e/dd0220b934ff4d308c8dfbd482be3323/FLAG3f61c2b3e [2023-11-24 21:46:39,887 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/data/c4f1c3c4e/dd0220b934ff4d308c8dfbd482be3323 [2023-11-24 21:46:39,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:46:39,891 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:46:39,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:46:39,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:46:39,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:46:39,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:46:39" (1/1) ... [2023-11-24 21:46:39,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5298f274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:46:39, skipping insertion in model container [2023-11-24 21:46:39,900 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:46:39" (1/1) ... [2023-11-24 21:46:39,933 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:46:40,169 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:46:40,181 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:46:40,208 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:46:40,218 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:46:40,218 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:46:40,226 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:46:40,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:46:40 WrapperNode [2023-11-24 21:46:40,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:46:40,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:46:40,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:46:40,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:46:40,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:46:40" (1/1) ... [2023-11-24 21:46:40,244 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:46:40" (1/1) ... [2023-11-24 21:46:40,272 INFO L138 Inliner]: procedures = 22, calls = 40, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2023-11-24 21:46:40,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:46:40,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:46:40,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:46:40,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:46:40,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:46:40" (1/1) ... [2023-11-24 21:46:40,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:46:40" (1/1) ... [2023-11-24 21:46:40,288 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:46:40" (1/1) ... [2023-11-24 21:46:40,305 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-24 21:46:40,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:46:40" (1/1) ... [2023-11-24 21:46:40,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:46:40" (1/1) ... [2023-11-24 21:46:40,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:46:40" (1/1) ... [2023-11-24 21:46:40,317 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:46:40" (1/1) ... [2023-11-24 21:46:40,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:46:40" (1/1) ... [2023-11-24 21:46:40,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:46:40" (1/1) ... [2023-11-24 21:46:40,324 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:46:40,325 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:46:40,326 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:46:40,326 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:46:40,327 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:46:40" (1/1) ... [2023-11-24 21:46:40,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:46:40,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:46:40,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:46:40,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:46:40,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:46:40,404 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-24 21:46:40,404 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-24 21:46:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-24 21:46:40,405 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-24 21:46:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-24 21:46:40,405 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-24 21:46:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:46:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:46:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:46:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 21:46:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:46:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:46:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:46:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:46:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 21:46:40,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:46:40,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:46:40,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:46:40,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:46:40,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-24 21:46:40,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-24 21:46:40,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-24 21:46:40,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-24 21:46:40,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:46:40,409 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 21:46:40,537 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:46:40,556 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:46:40,828 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:46:41,056 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:46:41,057 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-24 21:46:41,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:46:41 BoogieIcfgContainer [2023-11-24 21:46:41,058 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:46:41,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:46:41,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:46:41,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:46:41,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:46:39" (1/3) ... [2023-11-24 21:46:41,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a395d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:46:41, skipping insertion in model container [2023-11-24 21:46:41,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:46:40" (2/3) ... [2023-11-24 21:46:41,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a395d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:46:41, skipping insertion in model container [2023-11-24 21:46:41,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:46:41" (3/3) ... [2023-11-24 21:46:41,069 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2023-11-24 21:46:41,091 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:46:41,091 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-11-24 21:46:41,091 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:46:41,189 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-24 21:46:41,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 54 transitions, 129 flow [2023-11-24 21:46:41,286 INFO L124 PetriNetUnfolderBase]: 3/51 cut-off events. [2023-11-24 21:46:41,286 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-24 21:46:41,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 3/51 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 80 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2023-11-24 21:46:41,291 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 54 transitions, 129 flow [2023-11-24 21:46:41,296 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 50 transitions, 118 flow [2023-11-24 21:46:41,307 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:46:41,322 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@42ecf35d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:46:41,322 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-11-24 21:46:41,328 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:46:41,328 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:46:41,329 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:46:41,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:46:41,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:46:41,330 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:46:41,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:46:41,338 INFO L85 PathProgramCache]: Analyzing trace with hash 9399, now seen corresponding path program 1 times [2023-11-24 21:46:41,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:46:41,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259361636] [2023-11-24 21:46:41,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:46:41,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:46:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:46:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:46:41,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:46:41,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259361636] [2023-11-24 21:46:41,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259361636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:46:41,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:46:41,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:46:41,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932978221] [2023-11-24 21:46:41,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:46:41,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:46:41,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:46:41,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:46:41,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:46:41,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 54 [2023-11-24 21:46:41,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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) [2023-11-24 21:46:41,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:46:41,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 54 [2023-11-24 21:46:41,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:46:42,199 INFO L124 PetriNetUnfolderBase]: 214/469 cut-off events. [2023-11-24 21:46:42,199 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-24 21:46:42,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 469 events. 214/469 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2578 event pairs, 157 based on Foata normal form. 1/378 useless extension candidates. Maximal degree in co-relation 687. Up to 322 conditions per place. [2023-11-24 21:46:42,214 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 18 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2023-11-24 21:46:42,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 46 transitions, 148 flow [2023-11-24 21:46:42,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:46:42,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:46:42,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2023-11-24 21:46:42,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7098765432098766 [2023-11-24 21:46:42,233 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 115 transitions. [2023-11-24 21:46:42,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 115 transitions. [2023-11-24 21:46:42,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:46:42,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 115 transitions. [2023-11-24 21:46:42,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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) [2023-11-24 21:46:42,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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) [2023-11-24 21:46:42,252 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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) [2023-11-24 21:46:42,254 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 118 flow. Second operand 3 states and 115 transitions. [2023-11-24 21:46:42,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 46 transitions, 148 flow [2023-11-24 21:46:42,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 136 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-24 21:46:42,268 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 100 flow [2023-11-24 21:46:42,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2023-11-24 21:46:42,275 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -8 predicate places. [2023-11-24 21:46:42,275 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 100 flow [2023-11-24 21:46:42,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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) [2023-11-24 21:46:42,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:46:42,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:46:42,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:46:42,277 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:46:42,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:46:42,279 INFO L85 PathProgramCache]: Analyzing trace with hash 9400, now seen corresponding path program 1 times [2023-11-24 21:46:42,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:46:42,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283703844] [2023-11-24 21:46:42,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:46:42,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:46:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:46:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:46:42,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:46:42,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283703844] [2023-11-24 21:46:42,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283703844] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:46:42,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:46:42,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:46:42,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802705381] [2023-11-24 21:46:42,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:46:42,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:46:42,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:46:42,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:46:42,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:46:42,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 54 [2023-11-24 21:46:42,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2023-11-24 21:46:42,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:46:42,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 54 [2023-11-24 21:46:42,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:46:42,646 INFO L124 PetriNetUnfolderBase]: 142/369 cut-off events. [2023-11-24 21:46:42,646 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-24 21:46:42,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 369 events. 142/369 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2012 event pairs, 103 based on Foata normal form. 28/323 useless extension candidates. Maximal degree in co-relation 602. Up to 222 conditions per place. [2023-11-24 21:46:42,652 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 16 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2023-11-24 21:46:42,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 130 flow [2023-11-24 21:46:42,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:46:42,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:46:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2023-11-24 21:46:42,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7283950617283951 [2023-11-24 21:46:42,655 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 118 transitions. [2023-11-24 21:46:42,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 118 transitions. [2023-11-24 21:46:42,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:46:42,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 118 transitions. [2023-11-24 21:46:42,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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) [2023-11-24 21:46:42,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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) [2023-11-24 21:46:42,659 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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) [2023-11-24 21:46:42,660 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 100 flow. Second operand 3 states and 118 transitions. [2023-11-24 21:46:42,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 130 flow [2023-11-24 21:46:42,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 129 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:46:42,662 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 97 flow [2023-11-24 21:46:42,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2023-11-24 21:46:42,664 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -9 predicate places. [2023-11-24 21:46:42,664 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 97 flow [2023-11-24 21:46:42,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2023-11-24 21:46:42,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:46:42,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:46:42,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:46:42,665 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:46:42,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:46:42,666 INFO L85 PathProgramCache]: Analyzing trace with hash 280291899, now seen corresponding path program 1 times [2023-11-24 21:46:42,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:46:42,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901853586] [2023-11-24 21:46:42,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:46:42,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:46:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:46:42,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:46:42,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:46:42,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901853586] [2023-11-24 21:46:42,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901853586] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:46:42,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:46:42,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:46:42,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132332856] [2023-11-24 21:46:42,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:46:42,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:46:42,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:46:42,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:46:42,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:46:42,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 54 [2023-11-24 21:46:42,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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) [2023-11-24 21:46:42,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:46:42,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 54 [2023-11-24 21:46:42,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:46:42,880 INFO L124 PetriNetUnfolderBase]: 162/377 cut-off events. [2023-11-24 21:46:42,881 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-24 21:46:42,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 377 events. 162/377 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1989 event pairs, 117 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 642. Up to 254 conditions per place. [2023-11-24 21:46:42,886 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 18 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2023-11-24 21:46:42,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 131 flow [2023-11-24 21:46:42,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:46:42,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:46:42,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2023-11-24 21:46:42,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-24 21:46:42,889 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 114 transitions. [2023-11-24 21:46:42,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 114 transitions. [2023-11-24 21:46:42,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:46:42,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 114 transitions. [2023-11-24 21:46:42,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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) [2023-11-24 21:46:42,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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) [2023-11-24 21:46:42,893 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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) [2023-11-24 21:46:42,893 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 97 flow. Second operand 3 states and 114 transitions. [2023-11-24 21:46:42,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 131 flow [2023-11-24 21:46:42,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:46:42,895 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 94 flow [2023-11-24 21:46:42,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2023-11-24 21:46:42,897 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -10 predicate places. [2023-11-24 21:46:42,897 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 94 flow [2023-11-24 21:46:42,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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) [2023-11-24 21:46:42,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:46:42,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:46:42,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:46:42,898 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:46:42,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:46:42,899 INFO L85 PathProgramCache]: Analyzing trace with hash 280291900, now seen corresponding path program 1 times [2023-11-24 21:46:42,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:46:42,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577551454] [2023-11-24 21:46:42,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:46:42,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:46:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:46:43,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:46:43,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:46:43,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577551454] [2023-11-24 21:46:43,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577551454] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:46:43,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:46:43,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:46:43,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491528665] [2023-11-24 21:46:43,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:46:43,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:46:43,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:46:43,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:46:43,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:46:43,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 54 [2023-11-24 21:46:43,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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) [2023-11-24 21:46:43,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:46:43,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 54 [2023-11-24 21:46:43,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:46:43,116 INFO L124 PetriNetUnfolderBase]: 142/345 cut-off events. [2023-11-24 21:46:43,117 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-24 21:46:43,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 345 events. 142/345 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1813 event pairs, 103 based on Foata normal form. 12/307 useless extension candidates. Maximal degree in co-relation 578. Up to 222 conditions per place. [2023-11-24 21:46:43,121 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 16 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2023-11-24 21:46:43,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 124 flow [2023-11-24 21:46:43,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:46:43,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:46:43,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2023-11-24 21:46:43,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7283950617283951 [2023-11-24 21:46:43,124 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 118 transitions. [2023-11-24 21:46:43,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 118 transitions. [2023-11-24 21:46:43,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:46:43,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 118 transitions. [2023-11-24 21:46:43,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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) [2023-11-24 21:46:43,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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) [2023-11-24 21:46:43,127 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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) [2023-11-24 21:46:43,127 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 94 flow. Second operand 3 states and 118 transitions. [2023-11-24 21:46:43,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 124 flow [2023-11-24 21:46:43,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 40 transitions, 123 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:46:43,129 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 91 flow [2023-11-24 21:46:43,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2023-11-24 21:46:43,131 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -11 predicate places. [2023-11-24 21:46:43,131 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 91 flow [2023-11-24 21:46:43,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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) [2023-11-24 21:46:43,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:46:43,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:46:43,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:46:43,132 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:46:43,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:46:43,133 INFO L85 PathProgramCache]: Analyzing trace with hash 759822581, now seen corresponding path program 1 times [2023-11-24 21:46:43,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:46:43,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418873816] [2023-11-24 21:46:43,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:46:43,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:46:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:46:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:46:43,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:46:43,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418873816] [2023-11-24 21:46:43,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418873816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:46:43,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:46:43,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:46:43,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138717557] [2023-11-24 21:46:43,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:46:43,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:46:43,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:46:43,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:46:43,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:46:43,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 54 [2023-11-24 21:46:43,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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) [2023-11-24 21:46:43,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:46:43,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 54 [2023-11-24 21:46:43,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:46:43,294 INFO L124 PetriNetUnfolderBase]: 158/349 cut-off events. [2023-11-24 21:46:43,294 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-24 21:46:43,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 349 events. 158/349 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1780 event pairs, 117 based on Foata normal form. 0/320 useless extension candidates. Maximal degree in co-relation 610. Up to 250 conditions per place. [2023-11-24 21:46:43,298 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 18 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2023-11-24 21:46:43,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 125 flow [2023-11-24 21:46:43,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:46:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:46:43,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2023-11-24 21:46:43,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-24 21:46:43,301 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 114 transitions. [2023-11-24 21:46:43,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 114 transitions. [2023-11-24 21:46:43,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:46:43,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 114 transitions. [2023-11-24 21:46:43,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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) [2023-11-24 21:46:43,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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) [2023-11-24 21:46:43,304 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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) [2023-11-24 21:46:43,304 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 91 flow. Second operand 3 states and 114 transitions. [2023-11-24 21:46:43,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 125 flow [2023-11-24 21:46:43,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 38 transitions, 124 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:46:43,306 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 88 flow [2023-11-24 21:46:43,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-11-24 21:46:43,307 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -12 predicate places. [2023-11-24 21:46:43,308 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 88 flow [2023-11-24 21:46:43,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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) [2023-11-24 21:46:43,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:46:43,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:46:43,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:46:43,309 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:46:43,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:46:43,310 INFO L85 PathProgramCache]: Analyzing trace with hash 759822582, now seen corresponding path program 1 times [2023-11-24 21:46:43,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:46:43,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364409333] [2023-11-24 21:46:43,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:46:43,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:46:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:46:43,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:46:43,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:46:43,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364409333] [2023-11-24 21:46:43,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364409333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:46:43,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:46:43,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:46:43,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963104754] [2023-11-24 21:46:43,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:46:43,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:46:43,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:46:43,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:46:43,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:46:43,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 54 [2023-11-24 21:46:43,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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) [2023-11-24 21:46:43,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:46:43,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 54 [2023-11-24 21:46:43,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:46:43,493 INFO L124 PetriNetUnfolderBase]: 142/321 cut-off events. [2023-11-24 21:46:43,493 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-24 21:46:43,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 321 events. 142/321 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1597 event pairs, 103 based on Foata normal form. 12/307 useless extension candidates. Maximal degree in co-relation 554. Up to 222 conditions per place. [2023-11-24 21:46:43,497 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 16 selfloop transitions, 1 changer transitions 0/36 dead transitions. [2023-11-24 21:46:43,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 36 transitions, 118 flow [2023-11-24 21:46:43,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:46:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:46:43,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2023-11-24 21:46:43,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7283950617283951 [2023-11-24 21:46:43,500 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 118 transitions. [2023-11-24 21:46:43,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 118 transitions. [2023-11-24 21:46:43,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:46:43,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 118 transitions. [2023-11-24 21:46:43,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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) [2023-11-24 21:46:43,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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) [2023-11-24 21:46:43,502 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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) [2023-11-24 21:46:43,503 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 88 flow. Second operand 3 states and 118 transitions. [2023-11-24 21:46:43,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 36 transitions, 118 flow [2023-11-24 21:46:43,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 36 transitions, 117 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:46:43,505 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 85 flow [2023-11-24 21:46:43,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2023-11-24 21:46:43,506 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -13 predicate places. [2023-11-24 21:46:43,507 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 85 flow [2023-11-24 21:46:43,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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) [2023-11-24 21:46:43,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:46:43,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:46:43,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:46:43,508 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:46:43,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:46:43,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1160496472, now seen corresponding path program 1 times [2023-11-24 21:46:43,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:46:43,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879708200] [2023-11-24 21:46:43,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:46:43,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:46:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:46:43,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:46:43,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:46:43,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879708200] [2023-11-24 21:46:43,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879708200] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:46:43,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:46:43,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:46:43,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117168283] [2023-11-24 21:46:43,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:46:43,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:46:43,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:46:43,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:46:43,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:46:43,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 54 [2023-11-24 21:46:43,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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) [2023-11-24 21:46:43,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:46:43,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 54 [2023-11-24 21:46:43,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:46:43,900 INFO L124 PetriNetUnfolderBase]: 321/585 cut-off events. [2023-11-24 21:46:43,901 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-24 21:46:43,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 585 events. 321/585 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2680 event pairs, 34 based on Foata normal form. 1/572 useless extension candidates. Maximal degree in co-relation 1043. Up to 376 conditions per place. [2023-11-24 21:46:43,907 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 26 selfloop transitions, 4 changer transitions 1/50 dead transitions. [2023-11-24 21:46:43,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 180 flow [2023-11-24 21:46:43,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:46:43,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:46:43,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2023-11-24 21:46:43,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.845679012345679 [2023-11-24 21:46:43,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 137 transitions. [2023-11-24 21:46:43,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 137 transitions. [2023-11-24 21:46:43,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:46:43,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 137 transitions. [2023-11-24 21:46:43,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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) [2023-11-24 21:46:43,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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) [2023-11-24 21:46:43,912 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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) [2023-11-24 21:46:43,912 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 85 flow. Second operand 3 states and 137 transitions. [2023-11-24 21:46:43,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 180 flow [2023-11-24 21:46:43,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:46:43,915 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 110 flow [2023-11-24 21:46:43,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2023-11-24 21:46:43,916 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -11 predicate places. [2023-11-24 21:46:43,916 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 110 flow [2023-11-24 21:46:43,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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) [2023-11-24 21:46:43,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:46:43,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:46:43,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:46:43,918 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:46:43,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:46:43,918 INFO L85 PathProgramCache]: Analyzing trace with hash 514363594, now seen corresponding path program 1 times [2023-11-24 21:46:43,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:46:43,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359572951] [2023-11-24 21:46:43,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:46:43,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:46:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:46:44,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:46:44,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:46:44,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359572951] [2023-11-24 21:46:44,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359572951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:46:44,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:46:44,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:46:44,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450125064] [2023-11-24 21:46:44,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:46:44,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:46:44,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:46:44,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:46:44,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:46:44,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 54 [2023-11-24 21:46:44,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 110 flow. Second operand has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 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) [2023-11-24 21:46:44,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:46:44,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 54 [2023-11-24 21:46:44,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:46:44,737 INFO L124 PetriNetUnfolderBase]: 538/898 cut-off events. [2023-11-24 21:46:44,738 INFO L125 PetriNetUnfolderBase]: For 194/215 co-relation queries the response was YES. [2023-11-24 21:46:44,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1989 conditions, 898 events. 538/898 cut-off events. For 194/215 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4291 event pairs, 25 based on Foata normal form. 2/814 useless extension candidates. Maximal degree in co-relation 1976. Up to 436 conditions per place. [2023-11-24 21:46:44,748 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 58 selfloop transitions, 18 changer transitions 0/92 dead transitions. [2023-11-24 21:46:44,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 92 transitions, 410 flow [2023-11-24 21:46:44,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:46:44,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:46:44,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 331 transitions. [2023-11-24 21:46:44,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7662037037037037 [2023-11-24 21:46:44,751 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 331 transitions. [2023-11-24 21:46:44,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 331 transitions. [2023-11-24 21:46:44,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:46:44,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 331 transitions. [2023-11-24 21:46:44,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 41.375) internal successors, (331), 8 states have internal predecessors, (331), 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) [2023-11-24 21:46:44,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 54.0) internal successors, (486), 9 states have internal predecessors, (486), 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) [2023-11-24 21:46:44,755 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 54.0) internal successors, (486), 9 states have internal predecessors, (486), 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) [2023-11-24 21:46:44,756 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 110 flow. Second operand 8 states and 331 transitions. [2023-11-24 21:46:44,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 92 transitions, 410 flow [2023-11-24 21:46:44,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 92 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:46:44,760 INFO L231 Difference]: Finished difference. Result has 57 places, 54 transitions, 227 flow [2023-11-24 21:46:44,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=227, PETRI_PLACES=57, PETRI_TRANSITIONS=54} [2023-11-24 21:46:44,761 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 0 predicate places. [2023-11-24 21:46:44,762 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 227 flow [2023-11-24 21:46:44,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 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) [2023-11-24 21:46:44,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:46:44,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:46:44,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:46:44,763 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:46:44,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:46:44,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1460535580, now seen corresponding path program 2 times [2023-11-24 21:46:44,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:46:44,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184923618] [2023-11-24 21:46:44,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:46:44,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:46:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:46:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:46:45,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:46:45,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184923618] [2023-11-24 21:46:45,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184923618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:46:45,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:46:45,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:46:45,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416045925] [2023-11-24 21:46:45,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:46:45,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:46:45,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:46:45,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:46:45,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:46:45,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 54 [2023-11-24 21:46:45,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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) [2023-11-24 21:46:45,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:46:45,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 54 [2023-11-24 21:46:45,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:46:45,393 INFO L124 PetriNetUnfolderBase]: 743/1266 cut-off events. [2023-11-24 21:46:45,394 INFO L125 PetriNetUnfolderBase]: For 862/895 co-relation queries the response was YES. [2023-11-24 21:46:45,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3330 conditions, 1266 events. 743/1266 cut-off events. For 862/895 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6528 event pairs, 101 based on Foata normal form. 31/1255 useless extension candidates. Maximal degree in co-relation 3311. Up to 646 conditions per place. [2023-11-24 21:46:45,407 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 62 selfloop transitions, 22 changer transitions 2/102 dead transitions. [2023-11-24 21:46:45,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 102 transitions, 595 flow [2023-11-24 21:46:45,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:46:45,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:46:45,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 257 transitions. [2023-11-24 21:46:45,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7932098765432098 [2023-11-24 21:46:45,410 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 257 transitions. [2023-11-24 21:46:45,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 257 transitions. [2023-11-24 21:46:45,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:46:45,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 257 transitions. [2023-11-24 21:46:45,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 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) [2023-11-24 21:46:45,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 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) [2023-11-24 21:46:45,413 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 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) [2023-11-24 21:46:45,413 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 227 flow. Second operand 6 states and 257 transitions. [2023-11-24 21:46:45,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 102 transitions, 595 flow [2023-11-24 21:46:45,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 102 transitions, 595 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-24 21:46:45,419 INFO L231 Difference]: Finished difference. Result has 66 places, 68 transitions, 397 flow [2023-11-24 21:46:45,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=397, PETRI_PLACES=66, PETRI_TRANSITIONS=68} [2023-11-24 21:46:45,420 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2023-11-24 21:46:45,420 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 397 flow [2023-11-24 21:46:45,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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) [2023-11-24 21:46:45,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:46:45,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:46:45,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:46:45,422 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:46:45,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:46:45,422 INFO L85 PathProgramCache]: Analyzing trace with hash 812440328, now seen corresponding path program 3 times [2023-11-24 21:46:45,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:46:45,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073795268] [2023-11-24 21:46:45,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:46:45,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:46:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:46:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:46:45,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:46:45,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073795268] [2023-11-24 21:46:45,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073795268] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:46:45,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:46:45,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:46:45,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115479994] [2023-11-24 21:46:45,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:46:45,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:46:45,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:46:45,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:46:45,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:46:45,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 54 [2023-11-24 21:46:45,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 68 transitions, 397 flow. Second operand has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 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) [2023-11-24 21:46:45,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:46:45,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 54 [2023-11-24 21:46:45,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:46:46,227 INFO L124 PetriNetUnfolderBase]: 1370/2117 cut-off events. [2023-11-24 21:46:46,228 INFO L125 PetriNetUnfolderBase]: For 3630/3704 co-relation queries the response was YES. [2023-11-24 21:46:46,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6957 conditions, 2117 events. 1370/2117 cut-off events. For 3630/3704 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 10997 event pairs, 223 based on Foata normal form. 33/2113 useless extension candidates. Maximal degree in co-relation 6932. Up to 988 conditions per place. [2023-11-24 21:46:46,252 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 87 selfloop transitions, 33 changer transitions 2/137 dead transitions. [2023-11-24 21:46:46,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 137 transitions, 921 flow [2023-11-24 21:46:46,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:46:46,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:46:46,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 311 transitions. [2023-11-24 21:46:46,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8227513227513228 [2023-11-24 21:46:46,255 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 311 transitions. [2023-11-24 21:46:46,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 311 transitions. [2023-11-24 21:46:46,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:46:46,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 311 transitions. [2023-11-24 21:46:46,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 44.42857142857143) internal successors, (311), 7 states have internal predecessors, (311), 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) [2023-11-24 21:46:46,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 54.0) internal successors, (432), 8 states have internal predecessors, (432), 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) [2023-11-24 21:46:46,258 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 54.0) internal successors, (432), 8 states have internal predecessors, (432), 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) [2023-11-24 21:46:46,258 INFO L175 Difference]: Start difference. First operand has 66 places, 68 transitions, 397 flow. Second operand 7 states and 311 transitions. [2023-11-24 21:46:46,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 137 transitions, 921 flow [2023-11-24 21:46:46,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 137 transitions, 873 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-11-24 21:46:46,273 INFO L231 Difference]: Finished difference. Result has 74 places, 80 transitions, 570 flow [2023-11-24 21:46:46,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=570, PETRI_PLACES=74, PETRI_TRANSITIONS=80} [2023-11-24 21:46:46,274 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 17 predicate places. [2023-11-24 21:46:46,274 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 80 transitions, 570 flow [2023-11-24 21:46:46,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 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) [2023-11-24 21:46:46,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:46:46,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:46:46,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:46:46,275 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:46:46,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:46:46,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1556693191, now seen corresponding path program 1 times [2023-11-24 21:46:46,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:46:46,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011597479] [2023-11-24 21:46:46,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:46:46,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:46:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:46:46,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:46:46,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:46:46,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011597479] [2023-11-24 21:46:46,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011597479] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:46:46,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922095676] [2023-11-24 21:46:46,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:46:46,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:46:46,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:46:46,539 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:46:46,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 21:46:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:46:46,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-24 21:46:46,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:46:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:46:47,031 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:46:47,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:46:47,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922095676] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:46:47,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:46:47,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2023-11-24 21:46:47,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566516337] [2023-11-24 21:46:47,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:46:47,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-24 21:46:47,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:46:47,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-24 21:46:47,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-24 21:46:47,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 54 [2023-11-24 21:46:47,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 80 transitions, 570 flow. Second operand has 12 states, 12 states have (on average 35.5) internal successors, (426), 12 states have internal predecessors, (426), 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) [2023-11-24 21:46:47,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:46:47,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 54 [2023-11-24 21:46:47,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:46:48,429 INFO L124 PetriNetUnfolderBase]: 1745/2725 cut-off events. [2023-11-24 21:46:48,429 INFO L125 PetriNetUnfolderBase]: For 6480/6638 co-relation queries the response was YES. [2023-11-24 21:46:48,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9935 conditions, 2725 events. 1745/2725 cut-off events. For 6480/6638 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 15633 event pairs, 125 based on Foata normal form. 60/2740 useless extension candidates. Maximal degree in co-relation 9906. Up to 818 conditions per place. [2023-11-24 21:46:48,469 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 117 selfloop transitions, 36 changer transitions 4/172 dead transitions. [2023-11-24 21:46:48,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 172 transitions, 1364 flow [2023-11-24 21:46:48,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:46:48,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-24 21:46:48,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 425 transitions. [2023-11-24 21:46:48,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7870370370370371 [2023-11-24 21:46:48,473 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 425 transitions. [2023-11-24 21:46:48,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 425 transitions. [2023-11-24 21:46:48,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:46:48,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 425 transitions. [2023-11-24 21:46:48,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 42.5) internal successors, (425), 10 states have internal predecessors, (425), 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) [2023-11-24 21:46:48,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 54.0) internal successors, (594), 11 states have internal predecessors, (594), 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) [2023-11-24 21:46:48,479 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 54.0) internal successors, (594), 11 states have internal predecessors, (594), 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) [2023-11-24 21:46:48,480 INFO L175 Difference]: Start difference. First operand has 74 places, 80 transitions, 570 flow. Second operand 10 states and 425 transitions. [2023-11-24 21:46:48,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 172 transitions, 1364 flow [2023-11-24 21:46:48,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 172 transitions, 1354 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-24 21:46:48,508 INFO L231 Difference]: Finished difference. Result has 88 places, 90 transitions, 778 flow [2023-11-24 21:46:48,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=778, PETRI_PLACES=88, PETRI_TRANSITIONS=90} [2023-11-24 21:46:48,509 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2023-11-24 21:46:48,510 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 90 transitions, 778 flow [2023-11-24 21:46:48,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 35.5) internal successors, (426), 12 states have internal predecessors, (426), 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) [2023-11-24 21:46:48,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:46:48,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:46:48,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-24 21:46:48,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:46:48,718 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:46:48,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:46:48,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1644505797, now seen corresponding path program 1 times [2023-11-24 21:46:48,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:46:48,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040678542] [2023-11-24 21:46:48,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:46:48,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:46:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:46:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:46:49,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:46:49,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040678542] [2023-11-24 21:46:49,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040678542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:46:49,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:46:49,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:46:49,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076387951] [2023-11-24 21:46:49,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:46:49,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:46:49,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:46:49,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:46:49,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:46:49,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 54 [2023-11-24 21:46:49,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 90 transitions, 778 flow. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 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) [2023-11-24 21:46:49,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:46:49,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 54 [2023-11-24 21:46:49,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:46:50,062 INFO L124 PetriNetUnfolderBase]: 2843/4585 cut-off events. [2023-11-24 21:46:50,063 INFO L125 PetriNetUnfolderBase]: For 18817/19380 co-relation queries the response was YES. [2023-11-24 21:46:50,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18729 conditions, 4585 events. 2843/4585 cut-off events. For 18817/19380 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 28655 event pairs, 442 based on Foata normal form. 117/4303 useless extension candidates. Maximal degree in co-relation 18693. Up to 2161 conditions per place. [2023-11-24 21:46:50,149 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 115 selfloop transitions, 70 changer transitions 0/207 dead transitions. [2023-11-24 21:46:50,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 207 transitions, 2277 flow [2023-11-24 21:46:50,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:46:50,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:46:50,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 206 transitions. [2023-11-24 21:46:50,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.762962962962963 [2023-11-24 21:46:50,152 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 206 transitions. [2023-11-24 21:46:50,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 206 transitions. [2023-11-24 21:46:50,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:46:50,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 206 transitions. [2023-11-24 21:46:50,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 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) [2023-11-24 21:46:50,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:46:50,155 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:46:50,155 INFO L175 Difference]: Start difference. First operand has 88 places, 90 transitions, 778 flow. Second operand 5 states and 206 transitions. [2023-11-24 21:46:50,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 207 transitions, 2277 flow [2023-11-24 21:46:50,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 207 transitions, 2212 flow, removed 21 selfloop flow, removed 1 redundant places. [2023-11-24 21:46:50,231 INFO L231 Difference]: Finished difference. Result has 94 places, 143 transitions, 1646 flow [2023-11-24 21:46:50,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1646, PETRI_PLACES=94, PETRI_TRANSITIONS=143} [2023-11-24 21:46:50,232 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 37 predicate places. [2023-11-24 21:46:50,232 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 143 transitions, 1646 flow [2023-11-24 21:46:50,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 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) [2023-11-24 21:46:50,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:46:50,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:46:50,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:46:50,234 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:46:50,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:46:50,234 INFO L85 PathProgramCache]: Analyzing trace with hash -414825949, now seen corresponding path program 2 times [2023-11-24 21:46:50,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:46:50,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390251897] [2023-11-24 21:46:50,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:46:50,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:46:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:46:50,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:46:50,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:46:50,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390251897] [2023-11-24 21:46:50,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390251897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:46:50,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:46:50,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:46:50,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407281131] [2023-11-24 21:46:50,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:46:50,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:46:50,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:46:50,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:46:50,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:46:50,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 54 [2023-11-24 21:46:50,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 143 transitions, 1646 flow. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 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) [2023-11-24 21:46:50,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:46:50,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 54 [2023-11-24 21:46:50,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:46:51,972 INFO L124 PetriNetUnfolderBase]: 3329/5703 cut-off events. [2023-11-24 21:46:51,972 INFO L125 PetriNetUnfolderBase]: For 27529/27970 co-relation queries the response was YES. [2023-11-24 21:46:52,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25492 conditions, 5703 events. 3329/5703 cut-off events. For 27529/27970 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 38739 event pairs, 872 based on Foata normal form. 148/5759 useless extension candidates. Maximal degree in co-relation 25453. Up to 2827 conditions per place. [2023-11-24 21:46:52,063 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 91 selfloop transitions, 89 changer transitions 4/206 dead transitions. [2023-11-24 21:46:52,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 206 transitions, 2440 flow [2023-11-24 21:46:52,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:46:52,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:46:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 213 transitions. [2023-11-24 21:46:52,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7888888888888889 [2023-11-24 21:46:52,065 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 213 transitions. [2023-11-24 21:46:52,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 213 transitions. [2023-11-24 21:46:52,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:46:52,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 213 transitions. [2023-11-24 21:46:52,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 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) [2023-11-24 21:46:52,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:46:52,068 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:46:52,068 INFO L175 Difference]: Start difference. First operand has 94 places, 143 transitions, 1646 flow. Second operand 5 states and 213 transitions. [2023-11-24 21:46:52,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 206 transitions, 2440 flow [2023-11-24 21:46:52,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 206 transitions, 2440 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-24 21:46:52,187 INFO L231 Difference]: Finished difference. Result has 101 places, 155 transitions, 2090 flow [2023-11-24 21:46:52,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1646, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2090, PETRI_PLACES=101, PETRI_TRANSITIONS=155} [2023-11-24 21:46:52,189 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 44 predicate places. [2023-11-24 21:46:52,189 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 155 transitions, 2090 flow [2023-11-24 21:46:52,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 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) [2023-11-24 21:46:52,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:46:52,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:46:52,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 21:46:52,191 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:46:52,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:46:52,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2025220909, now seen corresponding path program 2 times [2023-11-24 21:46:52,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:46:52,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864404372] [2023-11-24 21:46:52,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:46:52,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:46:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:46:52,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:46:52,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:46:52,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864404372] [2023-11-24 21:46:52,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864404372] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:46:52,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:46:52,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:46:52,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814045199] [2023-11-24 21:46:52,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:46:52,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:46:52,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:46:52,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:46:52,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:46:52,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 54 [2023-11-24 21:46:52,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 155 transitions, 2090 flow. Second operand has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 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) [2023-11-24 21:46:52,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:46:52,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 54 [2023-11-24 21:46:52,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:46:53,798 INFO L124 PetriNetUnfolderBase]: 2867/4866 cut-off events. [2023-11-24 21:46:53,799 INFO L125 PetriNetUnfolderBase]: For 35441/36776 co-relation queries the response was YES. [2023-11-24 21:46:53,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24906 conditions, 4866 events. 2867/4866 cut-off events. For 35441/36776 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 32288 event pairs, 588 based on Foata normal form. 218/4885 useless extension candidates. Maximal degree in co-relation 24863. Up to 3838 conditions per place. [2023-11-24 21:46:53,882 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 110 selfloop transitions, 46 changer transitions 2/183 dead transitions. [2023-11-24 21:46:53,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 183 transitions, 2556 flow [2023-11-24 21:46:53,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:46:53,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:46:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 216 transitions. [2023-11-24 21:46:53,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8 [2023-11-24 21:46:53,885 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 216 transitions. [2023-11-24 21:46:53,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 216 transitions. [2023-11-24 21:46:53,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:46:53,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 216 transitions. [2023-11-24 21:46:53,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 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) [2023-11-24 21:46:53,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:46:53,888 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:46:53,888 INFO L175 Difference]: Start difference. First operand has 101 places, 155 transitions, 2090 flow. Second operand 5 states and 216 transitions. [2023-11-24 21:46:53,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 183 transitions, 2556 flow [2023-11-24 21:46:54,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 183 transitions, 2428 flow, removed 21 selfloop flow, removed 1 redundant places. [2023-11-24 21:46:54,127 INFO L231 Difference]: Finished difference. Result has 106 places, 158 transitions, 2172 flow [2023-11-24 21:46:54,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1974, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2172, PETRI_PLACES=106, PETRI_TRANSITIONS=158} [2023-11-24 21:46:54,129 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 49 predicate places. [2023-11-24 21:46:54,129 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 158 transitions, 2172 flow [2023-11-24 21:46:54,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 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) [2023-11-24 21:46:54,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:46:54,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:46:54,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 21:46:54,131 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:46:54,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:46:54,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1882440113, now seen corresponding path program 3 times [2023-11-24 21:46:54,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:46:54,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848225599] [2023-11-24 21:46:54,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:46:54,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:46:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:46:54,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:46:54,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:46:54,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848225599] [2023-11-24 21:46:54,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848225599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:46:54,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:46:54,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:46:54,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346650020] [2023-11-24 21:46:54,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:46:54,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:46:54,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:46:54,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:46:54,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:46:54,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-24 21:46:54,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 158 transitions, 2172 flow. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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) [2023-11-24 21:46:54,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:46:54,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-24 21:46:54,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:46:56,520 INFO L124 PetriNetUnfolderBase]: 4913/7765 cut-off events. [2023-11-24 21:46:56,520 INFO L125 PetriNetUnfolderBase]: For 45258/46043 co-relation queries the response was YES. [2023-11-24 21:46:56,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38103 conditions, 7765 events. 4913/7765 cut-off events. For 45258/46043 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 50142 event pairs, 698 based on Foata normal form. 221/7911 useless extension candidates. Maximal degree in co-relation 38057. Up to 3075 conditions per place. [2023-11-24 21:46:56,642 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 122 selfloop transitions, 133 changer transitions 4/278 dead transitions. [2023-11-24 21:46:56,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 278 transitions, 4155 flow [2023-11-24 21:46:56,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:46:56,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:46:56,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2023-11-24 21:46:56,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7814814814814814 [2023-11-24 21:46:56,645 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 211 transitions. [2023-11-24 21:46:56,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 211 transitions. [2023-11-24 21:46:56,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:46:56,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 211 transitions. [2023-11-24 21:46:56,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 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) [2023-11-24 21:46:56,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:46:56,650 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:46:56,650 INFO L175 Difference]: Start difference. First operand has 106 places, 158 transitions, 2172 flow. Second operand 5 states and 211 transitions. [2023-11-24 21:46:56,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 278 transitions, 4155 flow [2023-11-24 21:46:56,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 278 transitions, 4080 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:46:56,946 INFO L231 Difference]: Finished difference. Result has 111 places, 212 transitions, 3490 flow [2023-11-24 21:46:56,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3490, PETRI_PLACES=111, PETRI_TRANSITIONS=212} [2023-11-24 21:46:56,950 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 54 predicate places. [2023-11-24 21:46:56,950 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 212 transitions, 3490 flow [2023-11-24 21:46:56,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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) [2023-11-24 21:46:56,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:46:56,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:46:56,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 21:46:56,951 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:46:56,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:46:56,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1098593023, now seen corresponding path program 4 times [2023-11-24 21:46:56,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:46:56,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948087384] [2023-11-24 21:46:56,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:46:56,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:46:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:46:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:46:57,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:46:57,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948087384] [2023-11-24 21:46:57,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948087384] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:46:57,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:46:57,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:46:57,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15625756] [2023-11-24 21:46:57,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:46:57,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:46:57,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:46:57,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:46:57,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:46:57,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-24 21:46:57,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 212 transitions, 3490 flow. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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) [2023-11-24 21:46:57,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:46:57,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-24 21:46:57,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:46:59,141 INFO L124 PetriNetUnfolderBase]: 4979/8097 cut-off events. [2023-11-24 21:46:59,141 INFO L125 PetriNetUnfolderBase]: For 59822/60574 co-relation queries the response was YES. [2023-11-24 21:46:59,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43065 conditions, 8097 events. 4979/8097 cut-off events. For 59822/60574 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 54060 event pairs, 1167 based on Foata normal form. 215/8231 useless extension candidates. Maximal degree in co-relation 43017. Up to 3937 conditions per place. [2023-11-24 21:46:59,253 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 117 selfloop transitions, 164 changer transitions 0/300 dead transitions. [2023-11-24 21:46:59,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 300 transitions, 4796 flow [2023-11-24 21:46:59,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:46:59,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:46:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 253 transitions. [2023-11-24 21:46:59,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7808641975308642 [2023-11-24 21:46:59,256 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 253 transitions. [2023-11-24 21:46:59,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 253 transitions. [2023-11-24 21:46:59,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:46:59,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 253 transitions. [2023-11-24 21:46:59,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 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) [2023-11-24 21:46:59,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 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) [2023-11-24 21:46:59,260 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 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) [2023-11-24 21:46:59,261 INFO L175 Difference]: Start difference. First operand has 111 places, 212 transitions, 3490 flow. Second operand 6 states and 253 transitions. [2023-11-24 21:46:59,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 300 transitions, 4796 flow [2023-11-24 21:46:59,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 300 transitions, 4675 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-24 21:46:59,559 INFO L231 Difference]: Finished difference. Result has 118 places, 235 transitions, 4153 flow [2023-11-24 21:46:59,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3381, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4153, PETRI_PLACES=118, PETRI_TRANSITIONS=235} [2023-11-24 21:46:59,561 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 61 predicate places. [2023-11-24 21:46:59,561 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 235 transitions, 4153 flow [2023-11-24 21:46:59,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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) [2023-11-24 21:46:59,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:46:59,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:46:59,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-24 21:46:59,562 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:46:59,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:46:59,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1769893381, now seen corresponding path program 5 times [2023-11-24 21:46:59,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:46:59,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863877488] [2023-11-24 21:46:59,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:46:59,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:46:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:46:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:46:59,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:46:59,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863877488] [2023-11-24 21:46:59,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863877488] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:46:59,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:46:59,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:46:59,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112542348] [2023-11-24 21:46:59,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:46:59,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:46:59,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:46:59,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:46:59,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:46:59,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 54 [2023-11-24 21:46:59,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 235 transitions, 4153 flow. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 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) [2023-11-24 21:46:59,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:46:59,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 54 [2023-11-24 21:46:59,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:47:01,742 INFO L124 PetriNetUnfolderBase]: 4305/7324 cut-off events. [2023-11-24 21:47:01,742 INFO L125 PetriNetUnfolderBase]: For 71776/72463 co-relation queries the response was YES. [2023-11-24 21:47:01,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42143 conditions, 7324 events. 4305/7324 cut-off events. For 71776/72463 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 51210 event pairs, 1053 based on Foata normal form. 182/7378 useless extension candidates. Maximal degree in co-relation 42092. Up to 3687 conditions per place. [2023-11-24 21:47:01,849 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 96 selfloop transitions, 152 changer transitions 6/285 dead transitions. [2023-11-24 21:47:01,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 285 transitions, 4964 flow [2023-11-24 21:47:01,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:47:01,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:47:01,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2023-11-24 21:47:01,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7962962962962963 [2023-11-24 21:47:01,852 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 215 transitions. [2023-11-24 21:47:01,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 215 transitions. [2023-11-24 21:47:01,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:47:01,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 215 transitions. [2023-11-24 21:47:01,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 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) [2023-11-24 21:47:01,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:47:01,855 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:47:01,855 INFO L175 Difference]: Start difference. First operand has 118 places, 235 transitions, 4153 flow. Second operand 5 states and 215 transitions. [2023-11-24 21:47:01,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 285 transitions, 4964 flow [2023-11-24 21:47:02,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 285 transitions, 4948 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-11-24 21:47:02,213 INFO L231 Difference]: Finished difference. Result has 124 places, 233 transitions, 4452 flow [2023-11-24 21:47:02,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4079, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4452, PETRI_PLACES=124, PETRI_TRANSITIONS=233} [2023-11-24 21:47:02,214 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 67 predicate places. [2023-11-24 21:47:02,214 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 233 transitions, 4452 flow [2023-11-24 21:47:02,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 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) [2023-11-24 21:47:02,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:47:02,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:47:02,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-24 21:47:02,216 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:47:02,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:47:02,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1093387675, now seen corresponding path program 6 times [2023-11-24 21:47:02,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:47:02,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544360471] [2023-11-24 21:47:02,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:02,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:47:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:02,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:47:02,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:47:02,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544360471] [2023-11-24 21:47:02,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544360471] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:47:02,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81538917] [2023-11-24 21:47:02,580 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-24 21:47:02,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:47:02,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:47:02,582 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:47:02,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 21:47:02,703 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-24 21:47:02,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 21:47:02,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-24 21:47:02,708 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:47:02,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:47:02,947 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:47:03,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:47:03,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81538917] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:47:03,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:47:03,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2023-11-24 21:47:03,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292986112] [2023-11-24 21:47:03,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:47:03,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-24 21:47:03,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:47:03,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-24 21:47:03,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-24 21:47:03,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-24 21:47:03,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 233 transitions, 4452 flow. Second operand has 12 states, 12 states have (on average 32.75) internal successors, (393), 12 states have internal predecessors, (393), 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) [2023-11-24 21:47:03,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:47:03,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-24 21:47:03,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:47:08,554 INFO L124 PetriNetUnfolderBase]: 9612/14753 cut-off events. [2023-11-24 21:47:08,554 INFO L125 PetriNetUnfolderBase]: For 147915/147949 co-relation queries the response was YES. [2023-11-24 21:47:08,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85466 conditions, 14753 events. 9612/14753 cut-off events. For 147915/147949 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 96252 event pairs, 634 based on Foata normal form. 295/15034 useless extension candidates. Maximal degree in co-relation 85412. Up to 3417 conditions per place. [2023-11-24 21:47:08,755 INFO L140 encePairwiseOnDemand]: 39/54 looper letters, 282 selfloop transitions, 351 changer transitions 76/721 dead transitions. [2023-11-24 21:47:08,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 721 transitions, 11185 flow [2023-11-24 21:47:08,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-24 21:47:08,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-24 21:47:08,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1165 transitions. [2023-11-24 21:47:08,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.743933588761175 [2023-11-24 21:47:08,762 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 1165 transitions. [2023-11-24 21:47:08,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 1165 transitions. [2023-11-24 21:47:08,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:47:08,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 1165 transitions. [2023-11-24 21:47:08,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 40.172413793103445) internal successors, (1165), 29 states have internal predecessors, (1165), 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) [2023-11-24 21:47:08,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 54.0) internal successors, (1620), 30 states have internal predecessors, (1620), 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) [2023-11-24 21:47:08,775 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 54.0) internal successors, (1620), 30 states have internal predecessors, (1620), 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) [2023-11-24 21:47:08,775 INFO L175 Difference]: Start difference. First operand has 124 places, 233 transitions, 4452 flow. Second operand 29 states and 1165 transitions. [2023-11-24 21:47:08,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 721 transitions, 11185 flow [2023-11-24 21:47:09,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 721 transitions, 10640 flow, removed 27 selfloop flow, removed 2 redundant places. [2023-11-24 21:47:09,447 INFO L231 Difference]: Finished difference. Result has 172 places, 425 transitions, 8442 flow [2023-11-24 21:47:09,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3875, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=8442, PETRI_PLACES=172, PETRI_TRANSITIONS=425} [2023-11-24 21:47:09,447 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 115 predicate places. [2023-11-24 21:47:09,448 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 425 transitions, 8442 flow [2023-11-24 21:47:09,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 32.75) internal successors, (393), 12 states have internal predecessors, (393), 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) [2023-11-24 21:47:09,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:47:09,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:47:09,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 21:47:09,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-24 21:47:09,660 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:47:09,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:47:09,661 INFO L85 PathProgramCache]: Analyzing trace with hash 118304707, now seen corresponding path program 1 times [2023-11-24 21:47:09,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:47:09,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563513873] [2023-11-24 21:47:09,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:09,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:47:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:10,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:47:10,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:47:10,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563513873] [2023-11-24 21:47:10,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563513873] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:47:10,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714829704] [2023-11-24 21:47:10,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:10,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:47:10,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:47:10,212 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:47:10,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 21:47:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:10,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-24 21:47:10,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:47:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:47:10,528 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:47:10,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:47:10,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714829704] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:47:10,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:47:10,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-24 21:47:10,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543342895] [2023-11-24 21:47:10,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:47:10,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 21:47:10,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:47:10,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 21:47:10,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-24 21:47:11,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 54 [2023-11-24 21:47:11,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 425 transitions, 8442 flow. Second operand has 11 states, 11 states have (on average 37.27272727272727) internal successors, (410), 11 states have internal predecessors, (410), 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) [2023-11-24 21:47:11,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:47:11,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 54 [2023-11-24 21:47:11,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:47:14,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([315] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][238], [Black: 379#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 130#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 128#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 127#(and (or (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)) (< 0 thread1Thread1of1ForFork1_~cond~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)), Black: 126#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), 86#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 66#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 391#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (< (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 387#(or (< (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 400#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 404#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)))), Black: 401#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 632#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 654#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)))), Black: 649#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 662#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))), Black: 565#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))), Black: 658#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))), 424#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 412#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 425#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 415#(and (= thread2Thread1of1ForFork0_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 422#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 643#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 660#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))), Black: 665#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))), Black: 627#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), 362#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 634#(and (= ~N~0 ~L~0) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (= ~q~0 0)), Black: 625#(and (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 420#true, 43#thread2EXITtrue, Black: 629#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 615#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 656#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 621#(and (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 423#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 578#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), 136#true, 74#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 28#L45true, 123#true, 42#L99-4true, 349#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))), Black: 329#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 145#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), 689#true, Black: 335#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~q~0 0) (or (< 0 (mod ~L~0 4294967296)) (= ~p~0 0))), Black: 339#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= ~q~0 0)), Black: 331#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), 7#L83true, Black: 333#(and (not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (= ~q~0 0)), 82#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 90#(and (= ~p~0 0) (= ~q~0 0)), 393#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 353#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))), Black: 355#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)))), 70#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 104#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 96#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 102#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 100#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 95#(or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)), Black: 368#(and (= thread2Thread1of1ForFork0_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 366#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), 78#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 115#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 114#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 117#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 93#true, 402#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 381#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2023-11-24 21:47:14,864 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-24 21:47:14,864 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-24 21:47:14,864 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 21:47:14,864 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 21:47:14,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([304] L45-->L50: Formula: (let ((.cse0 (mod v_~N~0_60 4294967296))) (or (and (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (= v_~p~0_50 v_~p~0_49) (= v_~N~0_60 v_~N~0_59) (<= .cse0 0)) (and (< 0 .cse0) (= (+ 1 v_~N~0_59) v_~N~0_60) (= v_~p~0_49 (+ v_~p~0_50 v_~M~0_46))))) InVars {~p~0=v_~p~0_50, ~N~0=v_~N~0_60, ~M~0=v_~M~0_46, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} OutVars{~p~0=v_~p~0_49, ~N~0=v_~N~0_59, ~M~0=v_~M~0_46, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~p~0, ~N~0][143], [Black: 379#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 130#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 128#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 127#(and (or (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)) (< 0 thread1Thread1of1ForFork1_~cond~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)), 425#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 126#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), 86#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 66#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 391#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (< (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 387#(or (< (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 393#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 400#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 404#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)))), Black: 401#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 632#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 654#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)))), Black: 649#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 424#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 662#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))), Black: 565#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))), Black: 658#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))), Black: 412#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 415#(and (= thread2Thread1of1ForFork0_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 422#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 643#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 660#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))), Black: 665#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))), Black: 627#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 634#(and (= ~N~0 ~L~0) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (= ~q~0 0)), Black: 625#(and (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 420#true, 43#thread2EXITtrue, Black: 629#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 615#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 656#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 621#(and (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 423#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 578#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), 40#L50true, 74#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 347#true, 123#true, 42#L99-4true, Black: 329#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 145#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), 398#true, 689#true, Black: 335#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~q~0 0) (or (< 0 (mod ~L~0 4294967296)) (= ~p~0 0))), Black: 339#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= ~q~0 0)), Black: 331#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), 82#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 90#(and (= ~p~0 0) (= ~q~0 0)), 333#(and (not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (= ~q~0 0)), Black: 353#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))), Black: 349#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))), Black: 355#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)))), 70#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 104#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 96#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 102#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 100#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 95#(or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)), 17#L80true, Black: 368#(and (= thread2Thread1of1ForFork0_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 362#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 366#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), 78#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 115#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 114#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 117#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 93#true, Black: 381#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2023-11-24 21:47:14,867 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-24 21:47:14,867 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-24 21:47:14,867 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 21:47:14,867 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 21:47:15,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([315] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork2_#t~post2=|v_thread3Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork2_#t~post2][238], [Black: 379#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 130#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 128#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 127#(and (or (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)) (< 0 thread1Thread1of1ForFork1_~cond~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)), Black: 126#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), 86#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 66#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 391#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (< (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 387#(or (< (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 400#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 404#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)))), Black: 401#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 632#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 654#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)))), Black: 649#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 662#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))), Black: 565#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))), Black: 658#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))), 424#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 412#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 425#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 415#(and (= thread2Thread1of1ForFork0_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 422#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 643#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 660#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))), Black: 665#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))), Black: 627#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), 362#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 634#(and (= ~N~0 ~L~0) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (= ~q~0 0)), Black: 625#(and (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 420#true, 43#thread2EXITtrue, Black: 629#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 615#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 656#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 621#(and (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 423#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 578#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), 136#true, 74#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 28#L45true, 123#true, 349#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))), Black: 329#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 145#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), 49#L100true, 689#true, Black: 335#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~q~0 0) (or (< 0 (mod ~L~0 4294967296)) (= ~p~0 0))), Black: 339#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= ~q~0 0)), 7#L83true, Black: 331#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), Black: 333#(and (not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (= ~q~0 0)), 82#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 90#(and (= ~p~0 0) (= ~q~0 0)), 393#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 353#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))), Black: 355#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)))), 70#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 104#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 96#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 102#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 100#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 95#(or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)), Black: 368#(and (= thread2Thread1of1ForFork0_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 366#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), 78#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 115#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 114#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 117#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 93#true, 402#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 381#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2023-11-24 21:47:15,192 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-24 21:47:15,193 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-24 21:47:15,193 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 21:47:15,193 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 21:47:15,193 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([304] L45-->L50: Formula: (let ((.cse0 (mod v_~N~0_60 4294967296))) (or (and (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (= v_~p~0_50 v_~p~0_49) (= v_~N~0_60 v_~N~0_59) (<= .cse0 0)) (and (< 0 .cse0) (= (+ 1 v_~N~0_59) v_~N~0_60) (= v_~p~0_49 (+ v_~p~0_50 v_~M~0_46))))) InVars {~p~0=v_~p~0_50, ~N~0=v_~N~0_60, ~M~0=v_~M~0_46, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} OutVars{~p~0=v_~p~0_49, ~N~0=v_~N~0_59, ~M~0=v_~M~0_46, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~p~0, ~N~0][143], [Black: 379#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 130#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 128#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 127#(and (or (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)) (< 0 thread1Thread1of1ForFork1_~cond~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)), 425#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 126#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), 86#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 66#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 391#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (< (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 387#(or (< (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 393#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1) (or (< (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 400#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 404#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)))), Black: 401#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 632#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 654#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)))), Black: 649#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 424#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 662#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))), Black: 565#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))), Black: 658#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))), Black: 412#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 415#(and (= thread2Thread1of1ForFork0_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 422#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 643#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 660#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))), Black: 665#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))), Black: 627#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 634#(and (= ~N~0 ~L~0) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (= ~q~0 0)), Black: 625#(and (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 420#true, 43#thread2EXITtrue, Black: 629#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 615#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 656#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 621#(and (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 423#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 578#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), 40#L50true, 74#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 347#true, 123#true, Black: 329#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 145#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), 49#L100true, 398#true, 689#true, Black: 335#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~q~0 0) (or (< 0 (mod ~L~0 4294967296)) (= ~p~0 0))), Black: 339#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= ~q~0 0)), Black: 331#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), 82#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 90#(and (= ~p~0 0) (= ~q~0 0)), 333#(and (not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (= ~q~0 0)), Black: 353#(or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))), Black: 349#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0))), Black: 355#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (= thread2Thread1of1ForFork0_~cond~1 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0)))), 70#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 104#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 96#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 102#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 100#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 95#(or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0)), 17#L80true, Black: 368#(and (= thread2Thread1of1ForFork0_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 362#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 366#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), 78#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 115#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 114#(< (* (div ~N~0 4294967296) 4294967296) ~N~0), Black: 117#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 93#true, Black: 381#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2023-11-24 21:47:15,193 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-24 21:47:15,193 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-24 21:47:15,193 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 21:47:15,194 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-24 21:47:16,437 INFO L124 PetriNetUnfolderBase]: 7976/13777 cut-off events. [2023-11-24 21:47:16,437 INFO L125 PetriNetUnfolderBase]: For 235940/237846 co-relation queries the response was YES. [2023-11-24 21:47:16,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101284 conditions, 13777 events. 7976/13777 cut-off events. For 235940/237846 co-relation queries the response was YES. Maximal size of possible extension queue 875. Compared 107528 event pairs, 645 based on Foata normal form. 554/13928 useless extension candidates. Maximal degree in co-relation 101207. Up to 6834 conditions per place. [2023-11-24 21:47:16,689 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 243 selfloop transitions, 290 changer transitions 3/679 dead transitions. [2023-11-24 21:47:16,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 679 transitions, 14068 flow [2023-11-24 21:47:16,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:47:16,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 21:47:16,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 392 transitions. [2023-11-24 21:47:16,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8065843621399177 [2023-11-24 21:47:16,692 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 392 transitions. [2023-11-24 21:47:16,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 392 transitions. [2023-11-24 21:47:16,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:47:16,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 392 transitions. [2023-11-24 21:47:16,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 43.55555555555556) internal successors, (392), 9 states have internal predecessors, (392), 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) [2023-11-24 21:47:16,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 54.0) internal successors, (540), 10 states have internal predecessors, (540), 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) [2023-11-24 21:47:16,697 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 54.0) internal successors, (540), 10 states have internal predecessors, (540), 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) [2023-11-24 21:47:16,697 INFO L175 Difference]: Start difference. First operand has 172 places, 425 transitions, 8442 flow. Second operand 9 states and 392 transitions. [2023-11-24 21:47:16,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 679 transitions, 14068 flow [2023-11-24 21:47:18,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 679 transitions, 13119 flow, removed 356 selfloop flow, removed 13 redundant places. [2023-11-24 21:47:18,668 INFO L231 Difference]: Finished difference. Result has 165 places, 620 transitions, 12743 flow [2023-11-24 21:47:18,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=7823, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12743, PETRI_PLACES=165, PETRI_TRANSITIONS=620} [2023-11-24 21:47:18,668 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 108 predicate places. [2023-11-24 21:47:18,669 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 620 transitions, 12743 flow [2023-11-24 21:47:18,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.27272727272727) internal successors, (410), 11 states have internal predecessors, (410), 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) [2023-11-24 21:47:18,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:47:18,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:47:18,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-24 21:47:18,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:47:18,870 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 21:47:18,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:47:18,871 INFO L85 PathProgramCache]: Analyzing trace with hash 122922069, now seen corresponding path program 2 times [2023-11-24 21:47:18,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:47:18,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178699969] [2023-11-24 21:47:18,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:47:18,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:47:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:47:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:47:19,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:47:19,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178699969] [2023-11-24 21:47:19,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178699969] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:47:19,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590984934] [2023-11-24 21:47:19,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 21:47:19,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:47:19,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:47:19,307 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:47:19,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_226b22aa-5c55-485c-b61f-714f6daae0b3/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 21:47:19,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 21:47:19,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 21:47:19,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-24 21:47:19,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:47:19,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:47:19,817 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:47:21,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:47:21,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590984934] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:47:21,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:47:21,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-24 21:47:21,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793983727] [2023-11-24 21:47:21,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:47:21,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-24 21:47:21,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:47:21,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-24 21:47:21,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-24 21:47:21,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 54 [2023-11-24 21:47:21,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 620 transitions, 12743 flow. Second operand has 12 states, 12 states have (on average 37.5) internal successors, (450), 12 states have internal predecessors, (450), 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) [2023-11-24 21:47:21,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:47:21,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 54 [2023-11-24 21:47:21,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand