./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 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_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX --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 4eda2bf92bccdcc8638b67653fb7fdefc015ff9c815b317ad1009deb61d04585 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:09:00,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:09:00,537 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-08 17:09:00,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:09:00,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:09:00,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:09:00,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:09:00,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:09:00,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:09:00,595 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:09:00,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:09:00,598 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:09:00,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:09:00,599 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:09:00,600 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:09:00,600 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:09:00,604 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:09:00,604 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:09:00,605 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:09:00,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:09:00,605 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 17:09:00,606 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 17:09:00,606 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 17:09:00,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:09:00,607 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:09:00,607 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:09:00,608 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 17:09:00,610 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:09:00,610 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:09:00,611 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:09:00,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:09:00,611 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:09:00,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:09:00,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:09:00,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:09:00,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:09:00,613 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:09:00,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:09:00,615 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:09:00,615 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:09:00,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:09:00,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:09:00,616 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_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/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_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX 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 -> 4eda2bf92bccdcc8638b67653fb7fdefc015ff9c815b317ad1009deb61d04585 [2024-11-08 17:09:00,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:09:00,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:09:00,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:09:00,900 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:09:00,901 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:09:00,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c Unable to find full path for "g++" [2024-11-08 17:09:03,068 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:09:03,252 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:09:03,253 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2024-11-08 17:09:03,261 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/data/f3973a55f/ea064a9171a64ccfbff528ef2a91fafd/FLAGc846f4a32 [2024-11-08 17:09:03,276 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/data/f3973a55f/ea064a9171a64ccfbff528ef2a91fafd [2024-11-08 17:09:03,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:09:03,281 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:09:03,282 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:09:03,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:09:03,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:09:03,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:09:03" (1/1) ... [2024-11-08 17:09:03,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45a90aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:03, skipping insertion in model container [2024-11-08 17:09:03,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:09:03" (1/1) ... [2024-11-08 17:09:03,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:09:03,559 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:09:03,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:09:03,573 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:09:03,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:09:03,621 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:09:03,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:03 WrapperNode [2024-11-08 17:09:03,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:09:03,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:09:03,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:09:03,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:09:03,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:03" (1/1) ... [2024-11-08 17:09:03,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:03" (1/1) ... [2024-11-08 17:09:03,682 INFO L138 Inliner]: procedures = 24, calls = 38, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 147 [2024-11-08 17:09:03,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:09:03,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:09:03,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:09:03,687 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:09:03,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:03" (1/1) ... [2024-11-08 17:09:03,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:03" (1/1) ... [2024-11-08 17:09:03,700 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:03" (1/1) ... [2024-11-08 17:09:03,717 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-08 17:09:03,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:03" (1/1) ... [2024-11-08 17:09:03,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:03" (1/1) ... [2024-11-08 17:09:03,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:03" (1/1) ... [2024-11-08 17:09:03,731 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:03" (1/1) ... [2024-11-08 17:09:03,733 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:03" (1/1) ... [2024-11-08 17:09:03,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:03" (1/1) ... [2024-11-08 17:09:03,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:09:03,738 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:09:03,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:09:03,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:09:03,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:03" (1/1) ... [2024-11-08 17:09:03,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:09:03,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:09:03,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:09:03,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:09:03,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:09:03,807 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-08 17:09:03,807 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-08 17:09:03,807 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-08 17:09:03,807 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-08 17:09:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-08 17:09:03,808 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-08 17:09:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:09:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 17:09:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 17:09:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 17:09:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-08 17:09:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-08 17:09:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 17:09:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:09:03,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:09:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 17:09:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 17:09:03,812 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 17:09:03,921 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:09:03,923 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:09:04,280 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 17:09:04,280 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:09:04,650 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:09:04,650 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 17:09:04,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:09:04 BoogieIcfgContainer [2024-11-08 17:09:04,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:09:04,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:09:04,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:09:04,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:09:04,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:09:03" (1/3) ... [2024-11-08 17:09:04,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0972a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:09:04, skipping insertion in model container [2024-11-08 17:09:04,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:03" (2/3) ... [2024-11-08 17:09:04,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0972a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:09:04, skipping insertion in model container [2024-11-08 17:09:04,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:09:04" (3/3) ... [2024-11-08 17:09:04,664 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2024-11-08 17:09:04,684 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:09:04,684 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-08 17:09:04,684 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 17:09:04,769 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-08 17:09:04,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 57 transitions, 135 flow [2024-11-08 17:09:04,837 INFO L124 PetriNetUnfolderBase]: 7/54 cut-off events. [2024-11-08 17:09:04,837 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-08 17:09:04,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 54 events. 7/54 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 121 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-11-08 17:09:04,841 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 57 transitions, 135 flow [2024-11-08 17:09:04,845 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 53 transitions, 124 flow [2024-11-08 17:09:04,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:09:04,865 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@f7c1b71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:09:04,866 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2024-11-08 17:09:04,875 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 17:09:04,875 INFO L124 PetriNetUnfolderBase]: 2/8 cut-off events. [2024-11-08 17:09:04,875 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 17:09:04,876 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:09:04,876 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-08 17:09:04,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-08 17:09:04,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:04,882 INFO L85 PathProgramCache]: Analyzing trace with hash 13579239, now seen corresponding path program 1 times [2024-11-08 17:09:04,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:04,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285754349] [2024-11-08 17:09:04,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:04,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:09:05,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:05,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285754349] [2024-11-08 17:09:05,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285754349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:05,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:05,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 17:09:05,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028443644] [2024-11-08 17:09:05,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:05,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:09:05,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:05,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:09:05,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:09:05,303 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 57 [2024-11-08 17:09:05,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:05,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:09:05,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 57 [2024-11-08 17:09:05,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:09:05,703 INFO L124 PetriNetUnfolderBase]: 537/971 cut-off events. [2024-11-08 17:09:05,704 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-11-08 17:09:05,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1927 conditions, 971 events. 537/971 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 7142 event pairs, 491 based on Foata normal form. 1/638 useless extension candidates. Maximal degree in co-relation 1785. Up to 826 conditions per place. [2024-11-08 17:09:05,723 INFO L140 encePairwiseOnDemand]: 53/57 looper letters, 25 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-11-08 17:09:05,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 50 transitions, 172 flow [2024-11-08 17:09:05,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:09:05,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 17:09:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2024-11-08 17:09:05,739 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6432748538011696 [2024-11-08 17:09:05,741 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 124 flow. Second operand 3 states and 110 transitions. [2024-11-08 17:09:05,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 50 transitions, 172 flow [2024-11-08 17:09:05,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 160 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-08 17:09:05,756 INFO L231 Difference]: Finished difference. Result has 49 places, 50 transitions, 110 flow [2024-11-08 17:09:05,758 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=49, PETRI_TRANSITIONS=50} [2024-11-08 17:09:05,765 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -7 predicate places. [2024-11-08 17:09:05,766 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 110 flow [2024-11-08 17:09:05,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:05,766 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:09:05,766 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-08 17:09:05,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:09:05,767 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-08 17:09:05,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:05,768 INFO L85 PathProgramCache]: Analyzing trace with hash 13579240, now seen corresponding path program 1 times [2024-11-08 17:09:05,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:05,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659463383] [2024-11-08 17:09:05,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:05,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:06,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:09:06,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:06,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659463383] [2024-11-08 17:09:06,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659463383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:06,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:06,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:09:06,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996859340] [2024-11-08 17:09:06,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:06,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:09:06,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:06,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:09:06,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:09:06,246 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 57 [2024-11-08 17:09:06,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:06,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:09:06,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 57 [2024-11-08 17:09:06,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:09:06,574 INFO L124 PetriNetUnfolderBase]: 537/971 cut-off events. [2024-11-08 17:09:06,575 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 17:09:06,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1860 conditions, 971 events. 537/971 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 7121 event pairs, 491 based on Foata normal form. 0/636 useless extension candidates. Maximal degree in co-relation 1838. Up to 827 conditions per place. [2024-11-08 17:09:06,584 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 26 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2024-11-08 17:09:06,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 50 transitions, 174 flow [2024-11-08 17:09:06,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:09:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 17:09:06,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2024-11-08 17:09:06,588 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2024-11-08 17:09:06,589 INFO L175 Difference]: Start difference. First operand has 49 places, 50 transitions, 110 flow. Second operand 4 states and 128 transitions. [2024-11-08 17:09:06,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 50 transitions, 174 flow [2024-11-08 17:09:06,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 17:09:06,592 INFO L231 Difference]: Finished difference. Result has 49 places, 50 transitions, 116 flow [2024-11-08 17:09:06,593 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=49, PETRI_TRANSITIONS=50} [2024-11-08 17:09:06,593 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -7 predicate places. [2024-11-08 17:09:06,594 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 116 flow [2024-11-08 17:09:06,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:06,595 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:09:06,595 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:06,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:09:06,596 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-08 17:09:06,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:06,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1194059221, now seen corresponding path program 1 times [2024-11-08 17:09:06,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:06,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710767588] [2024-11-08 17:09:06,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:06,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:06,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:09:06,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:06,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710767588] [2024-11-08 17:09:06,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710767588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:06,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:06,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 17:09:06,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042025552] [2024-11-08 17:09:06,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:06,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:09:06,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:06,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:09:06,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:09:06,714 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 57 [2024-11-08 17:09:06,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:06,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:09:06,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 57 [2024-11-08 17:09:06,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:09:06,977 INFO L124 PetriNetUnfolderBase]: 847/1502 cut-off events. [2024-11-08 17:09:06,977 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-08 17:09:06,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2701 conditions, 1502 events. 847/1502 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 8788 event pairs, 266 based on Foata normal form. 46/1048 useless extension candidates. Maximal degree in co-relation 2680. Up to 856 conditions per place. [2024-11-08 17:09:06,991 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 41 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2024-11-08 17:09:06,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 240 flow [2024-11-08 17:09:06,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:09:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 17:09:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2024-11-08 17:09:06,997 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7602339181286549 [2024-11-08 17:09:06,997 INFO L175 Difference]: Start difference. First operand has 49 places, 50 transitions, 116 flow. Second operand 3 states and 130 transitions. [2024-11-08 17:09:06,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 240 flow [2024-11-08 17:09:07,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 66 transitions, 237 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 17:09:07,001 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 136 flow [2024-11-08 17:09:07,002 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2024-11-08 17:09:07,002 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -5 predicate places. [2024-11-08 17:09:07,003 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 136 flow [2024-11-08 17:09:07,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:07,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:09:07,003 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:07,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:09:07,003 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-08 17:09:07,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:07,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1755268520, now seen corresponding path program 1 times [2024-11-08 17:09:07,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:07,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438267166] [2024-11-08 17:09:07,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:07,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:09:07,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:07,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438267166] [2024-11-08 17:09:07,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438267166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:07,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:07,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:09:07,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127426527] [2024-11-08 17:09:07,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:07,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:09:07,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:07,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:09:07,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:09:07,169 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 57 [2024-11-08 17:09:07,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:07,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:09:07,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 57 [2024-11-08 17:09:07,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:09:07,361 INFO L124 PetriNetUnfolderBase]: 523/948 cut-off events. [2024-11-08 17:09:07,361 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2024-11-08 17:09:07,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1934 conditions, 948 events. 523/948 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5205 event pairs, 330 based on Foata normal form. 0/758 useless extension candidates. Maximal degree in co-relation 1100. Up to 712 conditions per place. [2024-11-08 17:09:07,371 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 24 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2024-11-08 17:09:07,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 182 flow [2024-11-08 17:09:07,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:09:07,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 17:09:07,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2024-11-08 17:09:07,375 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5921052631578947 [2024-11-08 17:09:07,375 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 136 flow. Second operand 4 states and 135 transitions. [2024-11-08 17:09:07,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 182 flow [2024-11-08 17:09:07,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 49 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 17:09:07,378 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 131 flow [2024-11-08 17:09:07,378 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2024-11-08 17:09:07,380 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -6 predicate places. [2024-11-08 17:09:07,380 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 131 flow [2024-11-08 17:09:07,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:07,381 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:09:07,381 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:07,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:09:07,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-08 17:09:07,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:07,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1755268521, now seen corresponding path program 1 times [2024-11-08 17:09:07,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:07,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681387828] [2024-11-08 17:09:07,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:07,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:07,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:09:07,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:07,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681387828] [2024-11-08 17:09:07,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681387828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:07,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:07,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:09:07,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662474943] [2024-11-08 17:09:07,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:07,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:09:07,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:07,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:09:07,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:09:07,513 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 57 [2024-11-08 17:09:07,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:07,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:09:07,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 57 [2024-11-08 17:09:07,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:09:07,725 INFO L124 PetriNetUnfolderBase]: 580/1085 cut-off events. [2024-11-08 17:09:07,725 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2024-11-08 17:09:07,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2171 conditions, 1085 events. 580/1085 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6128 event pairs, 383 based on Foata normal form. 10/895 useless extension candidates. Maximal degree in co-relation 1885. Up to 719 conditions per place. [2024-11-08 17:09:07,734 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 44 selfloop transitions, 6 changer transitions 0/69 dead transitions. [2024-11-08 17:09:07,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 69 transitions, 287 flow [2024-11-08 17:09:07,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:09:07,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 17:09:07,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 172 transitions. [2024-11-08 17:09:07,736 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6035087719298246 [2024-11-08 17:09:07,736 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 131 flow. Second operand 5 states and 172 transitions. [2024-11-08 17:09:07,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 69 transitions, 287 flow [2024-11-08 17:09:07,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 69 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 17:09:07,738 INFO L231 Difference]: Finished difference. Result has 55 places, 54 transitions, 177 flow [2024-11-08 17:09:07,739 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2024-11-08 17:09:07,740 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2024-11-08 17:09:07,740 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 177 flow [2024-11-08 17:09:07,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:07,740 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:09:07,741 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:07,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:09:07,741 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-08 17:09:07,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:07,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1012543514, now seen corresponding path program 1 times [2024-11-08 17:09:07,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:07,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540654572] [2024-11-08 17:09:07,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:07,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:08,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:09:08,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:08,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540654572] [2024-11-08 17:09:08,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540654572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:09:08,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411064953] [2024-11-08 17:09:08,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:08,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:09:08,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:09:08,042 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:09:08,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:09:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:08,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 17:09:08,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:09:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:09:08,380 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:09:08,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411064953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:08,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:09:08,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 10 [2024-11-08 17:09:08,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607650086] [2024-11-08 17:09:08,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:08,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:09:08,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:08,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:09:08,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:09:08,431 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 57 [2024-11-08 17:09:08,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 177 flow. Second operand has 7 states, 7 states have (on average 27.571428571428573) internal successors, (193), 7 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:08,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:09:08,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 57 [2024-11-08 17:09:08,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:09:08,703 INFO L124 PetriNetUnfolderBase]: 334/705 cut-off events. [2024-11-08 17:09:08,703 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2024-11-08 17:09:08,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1404 conditions, 705 events. 334/705 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3831 event pairs, 167 based on Foata normal form. 68/661 useless extension candidates. Maximal degree in co-relation 1124. Up to 390 conditions per place. [2024-11-08 17:09:08,709 INFO L140 encePairwiseOnDemand]: 49/57 looper letters, 28 selfloop transitions, 10 changer transitions 0/58 dead transitions. [2024-11-08 17:09:08,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 58 transitions, 263 flow [2024-11-08 17:09:08,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:09:08,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 17:09:08,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2024-11-08 17:09:08,711 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5754385964912281 [2024-11-08 17:09:08,711 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 177 flow. Second operand 5 states and 164 transitions. [2024-11-08 17:09:08,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 58 transitions, 263 flow [2024-11-08 17:09:08,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 58 transitions, 261 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 17:09:08,716 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 187 flow [2024-11-08 17:09:08,718 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2024-11-08 17:09:08,718 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2024-11-08 17:09:08,719 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 187 flow [2024-11-08 17:09:08,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.571428571428573) internal successors, (193), 7 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:08,720 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:09:08,720 INFO L204 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] [2024-11-08 17:09:08,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:09:08,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:09:08,924 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-08 17:09:08,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:08,925 INFO L85 PathProgramCache]: Analyzing trace with hash 381514939, now seen corresponding path program 1 times [2024-11-08 17:09:08,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:08,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594472544] [2024-11-08 17:09:08,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:08,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:09:09,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:09,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594472544] [2024-11-08 17:09:09,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594472544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:09,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:09,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:09:09,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566690115] [2024-11-08 17:09:09,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:09,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:09:09,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:09,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:09:09,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:09:09,113 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 57 [2024-11-08 17:09:09,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 187 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:09,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:09:09,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 57 [2024-11-08 17:09:09,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:09:09,316 INFO L124 PetriNetUnfolderBase]: 618/1035 cut-off events. [2024-11-08 17:09:09,317 INFO L125 PetriNetUnfolderBase]: For 571/571 co-relation queries the response was YES. [2024-11-08 17:09:09,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2403 conditions, 1035 events. 618/1035 cut-off events. For 571/571 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4913 event pairs, 85 based on Foata normal form. 88/1082 useless extension candidates. Maximal degree in co-relation 1888. Up to 659 conditions per place. [2024-11-08 17:09:09,324 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 52 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2024-11-08 17:09:09,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 391 flow [2024-11-08 17:09:09,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:09:09,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 17:09:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2024-11-08 17:09:09,325 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6140350877192983 [2024-11-08 17:09:09,325 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 187 flow. Second operand 4 states and 140 transitions. [2024-11-08 17:09:09,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 391 flow [2024-11-08 17:09:09,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 351 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-08 17:09:09,329 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 190 flow [2024-11-08 17:09:09,330 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2024-11-08 17:09:09,330 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places. [2024-11-08 17:09:09,330 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 190 flow [2024-11-08 17:09:09,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:09,331 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:09:09,331 INFO L204 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] [2024-11-08 17:09:09,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:09:09,331 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-08 17:09:09,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:09,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2014386959, now seen corresponding path program 2 times [2024-11-08 17:09:09,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:09,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418644516] [2024-11-08 17:09:09,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:09,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:09:09,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:09,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418644516] [2024-11-08 17:09:09,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418644516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:09,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:09,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:09:09,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362108152] [2024-11-08 17:09:09,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:09,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:09:09,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:09,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:09:09,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:09:09,471 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 57 [2024-11-08 17:09:09,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:09,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:09:09,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 57 [2024-11-08 17:09:09,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:09:09,714 INFO L124 PetriNetUnfolderBase]: 773/1374 cut-off events. [2024-11-08 17:09:09,714 INFO L125 PetriNetUnfolderBase]: For 387/387 co-relation queries the response was YES. [2024-11-08 17:09:09,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3034 conditions, 1374 events. 773/1374 cut-off events. For 387/387 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6924 event pairs, 201 based on Foata normal form. 124/1446 useless extension candidates. Maximal degree in co-relation 2448. Up to 715 conditions per place. [2024-11-08 17:09:09,725 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 52 selfloop transitions, 7 changer transitions 0/79 dead transitions. [2024-11-08 17:09:09,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 79 transitions, 392 flow [2024-11-08 17:09:09,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:09:09,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 17:09:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2024-11-08 17:09:09,727 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5824561403508772 [2024-11-08 17:09:09,727 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 190 flow. Second operand 5 states and 166 transitions. [2024-11-08 17:09:09,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 79 transitions, 392 flow [2024-11-08 17:09:09,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 387 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 17:09:09,730 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 235 flow [2024-11-08 17:09:09,730 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2024-11-08 17:09:09,731 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places. [2024-11-08 17:09:09,731 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 235 flow [2024-11-08 17:09:09,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:09,731 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:09:09,731 INFO L204 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] [2024-11-08 17:09:09,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:09:09,732 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-08 17:09:09,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:09,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1757206861, now seen corresponding path program 3 times [2024-11-08 17:09:09,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:09,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538630908] [2024-11-08 17:09:09,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:09,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:09:09,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:09,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538630908] [2024-11-08 17:09:09,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538630908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:09,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:09,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:09:09,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364897345] [2024-11-08 17:09:09,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:09,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:09:09,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:09,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:09:09,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:09:09,865 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 57 [2024-11-08 17:09:09,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 235 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:09,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:09:09,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 57 [2024-11-08 17:09:09,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:09:10,145 INFO L124 PetriNetUnfolderBase]: 978/1691 cut-off events. [2024-11-08 17:09:10,146 INFO L125 PetriNetUnfolderBase]: For 935/935 co-relation queries the response was YES. [2024-11-08 17:09:10,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4106 conditions, 1691 events. 978/1691 cut-off events. For 935/935 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9121 event pairs, 264 based on Foata normal form. 128/1717 useless extension candidates. Maximal degree in co-relation 3353. Up to 1023 conditions per place. [2024-11-08 17:09:10,158 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 60 selfloop transitions, 7 changer transitions 0/88 dead transitions. [2024-11-08 17:09:10,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 88 transitions, 467 flow [2024-11-08 17:09:10,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:09:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 17:09:10,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2024-11-08 17:09:10,160 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2024-11-08 17:09:10,160 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 235 flow. Second operand 5 states and 170 transitions. [2024-11-08 17:09:10,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 88 transitions, 467 flow [2024-11-08 17:09:10,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 88 transitions, 463 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 17:09:10,166 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 256 flow [2024-11-08 17:09:10,166 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=256, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2024-11-08 17:09:10,167 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 10 predicate places. [2024-11-08 17:09:10,167 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 256 flow [2024-11-08 17:09:10,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:10,167 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:09:10,167 INFO L204 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] [2024-11-08 17:09:10,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:09:10,168 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-08 17:09:10,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:10,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1624181425, now seen corresponding path program 4 times [2024-11-08 17:09:10,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:10,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094440551] [2024-11-08 17:09:10,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:10,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:10,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:09:10,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:10,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094440551] [2024-11-08 17:09:10,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094440551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:10,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:10,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:09:10,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892736416] [2024-11-08 17:09:10,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:10,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:09:10,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:10,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:09:10,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:09:10,419 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 57 [2024-11-08 17:09:10,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 256 flow. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:10,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:09:10,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 57 [2024-11-08 17:09:10,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:09:10,805 INFO L124 PetriNetUnfolderBase]: 1053/2018 cut-off events. [2024-11-08 17:09:10,805 INFO L125 PetriNetUnfolderBase]: For 1636/1644 co-relation queries the response was YES. [2024-11-08 17:09:10,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4842 conditions, 2018 events. 1053/2018 cut-off events. For 1636/1644 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11883 event pairs, 267 based on Foata normal form. 120/2032 useless extension candidates. Maximal degree in co-relation 4375. Up to 530 conditions per place. [2024-11-08 17:09:10,818 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 44 selfloop transitions, 4 changer transitions 21/87 dead transitions. [2024-11-08 17:09:10,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 87 transitions, 484 flow [2024-11-08 17:09:10,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:09:10,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 17:09:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2024-11-08 17:09:10,820 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6070175438596491 [2024-11-08 17:09:10,820 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 256 flow. Second operand 5 states and 173 transitions. [2024-11-08 17:09:10,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 87 transitions, 484 flow [2024-11-08 17:09:10,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 87 transitions, 472 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-08 17:09:10,825 INFO L231 Difference]: Finished difference. Result has 69 places, 50 transitions, 213 flow [2024-11-08 17:09:10,825 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=69, PETRI_TRANSITIONS=50} [2024-11-08 17:09:10,826 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 13 predicate places. [2024-11-08 17:09:10,826 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 50 transitions, 213 flow [2024-11-08 17:09:10,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:10,827 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:09:10,827 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:10,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:09:10,827 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-08 17:09:10,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:10,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1000776972, now seen corresponding path program 1 times [2024-11-08 17:09:10,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:10,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451237618] [2024-11-08 17:09:10,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:10,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:09:11,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:11,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451237618] [2024-11-08 17:09:11,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451237618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:09:11,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403741399] [2024-11-08 17:09:11,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:11,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:09:11,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:09:11,682 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:09:11,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 17:09:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:11,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-08 17:09:11,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:09:11,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-08 17:09:12,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:09:12,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:09:13,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2024-11-08 17:09:13,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:09:13,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 68 [2024-11-08 17:09:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:09:13,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403741399] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:09:13,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:09:13,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 30 [2024-11-08 17:09:13,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648409855] [2024-11-08 17:09:13,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:09:13,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-08 17:09:13,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:13,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-08 17:09:13,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2024-11-08 17:09:14,381 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 57 [2024-11-08 17:09:14,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 50 transitions, 213 flow. Second operand has 31 states, 31 states have (on average 14.838709677419354) internal successors, (460), 31 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:14,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:09:14,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 57 [2024-11-08 17:09:14,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:09:19,527 INFO L124 PetriNetUnfolderBase]: 5812/9325 cut-off events. [2024-11-08 17:09:19,528 INFO L125 PetriNetUnfolderBase]: For 11127/11127 co-relation queries the response was YES. [2024-11-08 17:09:19,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25238 conditions, 9325 events. 5812/9325 cut-off events. For 11127/11127 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 57215 event pairs, 438 based on Foata normal form. 920/9815 useless extension candidates. Maximal degree in co-relation 14229. Up to 2017 conditions per place. [2024-11-08 17:09:19,582 INFO L140 encePairwiseOnDemand]: 36/57 looper letters, 336 selfloop transitions, 106 changer transitions 34/482 dead transitions. [2024-11-08 17:09:19,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 482 transitions, 2706 flow [2024-11-08 17:09:19,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-08 17:09:19,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2024-11-08 17:09:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 1092 transitions. [2024-11-08 17:09:19,586 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37564499484004127 [2024-11-08 17:09:19,587 INFO L175 Difference]: Start difference. First operand has 69 places, 50 transitions, 213 flow. Second operand 51 states and 1092 transitions. [2024-11-08 17:09:19,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 482 transitions, 2706 flow [2024-11-08 17:09:19,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 482 transitions, 2537 flow, removed 28 selfloop flow, removed 11 redundant places. [2024-11-08 17:09:19,604 INFO L231 Difference]: Finished difference. Result has 134 places, 164 transitions, 1135 flow [2024-11-08 17:09:19,604 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=1135, PETRI_PLACES=134, PETRI_TRANSITIONS=164} [2024-11-08 17:09:19,605 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 78 predicate places. [2024-11-08 17:09:19,605 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 164 transitions, 1135 flow [2024-11-08 17:09:19,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 14.838709677419354) internal successors, (460), 31 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:19,606 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:09:19,606 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:19,632 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 17:09:19,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:09:19,811 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-08 17:09:19,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:19,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1912145997, now seen corresponding path program 1 times [2024-11-08 17:09:19,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:19,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567403727] [2024-11-08 17:09:19,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:19,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 17:09:19,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:19,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567403727] [2024-11-08 17:09:19,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567403727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:19,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:19,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:09:19,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476952334] [2024-11-08 17:09:19,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:19,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:09:19,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:19,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:09:19,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:09:19,939 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 57 [2024-11-08 17:09:19,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 164 transitions, 1135 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:19,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:09:19,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 57 [2024-11-08 17:09:19,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:09:20,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L52-->L56: Formula: (let ((.cse1 (* v_~front~0_72 4))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_77))) (and (= (select |v_#valid_128| v_~queue~0.base_86) 1) (= v_~sum~0_41 (+ v_~sum~0_42 (select (select |v_#memory_int#1_42| v_~queue~0.base_86) .cse0))) (= (+ v_~front~0_72 1) v_~front~0_71) (<= (+ 4 .cse1 v_~queue~0.offset_77) (select |v_#length_111| v_~queue~0.base_86)) (<= 0 .cse0) (not (= (ite (and (< v_~front~0_72 v_~back~0_117) (< v_~front~0_72 v_~n~0_64) (<= 0 v_~front~0_72)) 1 0) 0))))) InVars {~sum~0=v_~sum~0_42, ~queue~0.offset=v_~queue~0.offset_77, #valid=|v_#valid_128|, ~back~0=v_~back~0_117, #length=|v_#length_111|, ~queue~0.base=v_~queue~0.base_86, ~n~0=v_~n~0_64, #memory_int#1=|v_#memory_int#1_42|, ~front~0=v_~front~0_72} OutVars{~queue~0.offset=v_~queue~0.offset_77, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_1|, ~back~0=v_~back~0_117, ~queue~0.base=v_~queue~0.base_86, #memory_int#1=|v_#memory_int#1_42|, ~sum~0=v_~sum~0_41, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #valid=|v_#valid_128|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #length=|v_#length_111|, ~n~0=v_~n~0_64, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~front~0=v_~front~0_71} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0][152], [32#L113true, Black: 75#(<= ~back~0 ~front~0), Black: 523#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0)))), Black: 451#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (or (not (= (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< ~back~0 0) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (and (<= 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~sum~0)) (<= (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~sum~0) 1)) (< ~front~0 0))), Black: 493#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 479#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (<= 0 ~front~0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1) (<= (+ ~front~0 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)), Black: 459#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~b~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1)), Black: 473#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 517#(and (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 183#true, Black: 83#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 513#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (or (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 151#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1)), Black: 489#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~sum~0 1) (or (not (= (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (and (<= (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0) (<= 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))) (< ~front~0 0)) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (or (and (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 495#(and (<= (+ ~back~0 1) ~n~0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (<= 0 ~front~0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1) (= (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)), 48#L70-2true, Black: 505#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), 429#(or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))), Black: 469#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 439#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 336#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 511#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 463#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~b~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1)), Black: 157#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 159#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 1)), Black: 465#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 443#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), 37#L56true, Black: 499#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 497#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ ~front~0 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)), Black: 503#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (or (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 475#(and (= ~v_assert~0 1) (= ~sum~0 0) (<= 0 ~front~0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1) (<= (+ ~front~0 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)), 80#(= (select |#valid| ~queue~0.base) 1), 41#thread3EXITtrue, Black: 449#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 507#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (or (and (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 166#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 509#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (or (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 521#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (or (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), 556#true, Black: 178#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= ~sum~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1))]) [2024-11-08 17:09:20,421 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-11-08 17:09:20,421 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-11-08 17:09:20,421 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-11-08 17:09:20,421 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-08 17:09:20,422 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L52-->L56: Formula: (let ((.cse1 (* v_~front~0_72 4))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_77))) (and (= (select |v_#valid_128| v_~queue~0.base_86) 1) (= v_~sum~0_41 (+ v_~sum~0_42 (select (select |v_#memory_int#1_42| v_~queue~0.base_86) .cse0))) (= (+ v_~front~0_72 1) v_~front~0_71) (<= (+ 4 .cse1 v_~queue~0.offset_77) (select |v_#length_111| v_~queue~0.base_86)) (<= 0 .cse0) (not (= (ite (and (< v_~front~0_72 v_~back~0_117) (< v_~front~0_72 v_~n~0_64) (<= 0 v_~front~0_72)) 1 0) 0))))) InVars {~sum~0=v_~sum~0_42, ~queue~0.offset=v_~queue~0.offset_77, #valid=|v_#valid_128|, ~back~0=v_~back~0_117, #length=|v_#length_111|, ~queue~0.base=v_~queue~0.base_86, ~n~0=v_~n~0_64, #memory_int#1=|v_#memory_int#1_42|, ~front~0=v_~front~0_72} OutVars{~queue~0.offset=v_~queue~0.offset_77, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_1|, ~back~0=v_~back~0_117, ~queue~0.base=v_~queue~0.base_86, #memory_int#1=|v_#memory_int#1_42|, ~sum~0=v_~sum~0_41, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #valid=|v_#valid_128|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #length=|v_#length_111|, ~n~0=v_~n~0_64, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~front~0=v_~front~0_71} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0][158], [523#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0)))), 32#L113true, Black: 75#(<= ~back~0 ~front~0), Black: 451#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (or (not (= (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< ~back~0 0) (< |ULTIMATE.start_create_fresh_int_array_~i~0#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (and (<= 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~sum~0)) (<= (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~sum~0) 1)) (< ~front~0 0))), Black: 493#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 479#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (<= 0 ~front~0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1) (<= (+ ~front~0 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)), Black: 459#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~b~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1)), Black: 473#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 517#(and (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 183#true, Black: 83#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 513#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (or (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 151#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1)), Black: 489#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~sum~0 1) (or (not (= (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (and (<= (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0) (<= 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))) (< ~front~0 0)) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (or (and (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 495#(and (<= (+ ~back~0 1) ~n~0) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (<= 0 ~front~0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1) (= (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)), 19#L70true, Black: 505#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 429#(or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))), Black: 469#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0)) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 439#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 336#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 511#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 463#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~b~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1)), Black: 157#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 465#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 159#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 1)), Black: 443#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), 37#L56true, Black: 499#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 497#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1) (<= 0 ~back~0) (<= (+ ~front~0 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)), Black: 503#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (or (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 475#(and (= ~v_assert~0 1) (= ~sum~0 0) (<= 0 ~front~0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= ~n~0 1) (<= (+ ~front~0 1) ~n~0) (= (select (select |#memory_int#1| ~queue~0.base) (* ~front~0 4)) 1)), 80#(= (select |#valid| ~queue~0.base) 1), 41#thread3EXITtrue, Black: 449#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 507#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (or (and (<= (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0))), Black: 166#(and (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 509#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (or (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), Black: 521#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (< ~n~0 (+ ~front~0 1)) (< ~front~0 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (or (and (<= 0 (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~front~0 1)) (= (mod |thread2Thread1of1ForFork1_~b~0#1| 256) 0) (< ~front~0 0))), 556#true, Black: 178#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (= ~sum~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1))]) [2024-11-08 17:09:20,422 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-11-08 17:09:20,422 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-11-08 17:09:20,422 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-11-08 17:09:20,422 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-08 17:09:20,435 INFO L124 PetriNetUnfolderBase]: 1570/3013 cut-off events. [2024-11-08 17:09:20,436 INFO L125 PetriNetUnfolderBase]: For 16459/16601 co-relation queries the response was YES. [2024-11-08 17:09:20,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11536 conditions, 3013 events. 1570/3013 cut-off events. For 16459/16601 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 18778 event pairs, 650 based on Foata normal form. 22/2833 useless extension candidates. Maximal degree in co-relation 9924. Up to 1931 conditions per place. [2024-11-08 17:09:20,465 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 122 selfloop transitions, 4 changer transitions 0/176 dead transitions. [2024-11-08 17:09:20,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 176 transitions, 1476 flow [2024-11-08 17:09:20,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:09:20,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 17:09:20,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-11-08 17:09:20,467 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6549707602339181 [2024-11-08 17:09:20,467 INFO L175 Difference]: Start difference. First operand has 134 places, 164 transitions, 1135 flow. Second operand 3 states and 112 transitions. [2024-11-08 17:09:20,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 176 transitions, 1476 flow [2024-11-08 17:09:20,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 176 transitions, 1281 flow, removed 80 selfloop flow, removed 7 redundant places. [2024-11-08 17:09:20,565 INFO L231 Difference]: Finished difference. Result has 130 places, 159 transitions, 950 flow [2024-11-08 17:09:20,565 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=950, PETRI_PLACES=130, PETRI_TRANSITIONS=159} [2024-11-08 17:09:20,566 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 74 predicate places. [2024-11-08 17:09:20,566 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 159 transitions, 950 flow [2024-11-08 17:09:20,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:20,567 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:09:20,567 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:20,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:09:20,567 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-08 17:09:20,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:20,568 INFO L85 PathProgramCache]: Analyzing trace with hash 213226235, now seen corresponding path program 2 times [2024-11-08 17:09:20,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:20,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335539822] [2024-11-08 17:09:20,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:20,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 17:09:20,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:20,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335539822] [2024-11-08 17:09:20,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335539822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:20,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:20,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:09:20,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258125250] [2024-11-08 17:09:20,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:20,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:09:20,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:20,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:09:20,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:09:20,712 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 57 [2024-11-08 17:09:20,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 159 transitions, 950 flow. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:20,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:09:20,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 57 [2024-11-08 17:09:20,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:09:21,521 INFO L124 PetriNetUnfolderBase]: 1881/3914 cut-off events. [2024-11-08 17:09:21,521 INFO L125 PetriNetUnfolderBase]: For 20067/20258 co-relation queries the response was YES. [2024-11-08 17:09:21,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14440 conditions, 3914 events. 1881/3914 cut-off events. For 20067/20258 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 27216 event pairs, 457 based on Foata normal form. 189/3848 useless extension candidates. Maximal degree in co-relation 9065. Up to 1411 conditions per place. [2024-11-08 17:09:21,668 INFO L140 encePairwiseOnDemand]: 53/57 looper letters, 109 selfloop transitions, 43 changer transitions 0/217 dead transitions. [2024-11-08 17:09:21,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 217 transitions, 1579 flow [2024-11-08 17:09:21,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:09:21,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 17:09:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2024-11-08 17:09:21,669 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6973684210526315 [2024-11-08 17:09:21,670 INFO L175 Difference]: Start difference. First operand has 130 places, 159 transitions, 950 flow. Second operand 4 states and 159 transitions. [2024-11-08 17:09:21,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 217 transitions, 1579 flow [2024-11-08 17:09:21,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 217 transitions, 1575 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 17:09:21,705 INFO L231 Difference]: Finished difference. Result has 134 places, 195 transitions, 1429 flow [2024-11-08 17:09:21,706 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1429, PETRI_PLACES=134, PETRI_TRANSITIONS=195} [2024-11-08 17:09:21,706 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 78 predicate places. [2024-11-08 17:09:21,706 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 195 transitions, 1429 flow [2024-11-08 17:09:21,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:21,707 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:09:21,707 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:21,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 17:09:21,707 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-08 17:09:21,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:21,708 INFO L85 PathProgramCache]: Analyzing trace with hash -438762603, now seen corresponding path program 3 times [2024-11-08 17:09:21,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:21,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678283641] [2024-11-08 17:09:21,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:21,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:09:23,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:23,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678283641] [2024-11-08 17:09:23,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678283641] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:09:23,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515833876] [2024-11-08 17:09:23,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 17:09:23,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:09:23,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:09:23,444 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:09:23,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 17:09:23,610 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-08 17:09:23,611 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 17:09:23,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 17:09:23,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:09:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 17:09:23,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:09:24,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:09:24,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 24 [2024-11-08 17:09:24,219 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 17:09:24,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515833876] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:09:24,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:09:24,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6, 6] total 23 [2024-11-08 17:09:24,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566755792] [2024-11-08 17:09:24,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:09:24,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 17:09:24,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:24,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 17:09:24,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2024-11-08 17:09:24,462 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2024-11-08 17:09:24,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 195 transitions, 1429 flow. Second operand has 24 states, 24 states have (on average 18.625) internal successors, (447), 24 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:24,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:09:24,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2024-11-08 17:09:24,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:09:26,901 INFO L124 PetriNetUnfolderBase]: 6711/12168 cut-off events. [2024-11-08 17:09:26,901 INFO L125 PetriNetUnfolderBase]: For 80223/80309 co-relation queries the response was YES. [2024-11-08 17:09:26,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48031 conditions, 12168 events. 6711/12168 cut-off events. For 80223/80309 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 86631 event pairs, 191 based on Foata normal form. 538/12644 useless extension candidates. Maximal degree in co-relation 34294. Up to 2132 conditions per place. [2024-11-08 17:09:27,021 INFO L140 encePairwiseOnDemand]: 43/57 looper letters, 260 selfloop transitions, 76 changer transitions 63/421 dead transitions. [2024-11-08 17:09:27,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 421 transitions, 4146 flow [2024-11-08 17:09:27,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:09:27,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-11-08 17:09:27,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 407 transitions. [2024-11-08 17:09:27,024 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4200206398348813 [2024-11-08 17:09:27,025 INFO L175 Difference]: Start difference. First operand has 134 places, 195 transitions, 1429 flow. Second operand 17 states and 407 transitions. [2024-11-08 17:09:27,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 421 transitions, 4146 flow [2024-11-08 17:09:27,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 421 transitions, 4008 flow, removed 69 selfloop flow, removed 0 redundant places. [2024-11-08 17:09:27,243 INFO L231 Difference]: Finished difference. Result has 154 places, 219 transitions, 1884 flow [2024-11-08 17:09:27,244 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1395, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1884, PETRI_PLACES=154, PETRI_TRANSITIONS=219} [2024-11-08 17:09:27,245 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 98 predicate places. [2024-11-08 17:09:27,245 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 219 transitions, 1884 flow [2024-11-08 17:09:27,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 18.625) internal successors, (447), 24 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:27,245 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:09:27,246 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:27,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 17:09:27,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:09:27,447 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-08 17:09:27,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:27,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1818760453, now seen corresponding path program 4 times [2024-11-08 17:09:27,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:27,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682837033] [2024-11-08 17:09:27,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:27,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:27,761 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 17:09:27,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:27,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682837033] [2024-11-08 17:09:27,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682837033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:27,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:27,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:09:27,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427841674] [2024-11-08 17:09:27,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:27,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:09:27,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:27,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:09:27,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:09:27,767 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 57 [2024-11-08 17:09:27,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 219 transitions, 1884 flow. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:27,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:09:27,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 57 [2024-11-08 17:09:27,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:09:29,174 INFO L124 PetriNetUnfolderBase]: 3855/7623 cut-off events. [2024-11-08 17:09:29,174 INFO L125 PetriNetUnfolderBase]: For 54146/54924 co-relation queries the response was YES. [2024-11-08 17:09:29,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32956 conditions, 7623 events. 3855/7623 cut-off events. For 54146/54924 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 55374 event pairs, 564 based on Foata normal form. 560/7891 useless extension candidates. Maximal degree in co-relation 29274. Up to 2943 conditions per place. [2024-11-08 17:09:29,238 INFO L140 encePairwiseOnDemand]: 53/57 looper letters, 159 selfloop transitions, 6 changer transitions 3/216 dead transitions. [2024-11-08 17:09:29,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 216 transitions, 2302 flow [2024-11-08 17:09:29,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:09:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 17:09:29,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2024-11-08 17:09:29,240 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.618421052631579 [2024-11-08 17:09:29,240 INFO L175 Difference]: Start difference. First operand has 154 places, 219 transitions, 1884 flow. Second operand 4 states and 141 transitions. [2024-11-08 17:09:29,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 216 transitions, 2302 flow [2024-11-08 17:09:29,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 216 transitions, 2178 flow, removed 25 selfloop flow, removed 15 redundant places. [2024-11-08 17:09:29,356 INFO L231 Difference]: Finished difference. Result has 135 places, 174 transitions, 1483 flow [2024-11-08 17:09:29,357 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1483, PETRI_PLACES=135, PETRI_TRANSITIONS=174} [2024-11-08 17:09:29,358 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 79 predicate places. [2024-11-08 17:09:29,358 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 174 transitions, 1483 flow [2024-11-08 17:09:29,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:29,358 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:09:29,359 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:29,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 17:09:29,359 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-08 17:09:29,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:29,359 INFO L85 PathProgramCache]: Analyzing trace with hash -485896443, now seen corresponding path program 1 times [2024-11-08 17:09:29,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:29,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508498761] [2024-11-08 17:09:29,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:29,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:09:31,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:31,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508498761] [2024-11-08 17:09:31,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508498761] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:09:31,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115700627] [2024-11-08 17:09:31,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:31,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:09:31,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:09:31,059 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:09:31,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 17:09:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:31,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-08 17:09:31,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:09:32,280 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2024-11-08 17:09:32,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 20 [2024-11-08 17:09:32,399 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:09:32,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:09:33,091 INFO L349 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2024-11-08 17:09:33,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 52 [2024-11-08 17:09:34,564 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:09:34,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115700627] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:09:34,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:09:34,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 37 [2024-11-08 17:09:34,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590851661] [2024-11-08 17:09:34,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:09:34,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-08 17:09:34,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:34,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-08 17:09:34,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1232, Unknown=0, NotChecked=0, Total=1406 [2024-11-08 17:09:35,074 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 57 [2024-11-08 17:09:35,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 174 transitions, 1483 flow. Second operand has 38 states, 38 states have (on average 15.236842105263158) internal successors, (579), 38 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:09:35,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:09:35,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 57 [2024-11-08 17:09:35,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 17:10:20,379 INFO L124 PetriNetUnfolderBase]: 82166/132590 cut-off events. [2024-11-08 17:10:20,380 INFO L125 PetriNetUnfolderBase]: For 957025/958513 co-relation queries the response was YES. [2024-11-08 17:10:20,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554833 conditions, 132590 events. 82166/132590 cut-off events. For 957025/958513 co-relation queries the response was YES. Maximal size of possible extension queue 2661. Compared 1096197 event pairs, 4443 based on Foata normal form. 8366/140844 useless extension candidates. Maximal degree in co-relation 328536. Up to 23365 conditions per place. [2024-11-08 17:10:21,618 INFO L140 encePairwiseOnDemand]: 36/57 looper letters, 2008 selfloop transitions, 848 changer transitions 657/3519 dead transitions. [2024-11-08 17:10:21,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 3519 transitions, 34564 flow [2024-11-08 17:10:21,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2024-11-08 17:10:21,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2024-11-08 17:10:21,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 4789 transitions. [2024-11-08 17:10:21,633 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4264849942114169 [2024-11-08 17:10:21,633 INFO L175 Difference]: Start difference. First operand has 135 places, 174 transitions, 1483 flow. Second operand 197 states and 4789 transitions. [2024-11-08 17:10:21,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 3519 transitions, 34564 flow [2024-11-08 17:10:23,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 3519 transitions, 34380 flow, removed 88 selfloop flow, removed 1 redundant places. [2024-11-08 17:10:23,085 INFO L231 Difference]: Finished difference. Result has 395 places, 1064 transitions, 13306 flow [2024-11-08 17:10:23,085 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=197, PETRI_FLOW=13306, PETRI_PLACES=395, PETRI_TRANSITIONS=1064} [2024-11-08 17:10:23,086 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 339 predicate places. [2024-11-08 17:10:23,086 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 1064 transitions, 13306 flow [2024-11-08 17:10:23,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 15.236842105263158) internal successors, (579), 38 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:10:23,087 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 17:10:23,087 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:10:23,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 17:10:23,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:10:23,288 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-11-08 17:10:23,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:10:23,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1263980421, now seen corresponding path program 2 times [2024-11-08 17:10:23,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:10:23,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555934951] [2024-11-08 17:10:23,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:10:23,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:10:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:10:24,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:10:24,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555934951] [2024-11-08 17:10:24,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555934951] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:10:24,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344112416] [2024-11-08 17:10:24,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 17:10:24,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:10:24,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:10:24,799 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:10:24,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89edb8a6-85bd-487d-9f8b-f4ddbb9c75a2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 17:10:24,895 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 17:10:24,896 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 17:10:24,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-08 17:10:24,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:10:25,625 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:10:25,625 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:10:26,350 INFO L349 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2024-11-08 17:10:26,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 50 [2024-11-08 17:10:27,103 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:10:27,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344112416] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:10:27,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:10:27,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2024-11-08 17:10:27,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710006056] [2024-11-08 17:10:27,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:10:27,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-08 17:10:27,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:10:27,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-08 17:10:27,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1310, Unknown=0, NotChecked=0, Total=1560 [2024-11-08 17:10:27,362 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-11-08 17:10:27,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 1064 transitions, 13306 flow. Second operand has 40 states, 40 states have (on average 15.875) internal successors, (635), 40 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:10:27,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 17:10:27,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-11-08 17:10:27,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand