./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr-oob.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr-oob.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 5daf9d459a591738ce4ac52eada4b738511fbb9d800cd03182e33bae5ebd943b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:53:16,862 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:53:16,924 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:53:16,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:53:16,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:53:16,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:53:16,962 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:53:16,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:53:16,963 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:53:16,963 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:53:16,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:53:16,964 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:53:16,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:53:16,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:53:16,965 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:53:16,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:53:16,966 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:53:16,966 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:53:16,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:53:16,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:53:16,967 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:53:16,967 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:53:16,968 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:53:16,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:53:16,968 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:53:16,969 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:53:16,969 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:53:16,969 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:53:16,970 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:53:16,970 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:53:16,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:53:16,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:53:16,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:53:16,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:53:16,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:53:16,972 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:53:16,972 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:53:16,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:53:16,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:53:16,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:53:16,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:53:16,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:53:16,975 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 5daf9d459a591738ce4ac52eada4b738511fbb9d800cd03182e33bae5ebd943b [2024-11-19 09:53:17,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:53:17,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:53:17,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:53:17,292 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:53:17,292 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:53:17,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr-oob.c [2024-11-19 09:53:18,662 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:53:18,867 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:53:18,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr-oob.c [2024-11-19 09:53:18,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d0c6763b/7e8149bfe1894af0a46f958f52195c24/FLAG2439518b1 [2024-11-19 09:53:18,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d0c6763b/7e8149bfe1894af0a46f958f52195c24 [2024-11-19 09:53:18,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:53:18,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:53:18,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:53:18,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:53:18,904 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:53:18,905 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:53:18" (1/1) ... [2024-11-19 09:53:18,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4667b318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:18, skipping insertion in model container [2024-11-19 09:53:18,906 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:53:18" (1/1) ... [2024-11-19 09:53:18,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:53:19,119 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:53:19,127 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:53:19,129 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:53:19,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:53:19,143 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:53:19,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:53:19,198 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:53:19,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:19 WrapperNode [2024-11-19 09:53:19,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:53:19,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:53:19,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:53:19,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:53:19,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:19" (1/1) ... [2024-11-19 09:53:19,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:19" (1/1) ... [2024-11-19 09:53:19,274 INFO L138 Inliner]: procedures = 27, calls = 66, calls flagged for inlining = 27, calls inlined = 33, statements flattened = 399 [2024-11-19 09:53:19,275 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:53:19,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:53:19,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:53:19,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:53:19,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:19" (1/1) ... [2024-11-19 09:53:19,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:19" (1/1) ... [2024-11-19 09:53:19,309 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:19" (1/1) ... [2024-11-19 09:53:19,365 INFO L175 MemorySlicer]: Split 24 memory accesses to 4 slices as follows [2, 3, 3, 16]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 6 writes are split as follows [0, 1, 1, 4]. [2024-11-19 09:53:19,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:19" (1/1) ... [2024-11-19 09:53:19,369 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:19" (1/1) ... [2024-11-19 09:53:19,392 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:19" (1/1) ... [2024-11-19 09:53:19,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:19" (1/1) ... [2024-11-19 09:53:19,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:19" (1/1) ... [2024-11-19 09:53:19,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:19" (1/1) ... [2024-11-19 09:53:19,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:53:19,423 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:53:19,423 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:53:19,423 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:53:19,424 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:19" (1/1) ... [2024-11-19 09:53:19,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:53:19,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:19,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:53:19,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:53:19,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:53:19,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:53:19,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:53:19,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 09:53:19,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-19 09:53:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 09:53:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 09:53:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 09:53:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 09:53:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 09:53:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 09:53:19,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 09:53:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 09:53:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:53:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:53:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 09:53:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-19 09:53:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 09:53:19,520 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 09:53:19,520 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 09:53:19,520 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 09:53:19,520 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 09:53:19,520 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 09:53:19,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:53:19,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 09:53:19,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 09:53:19,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 09:53:19,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 09:53:19,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 09:53:19,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:53:19,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:53:19,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:53:19,524 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:53:19,702 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:53:19,705 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:53:20,360 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:53:20,361 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:53:20,912 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:53:20,913 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-19 09:53:20,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:53:20 BoogieIcfgContainer [2024-11-19 09:53:20,913 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:53:20,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:53:20,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:53:20,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:53:20,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:53:18" (1/3) ... [2024-11-19 09:53:20,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52160104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:53:20, skipping insertion in model container [2024-11-19 09:53:20,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:19" (2/3) ... [2024-11-19 09:53:20,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52160104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:53:20, skipping insertion in model container [2024-11-19 09:53:20,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:53:20" (3/3) ... [2024-11-19 09:53:20,922 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons-eq.wvr-oob.c [2024-11-19 09:53:20,940 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:53:20,940 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2024-11-19 09:53:20,940 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:53:21,043 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 09:53:21,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 106 transitions, 233 flow [2024-11-19 09:53:21,131 INFO L124 PetriNetUnfolderBase]: 10/103 cut-off events. [2024-11-19 09:53:21,131 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 09:53:21,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 10/103 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 309 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2024-11-19 09:53:21,136 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 106 transitions, 233 flow [2024-11-19 09:53:21,140 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 102 transitions, 222 flow [2024-11-19 09:53:21,151 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:53:21,158 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;@2148b0bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:53:21,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 81 error locations. [2024-11-19 09:53:21,162 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:53:21,162 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-19 09:53:21,162 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:53:21,162 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:21,163 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:53:21,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:53:21,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:21,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1291537, now seen corresponding path program 1 times [2024-11-19 09:53:21,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:21,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264502308] [2024-11-19 09:53:21,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:21,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:21,443 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-19 09:53:21,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:21,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264502308] [2024-11-19 09:53:21,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264502308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:53:21,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:53:21,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:53:21,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573964086] [2024-11-19 09:53:21,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:21,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:53:21,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:21,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:53:21,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:53:21,538 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 106 [2024-11-19 09:53:21,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 102 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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-19 09:53:21,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:21,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 106 [2024-11-19 09:53:21,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:23,313 INFO L124 PetriNetUnfolderBase]: 5748/11621 cut-off events. [2024-11-19 09:53:23,313 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2024-11-19 09:53:23,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19700 conditions, 11621 events. 5748/11621 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 115081 event pairs, 4141 based on Foata normal form. 1/6125 useless extension candidates. Maximal degree in co-relation 19012. Up to 7739 conditions per place. [2024-11-19 09:53:23,418 INFO L140 encePairwiseOnDemand]: 93/106 looper letters, 52 selfloop transitions, 4 changer transitions 0/92 dead transitions. [2024-11-19 09:53:23,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 92 transitions, 314 flow [2024-11-19 09:53:23,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:53:23,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:53:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2024-11-19 09:53:23,430 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5817610062893082 [2024-11-19 09:53:23,432 INFO L175 Difference]: Start difference. First operand has 102 places, 102 transitions, 222 flow. Second operand 3 states and 185 transitions. [2024-11-19 09:53:23,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 92 transitions, 314 flow [2024-11-19 09:53:23,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 92 transitions, 302 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 09:53:23,453 INFO L231 Difference]: Finished difference. Result has 88 places, 92 transitions, 198 flow [2024-11-19 09:53:23,455 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=88, PETRI_TRANSITIONS=92} [2024-11-19 09:53:23,460 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, -14 predicate places. [2024-11-19 09:53:23,460 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 92 transitions, 198 flow [2024-11-19 09:53:23,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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-19 09:53:23,461 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:23,461 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:53:23,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:53:23,462 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:53:23,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:23,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1291538, now seen corresponding path program 1 times [2024-11-19 09:53:23,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:23,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000454972] [2024-11-19 09:53:23,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:23,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:23,770 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-19 09:53:23,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:23,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000454972] [2024-11-19 09:53:23,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000454972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:53:23,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:53:23,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:53:23,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412223878] [2024-11-19 09:53:23,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:23,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:53:23,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:23,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:53:23,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:53:23,851 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 106 [2024-11-19 09:53:23,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 92 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 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-19 09:53:23,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:23,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 106 [2024-11-19 09:53:23,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:25,244 INFO L124 PetriNetUnfolderBase]: 5749/11624 cut-off events. [2024-11-19 09:53:25,245 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-19 09:53:25,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19509 conditions, 11624 events. 5749/11624 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 115027 event pairs, 4141 based on Foata normal form. 0/6125 useless extension candidates. Maximal degree in co-relation 19456. Up to 7756 conditions per place. [2024-11-19 09:53:25,323 INFO L140 encePairwiseOnDemand]: 101/106 looper letters, 59 selfloop transitions, 4 changer transitions 0/95 dead transitions. [2024-11-19 09:53:25,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 95 transitions, 330 flow [2024-11-19 09:53:25,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:53:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:53:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2024-11-19 09:53:25,330 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5283018867924528 [2024-11-19 09:53:25,331 INFO L175 Difference]: Start difference. First operand has 88 places, 92 transitions, 198 flow. Second operand 4 states and 224 transitions. [2024-11-19 09:53:25,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 95 transitions, 330 flow [2024-11-19 09:53:25,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 95 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:53:25,336 INFO L231 Difference]: Finished difference. Result has 91 places, 95 transitions, 217 flow [2024-11-19 09:53:25,336 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=91, PETRI_TRANSITIONS=95} [2024-11-19 09:53:25,337 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, -11 predicate places. [2024-11-19 09:53:25,338 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 95 transitions, 217 flow [2024-11-19 09:53:25,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 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-19 09:53:25,339 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:25,339 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-19 09:53:25,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:53:25,340 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:53:25,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:25,342 INFO L85 PathProgramCache]: Analyzing trace with hash 40039105, now seen corresponding path program 1 times [2024-11-19 09:53:25,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:25,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959746260] [2024-11-19 09:53:25,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:25,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:25,576 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-19 09:53:25,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:25,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959746260] [2024-11-19 09:53:25,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959746260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:53:25,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:53:25,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:53:25,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893444640] [2024-11-19 09:53:25,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:25,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:53:25,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:25,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:53:25,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:53:25,703 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 106 [2024-11-19 09:53:25,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 95 transitions, 217 flow. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:53:25,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:25,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 106 [2024-11-19 09:53:25,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:27,026 INFO L124 PetriNetUnfolderBase]: 5750/11627 cut-off events. [2024-11-19 09:53:27,027 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-19 09:53:27,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19524 conditions, 11627 events. 5750/11627 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 114932 event pairs, 4141 based on Foata normal form. 0/6125 useless extension candidates. Maximal degree in co-relation 19499. Up to 7755 conditions per place. [2024-11-19 09:53:27,108 INFO L140 encePairwiseOnDemand]: 98/106 looper letters, 59 selfloop transitions, 7 changer transitions 0/98 dead transitions. [2024-11-19 09:53:27,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 98 transitions, 355 flow [2024-11-19 09:53:27,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:53:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:53:27,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 267 transitions. [2024-11-19 09:53:27,111 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5037735849056604 [2024-11-19 09:53:27,111 INFO L175 Difference]: Start difference. First operand has 91 places, 95 transitions, 217 flow. Second operand 5 states and 267 transitions. [2024-11-19 09:53:27,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 98 transitions, 355 flow [2024-11-19 09:53:27,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 98 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:53:27,114 INFO L231 Difference]: Finished difference. Result has 96 places, 98 transitions, 251 flow [2024-11-19 09:53:27,114 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=96, PETRI_TRANSITIONS=98} [2024-11-19 09:53:27,115 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, -6 predicate places. [2024-11-19 09:53:27,115 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 98 transitions, 251 flow [2024-11-19 09:53:27,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:53:27,116 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:27,116 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-19 09:53:27,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:53:27,116 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:53:27,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:27,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1241212178, now seen corresponding path program 1 times [2024-11-19 09:53:27,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:27,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028590042] [2024-11-19 09:53:27,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:27,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:27,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:27,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:27,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028590042] [2024-11-19 09:53:27,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028590042] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:27,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38482292] [2024-11-19 09:53:27,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:27,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:27,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:27,426 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:27,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 09:53:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:27,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:53:27,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:27,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-19 09:53:27,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:27,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:27,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:27,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38482292] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:53:27,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:53:27,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-11-19 09:53:27,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215458468] [2024-11-19 09:53:27,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:53:27,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:53:27,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:27,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:53:27,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:53:28,298 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 106 [2024-11-19 09:53:28,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 98 transitions, 251 flow. Second operand has 11 states, 11 states have (on average 41.36363636363637) internal successors, (455), 11 states have internal predecessors, (455), 0 states have call successors, (0), 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-19 09:53:28,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:28,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 106 [2024-11-19 09:53:28,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:29,667 INFO L124 PetriNetUnfolderBase]: 5750/11626 cut-off events. [2024-11-19 09:53:29,667 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-11-19 09:53:29,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19537 conditions, 11626 events. 5750/11626 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 115057 event pairs, 4141 based on Foata normal form. 0/6127 useless extension candidates. Maximal degree in co-relation 19509. Up to 7755 conditions per place. [2024-11-19 09:53:29,747 INFO L140 encePairwiseOnDemand]: 101/106 looper letters, 58 selfloop transitions, 7 changer transitions 0/97 dead transitions. [2024-11-19 09:53:29,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 377 flow [2024-11-19 09:53:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:53:29,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:53:29,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 303 transitions. [2024-11-19 09:53:29,749 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47641509433962265 [2024-11-19 09:53:29,750 INFO L175 Difference]: Start difference. First operand has 96 places, 98 transitions, 251 flow. Second operand 6 states and 303 transitions. [2024-11-19 09:53:29,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 377 flow [2024-11-19 09:53:29,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 97 transitions, 376 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:53:29,752 INFO L231 Difference]: Finished difference. Result has 99 places, 97 transitions, 260 flow [2024-11-19 09:53:29,753 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=260, PETRI_PLACES=99, PETRI_TRANSITIONS=97} [2024-11-19 09:53:29,753 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, -3 predicate places. [2024-11-19 09:53:29,754 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 97 transitions, 260 flow [2024-11-19 09:53:29,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 41.36363636363637) internal successors, (455), 11 states have internal predecessors, (455), 0 states have call successors, (0), 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-19 09:53:29,754 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:29,754 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 09:53:29,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 09:53:29,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:29,959 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:53:29,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:29,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1241214871, now seen corresponding path program 1 times [2024-11-19 09:53:29,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:29,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641781192] [2024-11-19 09:53:29,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:29,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:30,136 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-19 09:53:30,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:30,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641781192] [2024-11-19 09:53:30,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641781192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:53:30,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:53:30,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:53:30,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516865581] [2024-11-19 09:53:30,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:30,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:53:30,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:30,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:53:30,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:53:30,251 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 106 [2024-11-19 09:53:30,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 97 transitions, 260 flow. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 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-19 09:53:30,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:30,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 106 [2024-11-19 09:53:30,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:31,574 INFO L124 PetriNetUnfolderBase]: 5751/11629 cut-off events. [2024-11-19 09:53:31,575 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-11-19 09:53:31,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19550 conditions, 11629 events. 5751/11629 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 114976 event pairs, 4141 based on Foata normal form. 0/6129 useless extension candidates. Maximal degree in co-relation 19517. Up to 7757 conditions per place. [2024-11-19 09:53:31,638 INFO L140 encePairwiseOnDemand]: 97/106 looper letters, 59 selfloop transitions, 9 changer transitions 0/100 dead transitions. [2024-11-19 09:53:31,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 100 transitions, 402 flow [2024-11-19 09:53:31,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:53:31,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:53:31,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 266 transitions. [2024-11-19 09:53:31,640 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5018867924528302 [2024-11-19 09:53:31,640 INFO L175 Difference]: Start difference. First operand has 99 places, 97 transitions, 260 flow. Second operand 5 states and 266 transitions. [2024-11-19 09:53:31,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 100 transitions, 402 flow [2024-11-19 09:53:31,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 100 transitions, 368 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-11-19 09:53:31,643 INFO L231 Difference]: Finished difference. Result has 97 places, 100 transitions, 269 flow [2024-11-19 09:53:31,643 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=97, PETRI_TRANSITIONS=100} [2024-11-19 09:53:31,644 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, -5 predicate places. [2024-11-19 09:53:31,644 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 100 transitions, 269 flow [2024-11-19 09:53:31,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 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-19 09:53:31,645 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:31,645 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-11-19 09:53:31,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:53:31,645 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:53:31,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:31,646 INFO L85 PathProgramCache]: Analyzing trace with hash -177083474, now seen corresponding path program 1 times [2024-11-19 09:53:31,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:31,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83724312] [2024-11-19 09:53:31,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:31,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:31,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:31,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:31,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83724312] [2024-11-19 09:53:31,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83724312] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:31,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436338378] [2024-11-19 09:53:31,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:31,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:31,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:31,901 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:31,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 09:53:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:32,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:53:32,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:32,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-19 09:53:32,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:32,211 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:32,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:32,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436338378] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:53:32,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:53:32,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-11-19 09:53:32,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889679216] [2024-11-19 09:53:32,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:53:32,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:53:32,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:32,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:53:32,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:53:32,879 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 106 [2024-11-19 09:53:32,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 100 transitions, 269 flow. Second operand has 13 states, 13 states have (on average 41.30769230769231) internal successors, (537), 13 states have internal predecessors, (537), 0 states have call successors, (0), 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-19 09:53:32,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:32,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 106 [2024-11-19 09:53:32,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:34,067 INFO L124 PetriNetUnfolderBase]: 5751/11628 cut-off events. [2024-11-19 09:53:34,068 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2024-11-19 09:53:34,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19548 conditions, 11628 events. 5751/11628 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 115173 event pairs, 4141 based on Foata normal form. 0/6131 useless extension candidates. Maximal degree in co-relation 19506. Up to 7750 conditions per place. [2024-11-19 09:53:34,252 INFO L140 encePairwiseOnDemand]: 98/106 looper letters, 55 selfloop transitions, 12 changer transitions 0/99 dead transitions. [2024-11-19 09:53:34,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 99 transitions, 399 flow [2024-11-19 09:53:34,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:53:34,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:53:34,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 345 transitions. [2024-11-19 09:53:34,255 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46495956873315364 [2024-11-19 09:53:34,255 INFO L175 Difference]: Start difference. First operand has 97 places, 100 transitions, 269 flow. Second operand 7 states and 345 transitions. [2024-11-19 09:53:34,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 99 transitions, 399 flow [2024-11-19 09:53:34,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 99 transitions, 392 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:53:34,258 INFO L231 Difference]: Finished difference. Result has 100 places, 99 transitions, 282 flow [2024-11-19 09:53:34,259 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=100, PETRI_TRANSITIONS=99} [2024-11-19 09:53:34,261 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, -2 predicate places. [2024-11-19 09:53:34,262 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 99 transitions, 282 flow [2024-11-19 09:53:34,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 41.30769230769231) internal successors, (537), 13 states have internal predecessors, (537), 0 states have call successors, (0), 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-19 09:53:34,262 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:34,263 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:53:34,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 09:53:34,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 09:53:34,464 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:53:34,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:34,464 INFO L85 PathProgramCache]: Analyzing trace with hash -177042885, now seen corresponding path program 1 times [2024-11-19 09:53:34,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:34,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148307649] [2024-11-19 09:53:34,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:34,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:34,563 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-19 09:53:34,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:34,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148307649] [2024-11-19 09:53:34,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148307649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:53:34,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:53:34,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:53:34,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708652832] [2024-11-19 09:53:34,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:34,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:53:34,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:34,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:53:34,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:53:34,589 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 106 [2024-11-19 09:53:34,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 99 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 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-19 09:53:34,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:34,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 106 [2024-11-19 09:53:34,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:35,891 INFO L124 PetriNetUnfolderBase]: 7474/15889 cut-off events. [2024-11-19 09:53:35,891 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2024-11-19 09:53:35,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26445 conditions, 15889 events. 7474/15889 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 1210. Compared 170656 event pairs, 5726 based on Foata normal form. 236/8584 useless extension candidates. Maximal degree in co-relation 26380. Up to 7712 conditions per place. [2024-11-19 09:53:35,963 INFO L140 encePairwiseOnDemand]: 94/106 looper letters, 99 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2024-11-19 09:53:35,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 144 transitions, 612 flow [2024-11-19 09:53:35,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:53:35,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:53:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 371 transitions. [2024-11-19 09:53:35,966 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-11-19 09:53:35,966 INFO L175 Difference]: Start difference. First operand has 100 places, 99 transitions, 282 flow. Second operand 6 states and 371 transitions. [2024-11-19 09:53:35,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 144 transitions, 612 flow [2024-11-19 09:53:35,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 144 transitions, 587 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-11-19 09:53:35,974 INFO L231 Difference]: Finished difference. Result has 103 places, 106 transitions, 334 flow [2024-11-19 09:53:35,974 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=334, PETRI_PLACES=103, PETRI_TRANSITIONS=106} [2024-11-19 09:53:35,975 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 1 predicate places. [2024-11-19 09:53:35,975 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 106 transitions, 334 flow [2024-11-19 09:53:35,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 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-19 09:53:35,975 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:35,976 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-19 09:53:35,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:53:35,976 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:53:35,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:35,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1193373287, now seen corresponding path program 1 times [2024-11-19 09:53:35,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:35,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185864161] [2024-11-19 09:53:35,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:35,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:36,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:36,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:36,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185864161] [2024-11-19 09:53:36,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185864161] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:36,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54374786] [2024-11-19 09:53:36,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:36,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:36,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:36,203 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:36,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 09:53:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:36,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 09:53:36,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:36,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-19 09:53:36,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:36,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:36,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:36,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54374786] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:53:36,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:53:36,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-11-19 09:53:36,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577894376] [2024-11-19 09:53:36,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:53:36,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:53:36,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:36,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:53:36,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:53:37,101 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 106 [2024-11-19 09:53:37,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 106 transitions, 334 flow. Second operand has 13 states, 13 states have (on average 41.46153846153846) internal successors, (539), 13 states have internal predecessors, (539), 0 states have call successors, (0), 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-19 09:53:37,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:37,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 106 [2024-11-19 09:53:37,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:38,587 INFO L124 PetriNetUnfolderBase]: 7692/15547 cut-off events. [2024-11-19 09:53:38,588 INFO L125 PetriNetUnfolderBase]: For 434/434 co-relation queries the response was YES. [2024-11-19 09:53:38,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26783 conditions, 15547 events. 7692/15547 cut-off events. For 434/434 co-relation queries the response was YES. Maximal size of possible extension queue 1227. Compared 161243 event pairs, 5827 based on Foata normal form. 0/8032 useless extension candidates. Maximal degree in co-relation 26718. Up to 10579 conditions per place. [2024-11-19 09:53:38,666 INFO L140 encePairwiseOnDemand]: 97/106 looper letters, 55 selfloop transitions, 18 changer transitions 0/105 dead transitions. [2024-11-19 09:53:38,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 105 transitions, 476 flow [2024-11-19 09:53:38,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:53:38,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:53:38,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 344 transitions. [2024-11-19 09:53:38,668 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4636118598382749 [2024-11-19 09:53:38,668 INFO L175 Difference]: Start difference. First operand has 103 places, 106 transitions, 334 flow. Second operand 7 states and 344 transitions. [2024-11-19 09:53:38,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 105 transitions, 476 flow [2024-11-19 09:53:38,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 105 transitions, 473 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:53:38,672 INFO L231 Difference]: Finished difference. Result has 107 places, 105 transitions, 363 flow [2024-11-19 09:53:38,672 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=363, PETRI_PLACES=107, PETRI_TRANSITIONS=105} [2024-11-19 09:53:38,673 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 5 predicate places. [2024-11-19 09:53:38,673 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 105 transitions, 363 flow [2024-11-19 09:53:38,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 41.46153846153846) internal successors, (539), 13 states have internal predecessors, (539), 0 states have call successors, (0), 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-19 09:53:38,674 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:38,674 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:38,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 09:53:38,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:38,879 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:53:38,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:38,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1621556200, now seen corresponding path program 1 times [2024-11-19 09:53:38,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:38,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471510552] [2024-11-19 09:53:38,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:38,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:39,147 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-19 09:53:39,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:39,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471510552] [2024-11-19 09:53:39,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471510552] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:39,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582318991] [2024-11-19 09:53:39,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:39,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:39,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:39,152 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:39,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 09:53:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:39,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 09:53:39,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:39,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 09:53:39,360 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-19 09:53:39,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:39,448 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-19 09:53:39,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582318991] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:39,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:53:39,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 4] total 14 [2024-11-19 09:53:39,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038889555] [2024-11-19 09:53:39,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:39,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:53:39,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:39,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:53:39,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-19 09:53:39,533 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 106 [2024-11-19 09:53:39,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 105 transitions, 363 flow. Second operand has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 0 states have call successors, (0), 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-19 09:53:39,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:39,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 106 [2024-11-19 09:53:39,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:41,166 INFO L124 PetriNetUnfolderBase]: 7475/15891 cut-off events. [2024-11-19 09:53:41,167 INFO L125 PetriNetUnfolderBase]: For 435/435 co-relation queries the response was YES. [2024-11-19 09:53:41,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26869 conditions, 15891 events. 7475/15891 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 1194. Compared 169749 event pairs, 5726 based on Foata normal form. 0/8356 useless extension candidates. Maximal degree in co-relation 26789. Up to 7708 conditions per place. [2024-11-19 09:53:41,270 INFO L140 encePairwiseOnDemand]: 98/106 looper letters, 104 selfloop transitions, 9 changer transitions 0/145 dead transitions. [2024-11-19 09:53:41,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 145 transitions, 697 flow [2024-11-19 09:53:41,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:53:41,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:53:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 360 transitions. [2024-11-19 09:53:41,272 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5660377358490566 [2024-11-19 09:53:41,272 INFO L175 Difference]: Start difference. First operand has 107 places, 105 transitions, 363 flow. Second operand 6 states and 360 transitions. [2024-11-19 09:53:41,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 145 transitions, 697 flow [2024-11-19 09:53:41,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 145 transitions, 646 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-11-19 09:53:41,276 INFO L231 Difference]: Finished difference. Result has 107 places, 107 transitions, 354 flow [2024-11-19 09:53:41,276 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=354, PETRI_PLACES=107, PETRI_TRANSITIONS=107} [2024-11-19 09:53:41,277 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 5 predicate places. [2024-11-19 09:53:41,277 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 107 transitions, 354 flow [2024-11-19 09:53:41,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 0 states have call successors, (0), 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-19 09:53:41,277 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:41,277 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:41,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 09:53:41,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:41,480 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:53:41,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:41,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1660570530, now seen corresponding path program 1 times [2024-11-19 09:53:41,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:41,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844893189] [2024-11-19 09:53:41,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:41,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:41,704 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-19 09:53:41,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:41,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844893189] [2024-11-19 09:53:41,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844893189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:53:41,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:53:41,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:53:41,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479266997] [2024-11-19 09:53:41,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:41,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:53:41,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:41,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:53:41,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:53:41,788 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 106 [2024-11-19 09:53:41,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 354 flow. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 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-19 09:53:41,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:41,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 106 [2024-11-19 09:53:41,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:42,780 INFO L124 PetriNetUnfolderBase]: 7773/15398 cut-off events. [2024-11-19 09:53:42,780 INFO L125 PetriNetUnfolderBase]: For 438/438 co-relation queries the response was YES. [2024-11-19 09:53:42,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26746 conditions, 15398 events. 7773/15398 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 1201. Compared 156501 event pairs, 5906 based on Foata normal form. 2/8036 useless extension candidates. Maximal degree in co-relation 19669. Up to 10690 conditions per place. [2024-11-19 09:53:42,863 INFO L140 encePairwiseOnDemand]: 97/106 looper letters, 67 selfloop transitions, 11 changer transitions 0/110 dead transitions. [2024-11-19 09:53:42,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 110 transitions, 520 flow [2024-11-19 09:53:42,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:53:42,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:53:42,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 264 transitions. [2024-11-19 09:53:42,865 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4981132075471698 [2024-11-19 09:53:42,865 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 354 flow. Second operand 5 states and 264 transitions. [2024-11-19 09:53:42,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 110 transitions, 520 flow [2024-11-19 09:53:42,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 110 transitions, 510 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:53:42,869 INFO L231 Difference]: Finished difference. Result has 110 places, 110 transitions, 397 flow [2024-11-19 09:53:42,869 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=397, PETRI_PLACES=110, PETRI_TRANSITIONS=110} [2024-11-19 09:53:42,870 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 8 predicate places. [2024-11-19 09:53:42,870 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 110 transitions, 397 flow [2024-11-19 09:53:42,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 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-19 09:53:42,870 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:42,870 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:42,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:53:42,871 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:53:42,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:42,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1660570628, now seen corresponding path program 1 times [2024-11-19 09:53:42,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:42,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282932313] [2024-11-19 09:53:42,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:42,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:43,150 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-19 09:53:43,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:43,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282932313] [2024-11-19 09:53:43,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282932313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:53:43,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:53:43,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:53:43,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718949797] [2024-11-19 09:53:43,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:43,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:53:43,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:43,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:53:43,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:53:43,259 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 106 [2024-11-19 09:53:43,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 110 transitions, 397 flow. Second operand has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 0 states have call successors, (0), 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-19 09:53:43,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:43,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 106 [2024-11-19 09:53:43,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:44,348 INFO L124 PetriNetUnfolderBase]: 9629/18046 cut-off events. [2024-11-19 09:53:44,348 INFO L125 PetriNetUnfolderBase]: For 534/534 co-relation queries the response was YES. [2024-11-19 09:53:44,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32086 conditions, 18046 events. 9629/18046 cut-off events. For 534/534 co-relation queries the response was YES. Maximal size of possible extension queue 1502. Compared 178228 event pairs, 7540 based on Foata normal form. 0/9604 useless extension candidates. Maximal degree in co-relation 31963. Up to 13273 conditions per place. [2024-11-19 09:53:44,464 INFO L140 encePairwiseOnDemand]: 98/106 looper letters, 82 selfloop transitions, 11 changer transitions 0/122 dead transitions. [2024-11-19 09:53:44,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 122 transitions, 657 flow [2024-11-19 09:53:44,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:53:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:53:44,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 308 transitions. [2024-11-19 09:53:44,470 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48427672955974843 [2024-11-19 09:53:44,470 INFO L175 Difference]: Start difference. First operand has 110 places, 110 transitions, 397 flow. Second operand 6 states and 308 transitions. [2024-11-19 09:53:44,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 122 transitions, 657 flow [2024-11-19 09:53:44,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 122 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:53:44,611 INFO L231 Difference]: Finished difference. Result has 116 places, 117 transitions, 481 flow [2024-11-19 09:53:44,611 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=481, PETRI_PLACES=116, PETRI_TRANSITIONS=117} [2024-11-19 09:53:44,612 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 14 predicate places. [2024-11-19 09:53:44,612 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 117 transitions, 481 flow [2024-11-19 09:53:44,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 0 states have call successors, (0), 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-19 09:53:44,612 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:44,613 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:44,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 09:53:44,613 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:53:44,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:44,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1621556199, now seen corresponding path program 1 times [2024-11-19 09:53:44,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:44,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17628600] [2024-11-19 09:53:44,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:44,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:53:44,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:44,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17628600] [2024-11-19 09:53:44,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17628600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:53:44,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:53:44,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:53:44,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014558689] [2024-11-19 09:53:44,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:44,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:53:44,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:44,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:53:44,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:53:44,701 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 106 [2024-11-19 09:53:44,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 117 transitions, 481 flow. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:53:44,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:44,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 106 [2024-11-19 09:53:44,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:45,618 INFO L124 PetriNetUnfolderBase]: 7779/15416 cut-off events. [2024-11-19 09:53:45,618 INFO L125 PetriNetUnfolderBase]: For 476/476 co-relation queries the response was YES. [2024-11-19 09:53:45,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26873 conditions, 15416 events. 7779/15416 cut-off events. For 476/476 co-relation queries the response was YES. Maximal size of possible extension queue 1201. Compared 156491 event pairs, 5906 based on Foata normal form. 2/8053 useless extension candidates. Maximal degree in co-relation 26746. Up to 10705 conditions per place. [2024-11-19 09:53:45,715 INFO L140 encePairwiseOnDemand]: 103/106 looper letters, 77 selfloop transitions, 7 changer transitions 0/116 dead transitions. [2024-11-19 09:53:45,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 116 transitions, 647 flow [2024-11-19 09:53:45,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:53:45,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:53:45,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2024-11-19 09:53:45,717 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5849056603773585 [2024-11-19 09:53:45,717 INFO L175 Difference]: Start difference. First operand has 116 places, 117 transitions, 481 flow. Second operand 3 states and 186 transitions. [2024-11-19 09:53:45,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 116 transitions, 647 flow [2024-11-19 09:53:45,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 116 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:53:45,721 INFO L231 Difference]: Finished difference. Result has 115 places, 116 transitions, 486 flow [2024-11-19 09:53:45,721 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=115, PETRI_TRANSITIONS=116} [2024-11-19 09:53:45,722 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 13 predicate places. [2024-11-19 09:53:45,722 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 116 transitions, 486 flow [2024-11-19 09:53:45,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:53:45,723 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:45,723 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:45,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 09:53:45,723 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:53:45,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:45,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1919513579, now seen corresponding path program 1 times [2024-11-19 09:53:45,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:45,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747983301] [2024-11-19 09:53:45,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:45,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:45,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:45,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:45,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747983301] [2024-11-19 09:53:45,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747983301] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:45,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852258469] [2024-11-19 09:53:45,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:45,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:45,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:45,969 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:45,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 09:53:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:46,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 09:53:46,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:46,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-19 09:53:46,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:46,326 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:46,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:46,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852258469] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:53:46,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:53:46,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-11-19 09:53:46,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340407248] [2024-11-19 09:53:46,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:53:46,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:53:46,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:46,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:53:46,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:53:46,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 106 [2024-11-19 09:53:46,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 116 transitions, 486 flow. Second operand has 13 states, 13 states have (on average 41.92307692307692) internal successors, (545), 13 states have internal predecessors, (545), 0 states have call successors, (0), 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-19 09:53:46,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:46,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 106 [2024-11-19 09:53:46,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:48,090 INFO L124 PetriNetUnfolderBase]: 7784/15427 cut-off events. [2024-11-19 09:53:48,090 INFO L125 PetriNetUnfolderBase]: For 492/492 co-relation queries the response was YES. [2024-11-19 09:53:48,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26929 conditions, 15427 events. 7784/15427 cut-off events. For 492/492 co-relation queries the response was YES. Maximal size of possible extension queue 1201. Compared 156562 event pairs, 5906 based on Foata normal form. 8/8069 useless extension candidates. Maximal degree in co-relation 26767. Up to 10692 conditions per place. [2024-11-19 09:53:48,172 INFO L140 encePairwiseOnDemand]: 97/106 looper letters, 62 selfloop transitions, 29 changer transitions 0/122 dead transitions. [2024-11-19 09:53:48,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 122 transitions, 710 flow [2024-11-19 09:53:48,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:53:48,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:53:48,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 430 transitions. [2024-11-19 09:53:48,174 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45073375262054505 [2024-11-19 09:53:48,175 INFO L175 Difference]: Start difference. First operand has 115 places, 116 transitions, 486 flow. Second operand 9 states and 430 transitions. [2024-11-19 09:53:48,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 122 transitions, 710 flow [2024-11-19 09:53:48,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 122 transitions, 696 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:53:48,178 INFO L231 Difference]: Finished difference. Result has 120 places, 122 transitions, 572 flow [2024-11-19 09:53:48,178 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=572, PETRI_PLACES=120, PETRI_TRANSITIONS=122} [2024-11-19 09:53:48,179 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 18 predicate places. [2024-11-19 09:53:48,179 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 122 transitions, 572 flow [2024-11-19 09:53:48,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 41.92307692307692) internal successors, (545), 13 states have internal predecessors, (545), 0 states have call successors, (0), 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-19 09:53:48,180 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:48,180 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:48,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 09:53:48,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-19 09:53:48,380 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:53:48,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:48,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1915682828, now seen corresponding path program 1 times [2024-11-19 09:53:48,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:48,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287261145] [2024-11-19 09:53:48,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:48,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:48,496 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-19 09:53:48,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:48,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287261145] [2024-11-19 09:53:48,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287261145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:53:48,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:53:48,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:53:48,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895417756] [2024-11-19 09:53:48,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:48,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:53:48,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:48,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:53:48,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:53:48,507 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 106 [2024-11-19 09:53:48,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 122 transitions, 572 flow. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 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-19 09:53:48,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:48,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 106 [2024-11-19 09:53:48,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:49,534 INFO L124 PetriNetUnfolderBase]: 8168/16189 cut-off events. [2024-11-19 09:53:49,534 INFO L125 PetriNetUnfolderBase]: For 561/561 co-relation queries the response was YES. [2024-11-19 09:53:49,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28674 conditions, 16189 events. 8168/16189 cut-off events. For 561/561 co-relation queries the response was YES. Maximal size of possible extension queue 1218. Compared 164519 event pairs, 6264 based on Foata normal form. 108/8840 useless extension candidates. Maximal degree in co-relation 28310. Up to 10725 conditions per place. [2024-11-19 09:53:49,633 INFO L140 encePairwiseOnDemand]: 97/106 looper letters, 152 selfloop transitions, 3 changer transitions 0/186 dead transitions. [2024-11-19 09:53:49,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 186 transitions, 1263 flow [2024-11-19 09:53:49,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:53:49,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:53:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2024-11-19 09:53:49,635 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6509433962264151 [2024-11-19 09:53:49,635 INFO L175 Difference]: Start difference. First operand has 120 places, 122 transitions, 572 flow. Second operand 4 states and 276 transitions. [2024-11-19 09:53:49,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 186 transitions, 1263 flow [2024-11-19 09:53:49,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 186 transitions, 1121 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-11-19 09:53:49,642 INFO L231 Difference]: Finished difference. Result has 118 places, 122 transitions, 513 flow [2024-11-19 09:53:49,642 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=513, PETRI_PLACES=118, PETRI_TRANSITIONS=122} [2024-11-19 09:53:49,642 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 16 predicate places. [2024-11-19 09:53:49,643 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 122 transitions, 513 flow [2024-11-19 09:53:49,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 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-19 09:53:49,643 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:49,643 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:49,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 09:53:49,643 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:53:49,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:49,644 INFO L85 PathProgramCache]: Analyzing trace with hash -757578697, now seen corresponding path program 1 times [2024-11-19 09:53:49,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:49,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445382743] [2024-11-19 09:53:49,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:49,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:49,766 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-19 09:53:49,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:49,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445382743] [2024-11-19 09:53:49,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445382743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:49,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326391925] [2024-11-19 09:53:49,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:49,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:49,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:49,769 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:49,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 09:53:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:49,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:53:49,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:49,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:50,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:50,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326391925] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:53:50,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:53:50,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-19 09:53:50,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746545772] [2024-11-19 09:53:50,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:53:50,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:53:50,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:50,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:53:50,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:53:50,075 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 106 [2024-11-19 09:53:50,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 122 transitions, 513 flow. Second operand has 14 states, 14 states have (on average 45.714285714285715) internal successors, (640), 14 states have internal predecessors, (640), 0 states have call successors, (0), 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-19 09:53:50,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:50,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 106 [2024-11-19 09:53:50,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:51,997 INFO L124 PetriNetUnfolderBase]: 14088/28571 cut-off events. [2024-11-19 09:53:51,997 INFO L125 PetriNetUnfolderBase]: For 2247/2247 co-relation queries the response was YES. [2024-11-19 09:53:52,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54371 conditions, 28571 events. 14088/28571 cut-off events. For 2247/2247 co-relation queries the response was YES. Maximal size of possible extension queue 1979. Compared 316527 event pairs, 10557 based on Foata normal form. 2/16121 useless extension candidates. Maximal degree in co-relation 53992. Up to 11314 conditions per place. [2024-11-19 09:53:52,210 INFO L140 encePairwiseOnDemand]: 90/106 looper letters, 110 selfloop transitions, 54 changer transitions 0/195 dead transitions. [2024-11-19 09:53:52,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 195 transitions, 1135 flow [2024-11-19 09:53:52,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:53:52,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 09:53:52,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 652 transitions. [2024-11-19 09:53:52,212 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5125786163522013 [2024-11-19 09:53:52,212 INFO L175 Difference]: Start difference. First operand has 118 places, 122 transitions, 513 flow. Second operand 12 states and 652 transitions. [2024-11-19 09:53:52,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 195 transitions, 1135 flow [2024-11-19 09:53:52,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 195 transitions, 1130 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:53:52,221 INFO L231 Difference]: Finished difference. Result has 133 places, 148 transitions, 873 flow [2024-11-19 09:53:52,221 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=873, PETRI_PLACES=133, PETRI_TRANSITIONS=148} [2024-11-19 09:53:52,222 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 31 predicate places. [2024-11-19 09:53:52,222 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 148 transitions, 873 flow [2024-11-19 09:53:52,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 45.714285714285715) internal successors, (640), 14 states have internal predecessors, (640), 0 states have call successors, (0), 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-19 09:53:52,222 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:52,222 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:52,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 09:53:52,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 09:53:52,423 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:53:52,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:52,424 INFO L85 PathProgramCache]: Analyzing trace with hash 627556903, now seen corresponding path program 1 times [2024-11-19 09:53:52,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:52,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804139034] [2024-11-19 09:53:52,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:52,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:52,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:52,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804139034] [2024-11-19 09:53:52,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804139034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:53:52,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:53:52,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:53:52,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951746198] [2024-11-19 09:53:52,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:53:52,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:53:52,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:52,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:53:52,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:53:52,531 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 106 [2024-11-19 09:53:52,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 148 transitions, 873 flow. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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-19 09:53:52,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:52,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 106 [2024-11-19 09:53:52,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:54,276 INFO L124 PetriNetUnfolderBase]: 14084/26835 cut-off events. [2024-11-19 09:53:54,276 INFO L125 PetriNetUnfolderBase]: For 2323/2323 co-relation queries the response was YES. [2024-11-19 09:53:54,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52805 conditions, 26835 events. 14084/26835 cut-off events. For 2323/2323 co-relation queries the response was YES. Maximal size of possible extension queue 1872. Compared 279063 event pairs, 10644 based on Foata normal form. 0/15781 useless extension candidates. Maximal degree in co-relation 52707. Up to 19426 conditions per place. [2024-11-19 09:53:54,503 INFO L140 encePairwiseOnDemand]: 102/106 looper letters, 111 selfloop transitions, 6 changer transitions 0/145 dead transitions. [2024-11-19 09:53:54,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 145 transitions, 1099 flow [2024-11-19 09:53:54,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:53:54,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:53:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2024-11-19 09:53:54,504 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5723270440251572 [2024-11-19 09:53:54,504 INFO L175 Difference]: Start difference. First operand has 133 places, 148 transitions, 873 flow. Second operand 3 states and 182 transitions. [2024-11-19 09:53:54,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 145 transitions, 1099 flow [2024-11-19 09:53:54,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 145 transitions, 1086 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-19 09:53:54,511 INFO L231 Difference]: Finished difference. Result has 131 places, 145 transitions, 864 flow [2024-11-19 09:53:54,512 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=864, PETRI_PLACES=131, PETRI_TRANSITIONS=145} [2024-11-19 09:53:54,512 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 29 predicate places. [2024-11-19 09:53:54,512 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 145 transitions, 864 flow [2024-11-19 09:53:54,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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-19 09:53:54,512 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:54,512 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:54,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 09:53:54,513 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:53:54,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:54,513 INFO L85 PathProgramCache]: Analyzing trace with hash 627556904, now seen corresponding path program 1 times [2024-11-19 09:53:54,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:54,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367801894] [2024-11-19 09:53:54,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:54,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:54,856 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-19 09:53:54,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:54,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367801894] [2024-11-19 09:53:54,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367801894] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:54,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118409096] [2024-11-19 09:53:54,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:53:54,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:54,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:54,859 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:54,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 09:53:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:53:55,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 09:53:55,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:55,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 09:53:55,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:53:55,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:53:55,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:53:55,357 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:53:55,357 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 11 treesize of output 11 [2024-11-19 09:53:55,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:53:55,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-19 09:53:55,465 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:53:55,465 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 11 treesize of output 11 [2024-11-19 09:53:55,496 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-19 09:53:55,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:55,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:53:55,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2024-11-19 09:53:55,754 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:53:55,810 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-19 09:53:55,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118409096] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:53:55,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:53:55,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2024-11-19 09:53:55,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463396347] [2024-11-19 09:53:55,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:53:55,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 09:53:55,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:55,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 09:53:55,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-11-19 09:53:56,613 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 106 [2024-11-19 09:53:56,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 145 transitions, 864 flow. Second operand has 18 states, 18 states have (on average 37.833333333333336) internal successors, (681), 18 states have internal predecessors, (681), 0 states have call successors, (0), 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-19 09:53:56,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:53:56,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 106 [2024-11-19 09:53:56,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:53:58,833 INFO L124 PetriNetUnfolderBase]: 14084/26829 cut-off events. [2024-11-19 09:53:58,833 INFO L125 PetriNetUnfolderBase]: For 2347/2347 co-relation queries the response was YES. [2024-11-19 09:53:58,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52793 conditions, 26829 events. 14084/26829 cut-off events. For 2347/2347 co-relation queries the response was YES. Maximal size of possible extension queue 1872. Compared 279233 event pairs, 10644 based on Foata normal form. 0/15775 useless extension candidates. Maximal degree in co-relation 52694. Up to 19364 conditions per place. [2024-11-19 09:53:58,985 INFO L140 encePairwiseOnDemand]: 99/106 looper letters, 108 selfloop transitions, 22 changer transitions 0/157 dead transitions. [2024-11-19 09:53:58,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 157 transitions, 1222 flow [2024-11-19 09:53:58,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:53:58,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:53:58,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 351 transitions. [2024-11-19 09:53:58,987 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41391509433962265 [2024-11-19 09:53:58,987 INFO L175 Difference]: Start difference. First operand has 131 places, 145 transitions, 864 flow. Second operand 8 states and 351 transitions. [2024-11-19 09:53:58,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 157 transitions, 1222 flow [2024-11-19 09:53:58,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 157 transitions, 1216 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:53:58,997 INFO L231 Difference]: Finished difference. Result has 136 places, 144 transitions, 898 flow [2024-11-19 09:53:58,997 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=898, PETRI_PLACES=136, PETRI_TRANSITIONS=144} [2024-11-19 09:53:58,997 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 34 predicate places. [2024-11-19 09:53:58,998 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 144 transitions, 898 flow [2024-11-19 09:53:58,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 37.833333333333336) internal successors, (681), 18 states have internal predecessors, (681), 0 states have call successors, (0), 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-19 09:53:58,998 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:53:58,998 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 09:53:59,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 09:53:59,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:59,199 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:53:59,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:53:59,200 INFO L85 PathProgramCache]: Analyzing trace with hash -973990044, now seen corresponding path program 2 times [2024-11-19 09:53:59,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:53:59,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304584434] [2024-11-19 09:53:59,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:53:59,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:53:59,233 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:53:59,233 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:59,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:59,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:53:59,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304584434] [2024-11-19 09:53:59,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304584434] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:53:59,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093909379] [2024-11-19 09:53:59,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:53:59,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:53:59,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:53:59,472 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:53:59,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 09:53:59,606 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:53:59,607 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:53:59,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 09:53:59,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:53:59,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 09:53:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:59,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:53:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:53:59,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093909379] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:53:59,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:53:59,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2024-11-19 09:53:59,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527962748] [2024-11-19 09:53:59,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:53:59,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 09:53:59,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:53:59,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 09:53:59,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2024-11-19 09:54:00,592 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 106 [2024-11-19 09:54:00,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 144 transitions, 898 flow. Second operand has 21 states, 21 states have (on average 44.714285714285715) internal successors, (939), 21 states have internal predecessors, (939), 0 states have call successors, (0), 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-19 09:54:00,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:54:00,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 106 [2024-11-19 09:54:00,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:54:04,317 INFO L124 PetriNetUnfolderBase]: 17747/35564 cut-off events. [2024-11-19 09:54:04,317 INFO L125 PetriNetUnfolderBase]: For 3185/3185 co-relation queries the response was YES. [2024-11-19 09:54:04,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68584 conditions, 35564 events. 17747/35564 cut-off events. For 3185/3185 co-relation queries the response was YES. Maximal size of possible extension queue 2342. Compared 396880 event pairs, 13140 based on Foata normal form. 0/20800 useless extension candidates. Maximal degree in co-relation 68377. Up to 10011 conditions per place. [2024-11-19 09:54:04,591 INFO L140 encePairwiseOnDemand]: 90/106 looper letters, 156 selfloop transitions, 82 changer transitions 0/265 dead transitions. [2024-11-19 09:54:04,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 265 transitions, 1933 flow [2024-11-19 09:54:04,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-19 09:54:04,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-11-19 09:54:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1300 transitions. [2024-11-19 09:54:04,595 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4716981132075472 [2024-11-19 09:54:04,595 INFO L175 Difference]: Start difference. First operand has 136 places, 144 transitions, 898 flow. Second operand 26 states and 1300 transitions. [2024-11-19 09:54:04,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 265 transitions, 1933 flow [2024-11-19 09:54:04,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 265 transitions, 1791 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-19 09:54:04,609 INFO L231 Difference]: Finished difference. Result has 158 places, 179 transitions, 1329 flow [2024-11-19 09:54:04,609 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1329, PETRI_PLACES=158, PETRI_TRANSITIONS=179} [2024-11-19 09:54:04,610 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 56 predicate places. [2024-11-19 09:54:04,611 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 179 transitions, 1329 flow [2024-11-19 09:54:04,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 44.714285714285715) internal successors, (939), 21 states have internal predecessors, (939), 0 states have call successors, (0), 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-19 09:54:04,611 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:54:04,611 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:54:04,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-19 09:54:04,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 09:54:04,812 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:54:04,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:54:04,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1893945333, now seen corresponding path program 1 times [2024-11-19 09:54:04,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:54:04,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462963471] [2024-11-19 09:54:04,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:54:04,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:54:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:54:04,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:54:04,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:54:04,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462963471] [2024-11-19 09:54:04,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462963471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:54:04,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:54:04,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:54:04,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831700938] [2024-11-19 09:54:04,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:54:04,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:54:04,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:54:04,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:54:04,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:54:04,901 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 106 [2024-11-19 09:54:04,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 179 transitions, 1329 flow. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 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-19 09:54:04,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:54:04,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 106 [2024-11-19 09:54:04,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:54:07,635 INFO L124 PetriNetUnfolderBase]: 18737/37069 cut-off events. [2024-11-19 09:54:07,635 INFO L125 PetriNetUnfolderBase]: For 3759/3759 co-relation queries the response was YES. [2024-11-19 09:54:07,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73201 conditions, 37069 events. 18737/37069 cut-off events. For 3759/3759 co-relation queries the response was YES. Maximal size of possible extension queue 2424. Compared 409486 event pairs, 13770 based on Foata normal form. 305/22846 useless extension candidates. Maximal degree in co-relation 72728. Up to 24836 conditions per place. [2024-11-19 09:54:07,953 INFO L140 encePairwiseOnDemand]: 89/106 looper letters, 209 selfloop transitions, 32 changer transitions 0/268 dead transitions. [2024-11-19 09:54:07,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 268 transitions, 2552 flow [2024-11-19 09:54:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:54:07,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:54:07,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 321 transitions. [2024-11-19 09:54:07,955 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6056603773584905 [2024-11-19 09:54:07,955 INFO L175 Difference]: Start difference. First operand has 158 places, 179 transitions, 1329 flow. Second operand 5 states and 321 transitions. [2024-11-19 09:54:07,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 268 transitions, 2552 flow [2024-11-19 09:54:07,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 268 transitions, 2369 flow, removed 61 selfloop flow, removed 10 redundant places. [2024-11-19 09:54:07,970 INFO L231 Difference]: Finished difference. Result has 154 places, 199 transitions, 1624 flow [2024-11-19 09:54:07,971 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=1212, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1624, PETRI_PLACES=154, PETRI_TRANSITIONS=199} [2024-11-19 09:54:07,971 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 52 predicate places. [2024-11-19 09:54:07,971 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 199 transitions, 1624 flow [2024-11-19 09:54:07,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 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-19 09:54:07,972 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:54:07,972 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:54:07,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 09:54:07,972 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:54:07,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:54:07,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1689984819, now seen corresponding path program 1 times [2024-11-19 09:54:07,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:54:07,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301630904] [2024-11-19 09:54:07,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:54:07,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:54:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:54:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:54:08,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:54:08,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301630904] [2024-11-19 09:54:08,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301630904] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:54:08,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115136469] [2024-11-19 09:54:08,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:54:08,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:54:08,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:54:08,245 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:54:08,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 09:54:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:54:08,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 09:54:08,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:54:08,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:54:08,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:54:08,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:54:08,440 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 09:54:08,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 09:54:08,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:54:08,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:54:08,465 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:54:08,465 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 11 treesize of output 11 [2024-11-19 09:54:08,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:54:08,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:54:08,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115136469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:54:08,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 09:54:08,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-11-19 09:54:08,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146453150] [2024-11-19 09:54:08,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:54:08,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:54:08,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:54:08,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:54:08,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:54:08,599 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 106 [2024-11-19 09:54:08,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 199 transitions, 1624 flow. Second operand has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 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-19 09:54:08,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:54:08,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 106 [2024-11-19 09:54:08,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:54:10,341 INFO L124 PetriNetUnfolderBase]: 11789/23121 cut-off events. [2024-11-19 09:54:10,341 INFO L125 PetriNetUnfolderBase]: For 5087/5195 co-relation queries the response was YES. [2024-11-19 09:54:10,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51375 conditions, 23121 events. 11789/23121 cut-off events. For 5087/5195 co-relation queries the response was YES. Maximal size of possible extension queue 1497. Compared 236592 event pairs, 8918 based on Foata normal form. 0/15375 useless extension candidates. Maximal degree in co-relation 50995. Up to 16936 conditions per place. [2024-11-19 09:54:10,498 INFO L140 encePairwiseOnDemand]: 100/106 looper letters, 155 selfloop transitions, 13 changer transitions 0/195 dead transitions. [2024-11-19 09:54:10,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 195 transitions, 1940 flow [2024-11-19 09:54:10,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:54:10,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:54:10,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 215 transitions. [2024-11-19 09:54:10,499 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5070754716981132 [2024-11-19 09:54:10,499 INFO L175 Difference]: Start difference. First operand has 154 places, 199 transitions, 1624 flow. Second operand 4 states and 215 transitions. [2024-11-19 09:54:10,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 195 transitions, 1940 flow [2024-11-19 09:54:10,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 195 transitions, 1932 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:54:10,512 INFO L231 Difference]: Finished difference. Result has 152 places, 195 transitions, 1622 flow [2024-11-19 09:54:10,512 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=1596, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1622, PETRI_PLACES=152, PETRI_TRANSITIONS=195} [2024-11-19 09:54:10,512 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 50 predicate places. [2024-11-19 09:54:10,513 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 195 transitions, 1622 flow [2024-11-19 09:54:10,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 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-19 09:54:10,513 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:54:10,513 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:54:10,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 09:54:10,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:54:10,714 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:54:10,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:54:10,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1689984820, now seen corresponding path program 1 times [2024-11-19 09:54:10,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:54:10,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880183035] [2024-11-19 09:54:10,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:54:10,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:54:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:54:10,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:54:10,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:54:10,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880183035] [2024-11-19 09:54:10,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880183035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:54:10,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:54:10,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:54:10,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5597749] [2024-11-19 09:54:10,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:54:10,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:54:10,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:54:10,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:54:10,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:54:11,047 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 106 [2024-11-19 09:54:11,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 195 transitions, 1622 flow. Second operand has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 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-19 09:54:11,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:54:11,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 106 [2024-11-19 09:54:11,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:54:12,853 INFO L124 PetriNetUnfolderBase]: 11551/21677 cut-off events. [2024-11-19 09:54:12,853 INFO L125 PetriNetUnfolderBase]: For 5126/5126 co-relation queries the response was YES. [2024-11-19 09:54:12,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48529 conditions, 21677 events. 11551/21677 cut-off events. For 5126/5126 co-relation queries the response was YES. Maximal size of possible extension queue 1357. Compared 211112 event pairs, 9041 based on Foata normal form. 0/15687 useless extension candidates. Maximal degree in co-relation 48149. Up to 16536 conditions per place. [2024-11-19 09:54:13,008 INFO L140 encePairwiseOnDemand]: 97/106 looper letters, 111 selfloop transitions, 57 changer transitions 0/191 dead transitions. [2024-11-19 09:54:13,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 191 transitions, 1946 flow [2024-11-19 09:54:13,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:54:13,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:54:13,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 235 transitions. [2024-11-19 09:54:13,009 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44339622641509435 [2024-11-19 09:54:13,009 INFO L175 Difference]: Start difference. First operand has 152 places, 195 transitions, 1622 flow. Second operand 5 states and 235 transitions. [2024-11-19 09:54:13,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 191 transitions, 1946 flow [2024-11-19 09:54:13,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 191 transitions, 1929 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:54:13,019 INFO L231 Difference]: Finished difference. Result has 150 places, 191 transitions, 1707 flow [2024-11-19 09:54:13,019 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=1593, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1707, PETRI_PLACES=150, PETRI_TRANSITIONS=191} [2024-11-19 09:54:13,020 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 48 predicate places. [2024-11-19 09:54:13,020 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 191 transitions, 1707 flow [2024-11-19 09:54:13,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 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-19 09:54:13,020 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:54:13,020 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:54:13,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 09:54:13,021 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:54:13,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:54:13,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1689984821, now seen corresponding path program 1 times [2024-11-19 09:54:13,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:54:13,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285189365] [2024-11-19 09:54:13,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:54:13,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:54:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:54:13,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:54:13,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:54:13,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285189365] [2024-11-19 09:54:13,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285189365] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:54:13,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046963154] [2024-11-19 09:54:13,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:54:13,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:54:13,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:54:13,502 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:54:13,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 09:54:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:54:13,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 09:54:13,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:54:13,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:54:13,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:54:13,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:54:13,721 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 09:54:13,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 09:54:13,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:54:13,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:54:13,763 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 09:54:13,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-19 09:54:13,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:54:13,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:54:13,854 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-19 09:54:13,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-19 09:54:13,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:54:13,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:54:13,884 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-19 09:54:13,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-19 09:54:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:54:13,916 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:54:13,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046963154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:54:13,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 09:54:13,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2024-11-19 09:54:13,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443610704] [2024-11-19 09:54:13,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:54:13,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:54:13,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:54:13,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:54:13,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:54:14,077 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 106 [2024-11-19 09:54:14,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 191 transitions, 1707 flow. Second operand has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 7 states have internal predecessors, (264), 0 states have call successors, (0), 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-19 09:54:14,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:54:14,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 106 [2024-11-19 09:54:14,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:54:15,545 INFO L124 PetriNetUnfolderBase]: 10125/19229 cut-off events. [2024-11-19 09:54:15,546 INFO L125 PetriNetUnfolderBase]: For 5279/5279 co-relation queries the response was YES. [2024-11-19 09:54:15,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42287 conditions, 19229 events. 10125/19229 cut-off events. For 5279/5279 co-relation queries the response was YES. Maximal size of possible extension queue 1201. Compared 186130 event pairs, 8120 based on Foata normal form. 0/14563 useless extension candidates. Maximal degree in co-relation 41907. Up to 14967 conditions per place. [2024-11-19 09:54:15,738 INFO L140 encePairwiseOnDemand]: 103/106 looper letters, 163 selfloop transitions, 4 changer transitions 0/190 dead transitions. [2024-11-19 09:54:15,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 190 transitions, 2035 flow [2024-11-19 09:54:15,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:54:15,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:54:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2024-11-19 09:54:15,740 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45990566037735847 [2024-11-19 09:54:15,740 INFO L175 Difference]: Start difference. First operand has 150 places, 191 transitions, 1707 flow. Second operand 4 states and 195 transitions. [2024-11-19 09:54:15,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 190 transitions, 2035 flow [2024-11-19 09:54:15,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 190 transitions, 1921 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:54:15,759 INFO L231 Difference]: Finished difference. Result has 148 places, 190 transitions, 1595 flow [2024-11-19 09:54:15,759 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=1587, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1595, PETRI_PLACES=148, PETRI_TRANSITIONS=190} [2024-11-19 09:54:15,760 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 46 predicate places. [2024-11-19 09:54:15,760 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 190 transitions, 1595 flow [2024-11-19 09:54:15,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 7 states have internal predecessors, (264), 0 states have call successors, (0), 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-19 09:54:15,760 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:54:15,760 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:54:15,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-19 09:54:15,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-19 09:54:15,962 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:54:15,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:54:15,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1131396668, now seen corresponding path program 1 times [2024-11-19 09:54:15,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:54:15,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069677152] [2024-11-19 09:54:15,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:54:15,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:54:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:54:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:54:16,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:54:16,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069677152] [2024-11-19 09:54:16,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069677152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:54:16,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:54:16,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:54:16,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197263533] [2024-11-19 09:54:16,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:54:16,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:54:16,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:54:16,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:54:16,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:54:16,017 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 106 [2024-11-19 09:54:16,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 190 transitions, 1595 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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-19 09:54:16,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:54:16,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 106 [2024-11-19 09:54:16,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:54:17,563 INFO L124 PetriNetUnfolderBase]: 10713/17249 cut-off events. [2024-11-19 09:54:17,563 INFO L125 PetriNetUnfolderBase]: For 4602/4618 co-relation queries the response was YES. [2024-11-19 09:54:17,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40641 conditions, 17249 events. 10713/17249 cut-off events. For 4602/4618 co-relation queries the response was YES. Maximal size of possible extension queue 994. Compared 130759 event pairs, 3073 based on Foata normal form. 179/12905 useless extension candidates. Maximal degree in co-relation 40261. Up to 12055 conditions per place. [2024-11-19 09:54:17,680 INFO L140 encePairwiseOnDemand]: 100/106 looper letters, 184 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2024-11-19 09:54:17,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 210 transitions, 2020 flow [2024-11-19 09:54:17,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:54:17,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:54:17,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 205 transitions. [2024-11-19 09:54:17,681 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6446540880503144 [2024-11-19 09:54:17,681 INFO L175 Difference]: Start difference. First operand has 148 places, 190 transitions, 1595 flow. Second operand 3 states and 205 transitions. [2024-11-19 09:54:17,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 210 transitions, 2020 flow [2024-11-19 09:54:17,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 210 transitions, 2015 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:54:17,689 INFO L231 Difference]: Finished difference. Result has 149 places, 191 transitions, 1612 flow [2024-11-19 09:54:17,689 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=1590, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1612, PETRI_PLACES=149, PETRI_TRANSITIONS=191} [2024-11-19 09:54:17,690 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 47 predicate places. [2024-11-19 09:54:17,690 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 191 transitions, 1612 flow [2024-11-19 09:54:17,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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-19 09:54:17,690 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:54:17,690 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:54:17,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 09:54:17,690 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:54:17,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:54:17,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1352526836, now seen corresponding path program 1 times [2024-11-19 09:54:17,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:54:17,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324176587] [2024-11-19 09:54:17,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:54:17,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:54:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:54:17,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:54:17,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:54:17,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324176587] [2024-11-19 09:54:17,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324176587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:54:17,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:54:17,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:54:17,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291030085] [2024-11-19 09:54:17,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:54:17,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:54:17,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:54:17,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:54:17,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:54:17,763 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 106 [2024-11-19 09:54:17,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 191 transitions, 1612 flow. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 4 states have internal predecessors, (190), 0 states have call successors, (0), 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-19 09:54:17,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:54:17,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 106 [2024-11-19 09:54:17,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:54:19,194 INFO L124 PetriNetUnfolderBase]: 9236/17845 cut-off events. [2024-11-19 09:54:19,194 INFO L125 PetriNetUnfolderBase]: For 7546/7654 co-relation queries the response was YES. [2024-11-19 09:54:19,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41659 conditions, 17845 events. 9236/17845 cut-off events. For 7546/7654 co-relation queries the response was YES. Maximal size of possible extension queue 1033. Compared 170463 event pairs, 7661 based on Foata normal form. 266/14419 useless extension candidates. Maximal degree in co-relation 41278. Up to 12221 conditions per place. [2024-11-19 09:54:19,552 INFO L140 encePairwiseOnDemand]: 98/106 looper letters, 198 selfloop transitions, 12 changer transitions 0/234 dead transitions. [2024-11-19 09:54:19,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 234 transitions, 2355 flow [2024-11-19 09:54:19,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:54:19,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:54:19,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 255 transitions. [2024-11-19 09:54:19,553 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6014150943396226 [2024-11-19 09:54:19,553 INFO L175 Difference]: Start difference. First operand has 149 places, 191 transitions, 1612 flow. Second operand 4 states and 255 transitions. [2024-11-19 09:54:19,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 234 transitions, 2355 flow [2024-11-19 09:54:19,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 234 transitions, 2340 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-19 09:54:19,563 INFO L231 Difference]: Finished difference. Result has 152 places, 191 transitions, 1635 flow [2024-11-19 09:54:19,563 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=1600, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1635, PETRI_PLACES=152, PETRI_TRANSITIONS=191} [2024-11-19 09:54:19,563 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 50 predicate places. [2024-11-19 09:54:19,563 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 191 transitions, 1635 flow [2024-11-19 09:54:19,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 4 states have internal predecessors, (190), 0 states have call successors, (0), 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-19 09:54:19,564 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:54:19,564 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:54:19,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 09:54:19,564 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:54:19,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:54:19,564 INFO L85 PathProgramCache]: Analyzing trace with hash -812693372, now seen corresponding path program 1 times [2024-11-19 09:54:19,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:54:19,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106439114] [2024-11-19 09:54:19,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:54:19,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:54:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:54:19,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:54:19,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:54:19,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106439114] [2024-11-19 09:54:19,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106439114] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:54:19,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813374200] [2024-11-19 09:54:19,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:54:19,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:54:19,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:54:19,684 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:54:19,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 09:54:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:54:19,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:54:19,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:54:19,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:54:19,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:54:19,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:54:19,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813374200] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 09:54:19,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:54:19,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2024-11-19 09:54:19,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157001105] [2024-11-19 09:54:19,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:54:19,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:54:19,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:54:19,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:54:19,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:54:19,938 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 106 [2024-11-19 09:54:19,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 191 transitions, 1635 flow. Second operand has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 0 states have call successors, (0), 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-19 09:54:19,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:54:19,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 106 [2024-11-19 09:54:19,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:54:21,506 INFO L124 PetriNetUnfolderBase]: 8684/19379 cut-off events. [2024-11-19 09:54:21,506 INFO L125 PetriNetUnfolderBase]: For 6648/6648 co-relation queries the response was YES. [2024-11-19 09:54:21,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42089 conditions, 19379 events. 8684/19379 cut-off events. For 6648/6648 co-relation queries the response was YES. Maximal size of possible extension queue 1008. Compared 205525 event pairs, 7157 based on Foata normal form. 12/14883 useless extension candidates. Maximal degree in co-relation 37959. Up to 12430 conditions per place. [2024-11-19 09:54:21,706 INFO L140 encePairwiseOnDemand]: 99/106 looper letters, 182 selfloop transitions, 21 changer transitions 0/227 dead transitions. [2024-11-19 09:54:21,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 227 transitions, 2208 flow [2024-11-19 09:54:21,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:54:21,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:54:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 305 transitions. [2024-11-19 09:54:21,707 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5754716981132075 [2024-11-19 09:54:21,707 INFO L175 Difference]: Start difference. First operand has 152 places, 191 transitions, 1635 flow. Second operand 5 states and 305 transitions. [2024-11-19 09:54:21,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 227 transitions, 2208 flow [2024-11-19 09:54:21,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 227 transitions, 2188 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:54:21,720 INFO L231 Difference]: Finished difference. Result has 155 places, 189 transitions, 1653 flow [2024-11-19 09:54:21,721 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=1582, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1653, PETRI_PLACES=155, PETRI_TRANSITIONS=189} [2024-11-19 09:54:21,721 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 53 predicate places. [2024-11-19 09:54:21,721 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 189 transitions, 1653 flow [2024-11-19 09:54:21,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 0 states have call successors, (0), 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-19 09:54:21,721 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:54:21,721 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:54:21,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-19 09:54:21,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-19 09:54:21,922 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:54:21,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:54:21,923 INFO L85 PathProgramCache]: Analyzing trace with hash 776247064, now seen corresponding path program 1 times [2024-11-19 09:54:21,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:54:21,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020542137] [2024-11-19 09:54:21,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:54:21,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:54:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:54:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:54:22,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:54:22,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020542137] [2024-11-19 09:54:22,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020542137] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:54:22,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627627405] [2024-11-19 09:54:22,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:54:22,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:54:22,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:54:22,336 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:54:22,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 09:54:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:54:22,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-19 09:54:22,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:54:22,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:54:22,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:54:22,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:54:22,533 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 09:54:22,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 09:54:22,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:54:22,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:54:22,575 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 09:54:22,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-19 09:54:22,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:54:22,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:54:22,635 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-19 09:54:22,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-19 09:54:22,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:54:22,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:54:22,674 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-19 09:54:22,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-19 09:54:22,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:54:22,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:54:22,703 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-19 09:54:22,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-19 09:54:22,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:54:22,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:54:23,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 683 treesize of output 673 [2024-11-19 09:54:23,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:54:23,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627627405] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:54:23,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:54:23,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2024-11-19 09:54:23,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843654172] [2024-11-19 09:54:23,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:54:23,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 09:54:23,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:54:23,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 09:54:23,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2024-11-19 09:54:24,875 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 106 [2024-11-19 09:54:24,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 189 transitions, 1653 flow. Second operand has 20 states, 20 states have (on average 35.7) internal successors, (714), 20 states have internal predecessors, (714), 0 states have call successors, (0), 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-19 09:54:24,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:54:24,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 106 [2024-11-19 09:54:24,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:54:26,982 INFO L124 PetriNetUnfolderBase]: 9468/18767 cut-off events. [2024-11-19 09:54:26,982 INFO L125 PetriNetUnfolderBase]: For 6559/6559 co-relation queries the response was YES. [2024-11-19 09:54:27,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43230 conditions, 18767 events. 9468/18767 cut-off events. For 6559/6559 co-relation queries the response was YES. Maximal size of possible extension queue 989. Compared 181822 event pairs, 4217 based on Foata normal form. 0/14526 useless extension candidates. Maximal degree in co-relation 39066. Up to 8211 conditions per place. [2024-11-19 09:54:27,133 INFO L140 encePairwiseOnDemand]: 93/106 looper letters, 131 selfloop transitions, 51 changer transitions 0/202 dead transitions. [2024-11-19 09:54:27,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 202 transitions, 2073 flow [2024-11-19 09:54:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:54:27,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:54:27,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 266 transitions. [2024-11-19 09:54:27,134 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41823899371069184 [2024-11-19 09:54:27,134 INFO L175 Difference]: Start difference. First operand has 155 places, 189 transitions, 1653 flow. Second operand 6 states and 266 transitions. [2024-11-19 09:54:27,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 202 transitions, 2073 flow [2024-11-19 09:54:27,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 202 transitions, 2032 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-19 09:54:27,149 INFO L231 Difference]: Finished difference. Result has 153 places, 186 transitions, 1708 flow [2024-11-19 09:54:27,149 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=1606, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1708, PETRI_PLACES=153, PETRI_TRANSITIONS=186} [2024-11-19 09:54:27,149 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 51 predicate places. [2024-11-19 09:54:27,149 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 186 transitions, 1708 flow [2024-11-19 09:54:27,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 35.7) internal successors, (714), 20 states have internal predecessors, (714), 0 states have call successors, (0), 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-19 09:54:27,150 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:54:27,150 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] [2024-11-19 09:54:27,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-19 09:54:27,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-19 09:54:27,351 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:54:27,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:54:27,351 INFO L85 PathProgramCache]: Analyzing trace with hash -642207213, now seen corresponding path program 1 times [2024-11-19 09:54:27,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:54:27,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673881616] [2024-11-19 09:54:27,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:54:27,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:54:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:54:27,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:54:27,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:54:27,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673881616] [2024-11-19 09:54:27,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673881616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:54:27,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:54:27,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:54:27,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820485542] [2024-11-19 09:54:27,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:54:27,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:54:27,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:54:27,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:54:27,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:54:27,681 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 106 [2024-11-19 09:54:27,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 186 transitions, 1708 flow. Second operand has 7 states, 7 states have (on average 40.57142857142857) internal successors, (284), 7 states have internal predecessors, (284), 0 states have call successors, (0), 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-19 09:54:27,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:54:27,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 106 [2024-11-19 09:54:27,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:54:29,025 INFO L124 PetriNetUnfolderBase]: 9140/17203 cut-off events. [2024-11-19 09:54:29,026 INFO L125 PetriNetUnfolderBase]: For 8649/8649 co-relation queries the response was YES. [2024-11-19 09:54:29,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42144 conditions, 17203 events. 9140/17203 cut-off events. For 8649/8649 co-relation queries the response was YES. Maximal size of possible extension queue 950. Compared 158226 event pairs, 7577 based on Foata normal form. 339/13964 useless extension candidates. Maximal degree in co-relation 41921. Up to 13915 conditions per place. [2024-11-19 09:54:29,166 INFO L140 encePairwiseOnDemand]: 99/106 looper letters, 107 selfloop transitions, 58 changer transitions 0/184 dead transitions. [2024-11-19 09:54:29,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 184 transitions, 2034 flow [2024-11-19 09:54:29,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:54:29,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:54:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 241 transitions. [2024-11-19 09:54:29,167 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4547169811320755 [2024-11-19 09:54:29,167 INFO L175 Difference]: Start difference. First operand has 153 places, 186 transitions, 1708 flow. Second operand 5 states and 241 transitions. [2024-11-19 09:54:29,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 184 transitions, 2034 flow [2024-11-19 09:54:29,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 184 transitions, 1932 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 09:54:29,184 INFO L231 Difference]: Finished difference. Result has 150 places, 184 transitions, 1718 flow [2024-11-19 09:54:29,184 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=1602, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1718, PETRI_PLACES=150, PETRI_TRANSITIONS=184} [2024-11-19 09:54:29,184 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 48 predicate places. [2024-11-19 09:54:29,185 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 184 transitions, 1718 flow [2024-11-19 09:54:29,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 40.57142857142857) internal successors, (284), 7 states have internal predecessors, (284), 0 states have call successors, (0), 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-19 09:54:29,185 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:54:29,185 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] [2024-11-19 09:54:29,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 09:54:29,185 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:54:29,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:54:29,186 INFO L85 PathProgramCache]: Analyzing trace with hash -642207212, now seen corresponding path program 1 times [2024-11-19 09:54:29,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:54:29,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663345053] [2024-11-19 09:54:29,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:54:29,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:54:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:54:29,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:54:29,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:54:29,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663345053] [2024-11-19 09:54:29,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663345053] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:54:29,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128943559] [2024-11-19 09:54:29,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:54:29,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:54:29,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:54:29,589 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:54:29,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-19 09:54:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:54:29,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-19 09:54:29,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:54:29,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:54:29,850 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 09:54:29,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-19 09:54:29,867 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 09:54:29,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-19 09:54:29,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:54:29,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 09:54:29,939 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-19 09:54:29,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-19 09:54:29,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:54:29,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 09:54:30,004 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-19 09:54:30,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-19 09:54:30,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:54:30,059 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:54:30,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 200 treesize of output 194 [2024-11-19 09:54:30,652 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 09:54:30,652 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 27 treesize of output 23 [2024-11-19 09:54:30,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:54:30,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128943559] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:54:30,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:54:30,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 24 [2024-11-19 09:54:30,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575886761] [2024-11-19 09:54:30,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:54:30,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 09:54:30,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:54:30,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 09:54:30,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2024-11-19 09:54:32,515 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 106 [2024-11-19 09:54:32,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 184 transitions, 1718 flow. Second operand has 26 states, 26 states have (on average 39.07692307692308) internal successors, (1016), 26 states have internal predecessors, (1016), 0 states have call successors, (0), 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-19 09:54:32,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:54:32,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 106 [2024-11-19 09:54:32,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:54:37,152 INFO L124 PetriNetUnfolderBase]: 20237/35535 cut-off events. [2024-11-19 09:54:37,152 INFO L125 PetriNetUnfolderBase]: For 14241/14394 co-relation queries the response was YES. [2024-11-19 09:54:37,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86768 conditions, 35535 events. 20237/35535 cut-off events. For 14241/14394 co-relation queries the response was YES. Maximal size of possible extension queue 1925. Compared 333938 event pairs, 12740 based on Foata normal form. 3/27418 useless extension candidates. Maximal degree in co-relation 86445. Up to 14279 conditions per place. [2024-11-19 09:54:37,462 INFO L140 encePairwiseOnDemand]: 89/106 looper letters, 286 selfloop transitions, 156 changer transitions 1/461 dead transitions. [2024-11-19 09:54:37,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 461 transitions, 4864 flow [2024-11-19 09:54:37,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-19 09:54:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-11-19 09:54:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1269 transitions. [2024-11-19 09:54:37,464 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4275606469002695 [2024-11-19 09:54:37,464 INFO L175 Difference]: Start difference. First operand has 150 places, 184 transitions, 1718 flow. Second operand 28 states and 1269 transitions. [2024-11-19 09:54:37,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 461 transitions, 4864 flow [2024-11-19 09:54:37,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 461 transitions, 4602 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:54:37,483 INFO L231 Difference]: Finished difference. Result has 181 places, 309 transitions, 3674 flow [2024-11-19 09:54:37,484 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=1602, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=3674, PETRI_PLACES=181, PETRI_TRANSITIONS=309} [2024-11-19 09:54:37,484 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 79 predicate places. [2024-11-19 09:54:37,484 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 309 transitions, 3674 flow [2024-11-19 09:54:37,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 39.07692307692308) internal successors, (1016), 26 states have internal predecessors, (1016), 0 states have call successors, (0), 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-19 09:54:37,485 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:54:37,485 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] [2024-11-19 09:54:37,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-19 09:54:37,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-19 09:54:37,685 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-19 09:54:37,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:54:37,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1566414305, now seen corresponding path program 1 times [2024-11-19 09:54:37,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:54:37,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303426389] [2024-11-19 09:54:37,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:54:37,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:54:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:54:37,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:54:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:54:37,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 09:54:37,774 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:54:37,775 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 81 remaining) [2024-11-19 09:54:37,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 81 remaining) [2024-11-19 09:54:37,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 81 remaining) [2024-11-19 09:54:37,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 81 remaining) [2024-11-19 09:54:37,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 81 remaining) [2024-11-19 09:54:37,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 81 remaining) [2024-11-19 09:54:37,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 81 remaining) [2024-11-19 09:54:37,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 81 remaining) [2024-11-19 09:54:37,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 81 remaining) [2024-11-19 09:54:37,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 81 remaining) [2024-11-19 09:54:37,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 81 remaining) [2024-11-19 09:54:37,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 81 remaining) [2024-11-19 09:54:37,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 81 remaining) [2024-11-19 09:54:37,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 81 remaining) [2024-11-19 09:54:37,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 81 remaining) [2024-11-19 09:54:37,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 81 remaining) [2024-11-19 09:54:37,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 81 remaining) [2024-11-19 09:54:37,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 81 remaining) [2024-11-19 09:54:37,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 81 remaining) [2024-11-19 09:54:37,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 81 remaining) [2024-11-19 09:54:37,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 81 remaining) [2024-11-19 09:54:37,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 81 remaining) [2024-11-19 09:54:37,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 81 remaining) [2024-11-19 09:54:37,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 81 remaining) [2024-11-19 09:54:37,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 81 remaining) [2024-11-19 09:54:37,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 81 remaining) [2024-11-19 09:54:37,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 81 remaining) [2024-11-19 09:54:37,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 81 remaining) [2024-11-19 09:54:37,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 81 remaining) [2024-11-19 09:54:37,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 81 remaining) [2024-11-19 09:54:37,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 81 remaining) [2024-11-19 09:54:37,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 81 remaining) [2024-11-19 09:54:37,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 81 remaining) [2024-11-19 09:54:37,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 81 remaining) [2024-11-19 09:54:37,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 81 remaining) [2024-11-19 09:54:37,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 81 remaining) [2024-11-19 09:54:37,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 81 remaining) [2024-11-19 09:54:37,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 81 remaining) [2024-11-19 09:54:37,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 81 remaining) [2024-11-19 09:54:37,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 81 remaining) [2024-11-19 09:54:37,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 81 remaining) [2024-11-19 09:54:37,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 81 remaining) [2024-11-19 09:54:37,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 81 remaining) [2024-11-19 09:54:37,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 81 remaining) [2024-11-19 09:54:37,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 81 remaining) [2024-11-19 09:54:37,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (35 of 81 remaining) [2024-11-19 09:54:37,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (34 of 81 remaining) [2024-11-19 09:54:37,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 81 remaining) [2024-11-19 09:54:37,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 81 remaining) [2024-11-19 09:54:37,782 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 81 remaining) [2024-11-19 09:54:37,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 81 remaining) [2024-11-19 09:54:37,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 81 remaining) [2024-11-19 09:54:37,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 81 remaining) [2024-11-19 09:54:37,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 81 remaining) [2024-11-19 09:54:37,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 81 remaining) [2024-11-19 09:54:37,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 81 remaining) [2024-11-19 09:54:37,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 81 remaining) [2024-11-19 09:54:37,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 81 remaining) [2024-11-19 09:54:37,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 81 remaining) [2024-11-19 09:54:37,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 81 remaining) [2024-11-19 09:54:37,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 81 remaining) [2024-11-19 09:54:37,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 81 remaining) [2024-11-19 09:54:37,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 81 remaining) [2024-11-19 09:54:37,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 81 remaining) [2024-11-19 09:54:37,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 81 remaining) [2024-11-19 09:54:37,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 81 remaining) [2024-11-19 09:54:37,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 81 remaining) [2024-11-19 09:54:37,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 81 remaining) [2024-11-19 09:54:37,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 81 remaining) [2024-11-19 09:54:37,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 81 remaining) [2024-11-19 09:54:37,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 81 remaining) [2024-11-19 09:54:37,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 81 remaining) [2024-11-19 09:54:37,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 81 remaining) [2024-11-19 09:54:37,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 81 remaining) [2024-11-19 09:54:37,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 81 remaining) [2024-11-19 09:54:37,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 81 remaining) [2024-11-19 09:54:37,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 81 remaining) [2024-11-19 09:54:37,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 81 remaining) [2024-11-19 09:54:37,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 81 remaining) [2024-11-19 09:54:37,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 81 remaining) [2024-11-19 09:54:37,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 81 remaining) [2024-11-19 09:54:37,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 09:54:37,790 INFO L407 BasicCegarLoop]: Path program histogram: [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] [2024-11-19 09:54:37,860 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:54:37,861 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:54:37,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:54:37 BasicIcfg [2024-11-19 09:54:37,866 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:54:37,867 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:54:37,867 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:54:37,867 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:54:37,867 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:53:20" (3/4) ... [2024-11-19 09:54:37,868 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 09:54:37,971 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 09:54:37,972 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:54:37,972 INFO L158 Benchmark]: Toolchain (without parser) took 79079.41ms. Allocated memory was 157.3MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 105.8MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 799.5MB. Max. memory is 16.1GB. [2024-11-19 09:54:37,973 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 58.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:54:37,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.56ms. Allocated memory is still 157.3MB. Free memory was 105.8MB in the beginning and 90.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 09:54:37,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.32ms. Allocated memory is still 157.3MB. Free memory was 90.0MB in the beginning and 128.0MB in the end (delta: -38.0MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2024-11-19 09:54:37,973 INFO L158 Benchmark]: Boogie Preprocessor took 146.61ms. Allocated memory is still 157.3MB. Free memory was 128.0MB in the beginning and 123.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:54:37,973 INFO L158 Benchmark]: RCFGBuilder took 1490.51ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 123.8MB in the beginning and 149.7MB in the end (delta: -25.9MB). Peak memory consumption was 97.5MB. Max. memory is 16.1GB. [2024-11-19 09:54:37,973 INFO L158 Benchmark]: TraceAbstraction took 76950.36ms. Allocated memory was 188.7MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 148.6MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 800.9MB. Max. memory is 16.1GB. [2024-11-19 09:54:37,974 INFO L158 Benchmark]: Witness Printer took 105.40ms. Allocated memory is still 5.1GB. Free memory was 4.2GB in the beginning and 4.2GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 09:54:37,975 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 58.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.56ms. Allocated memory is still 157.3MB. Free memory was 105.8MB in the beginning and 90.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.32ms. Allocated memory is still 157.3MB. Free memory was 90.0MB in the beginning and 128.0MB in the end (delta: -38.0MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 146.61ms. Allocated memory is still 157.3MB. Free memory was 128.0MB in the beginning and 123.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1490.51ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 123.8MB in the beginning and 149.7MB in the end (delta: -25.9MB). Peak memory consumption was 97.5MB. Max. memory is 16.1GB. * TraceAbstraction took 76950.36ms. Allocated memory was 188.7MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 148.6MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 800.9MB. Max. memory is 16.1GB. * Witness Printer took 105.40ms. Allocated memory is still 5.1GB. Free memory was 4.2GB in the beginning and 4.2GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L41] 0 int *produce, *update, *queue1, **consume; [L42] 0 _Bool *done; [L43] 0 int front1, size1, state11, state12, state21, state22; [L44] 0 int n_queue, n_produce, n_update, n1, n2; [L45] 0 _Bool finished1, finished2; [L105] 0 pthread_t t1, t2, t3; [L107] 0 front1 = __VERIFIER_nondet_int() [L108] 0 state11 = __VERIFIER_nondet_int() [L109] 0 state21 = state11 [L110] 0 state12 = __VERIFIER_nondet_int() [L111] 0 state22 = state12 [L113] 0 n_queue = __VERIFIER_nondet_int() [L114] 0 n_produce = __VERIFIER_nondet_int() [L115] 0 n_update = __VERIFIER_nondet_int() [L116] 0 n1 = __VERIFIER_nondet_int() [L117] 0 n2 = __VERIFIER_nondet_int() [L119] CALL, EXPR 0 create_fresh_int_array(n_produce) [L145] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L145] RET 0 assume_abort_if_not(size >= 0) [L146] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L146] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L148] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L149] 0 int i = 0; VAL [\old(size)=1, arr={-2:0}, consume={0:0}, done={0:0}, finished1=0, finished2=0, front1=0, i=0, n1=0, n2=0, n_produce=1, n_queue=1, n_update=1, produce={0:0}, queue1={0:0}, size1=0, size=1, state11=0, state12=3, state21=0, state22=3, update={0:0}] [L149] COND TRUE 0 i < size [L150] 0 arr[i] = __VERIFIER_nondet_int() [L149] 0 i++ VAL [\old(size)=1, arr={-2:0}, consume={0:0}, done={0:0}, finished1=0, finished2=0, front1=0, i=1, n1=0, n2=0, n_produce=1, n_queue=1, n_update=1, produce={0:0}, queue1={0:0}, size1=0, size=1, state11=0, state12=3, state21=0, state22=3, update={0:0}] [L149] COND FALSE 0 !(i < size) [L152] 0 return arr; [L119] RET, EXPR 0 create_fresh_int_array(n_produce) [L119] 0 produce = create_fresh_int_array(n_produce) [L120] CALL, EXPR 0 create_fresh_int_array(n_update) [L145] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L145] RET 0 assume_abort_if_not(size >= 0) [L146] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L146] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L148] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L149] 0 int i = 0; VAL [\old(size)=1, arr={-4:0}, consume={0:0}, done={0:0}, finished1=0, finished2=0, front1=0, i=0, n1=0, n2=0, n_produce=1, n_queue=1, n_update=1, produce={-2:0}, queue1={0:0}, size1=0, size=1, state11=0, state12=3, state21=0, state22=3, update={0:0}] [L149] COND TRUE 0 i < size [L150] 0 arr[i] = __VERIFIER_nondet_int() [L149] 0 i++ VAL [\old(size)=1, arr={-4:0}, consume={0:0}, done={0:0}, finished1=0, finished2=0, front1=0, i=1, n1=0, n2=0, n_produce=1, n_queue=1, n_update=1, produce={-2:0}, queue1={0:0}, size1=0, size=1, state11=0, state12=3, state21=0, state22=3, update={0:0}] [L149] COND FALSE 0 !(i < size) [L152] 0 return arr; [L120] RET, EXPR 0 create_fresh_int_array(n_update) [L120] 0 update = create_fresh_int_array(n_update) [L121] CALL, EXPR 0 create_fresh_int_array(n_queue) [L145] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L145] RET 0 assume_abort_if_not(size >= 0) [L146] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L146] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L148] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L149] 0 int i = 0; VAL [\old(size)=1, arr={-5:0}, consume={0:0}, done={0:0}, finished1=0, finished2=0, front1=0, i=0, n1=0, n2=0, n_produce=1, n_queue=1, n_update=1, produce={-2:0}, queue1={0:0}, size1=0, size=1, state11=0, state12=3, state21=0, state22=3, update={-4:0}] [L149] COND TRUE 0 i < size [L150] 0 arr[i] = __VERIFIER_nondet_int() [L149] 0 i++ VAL [\old(size)=1, arr={-5:0}, consume={0:0}, done={0:0}, finished1=0, finished2=0, front1=0, i=1, n1=0, n2=0, n_produce=1, n_queue=1, n_update=1, produce={-2:0}, queue1={0:0}, size1=0, size=1, state11=0, state12=3, state21=0, state22=3, update={-4:0}] [L149] COND FALSE 0 !(i < size) [L152] 0 return arr; [L121] RET, EXPR 0 create_fresh_int_array(n_queue) [L121] 0 queue1 = create_fresh_int_array(n_queue) [L122] CALL, EXPR 0 create_fresh_bool_array(n_update) [L156] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L156] RET 0 assume_abort_if_not(size >= 0) [L157] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(_Bool))) [L38] COND FALSE 0 !(!cond) [L157] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(_Bool))) [L159] 0 _Bool* arr = (_Bool*)malloc(sizeof(_Bool) * (size_t)size); [L160] 0 int i = 0; VAL [\old(size)=1, arr={-6:0}, consume={0:0}, done={0:0}, finished1=0, finished2=0, front1=0, i=0, n1=0, n2=0, n_produce=1, n_queue=1, n_update=1, produce={-2:0}, queue1={-5:0}, size1=0, size=1, state11=0, state12=3, state21=0, state22=3, update={-4:0}] [L160] COND TRUE 0 i < size [L161] 0 arr[i] = __VERIFIER_nondet_bool() [L160] 0 i++ VAL [\old(size)=1, arr={-6:0}, consume={0:0}, done={0:0}, finished1=0, finished2=0, front1=0, i=1, n1=0, n2=0, n_produce=1, n_queue=1, n_update=1, produce={-2:0}, queue1={-5:0}, size1=0, size=1, state11=0, state12=3, state21=0, state22=3, update={-4:0}] [L160] COND FALSE 0 !(i < size) [L163] 0 return arr; [L122] RET, EXPR 0 create_fresh_bool_array(n_update) [L122] 0 done = create_fresh_bool_array(n_update) [L123] CALL 0 assume_abort_if_not(n1 >= 0) [L38] COND FALSE 0 !(!cond) [L123] RET 0 assume_abort_if_not(n1 >= 0) [L124] CALL 0 assume_abort_if_not(n1 <= (((size_t) 4294967295) / sizeof(int*))) [L38] COND FALSE 0 !(!cond) [L124] RET 0 assume_abort_if_not(n1 <= (((size_t) 4294967295) / sizeof(int*))) [L125] 0 consume = (int**)malloc(sizeof(int*) * (size_t)n1) [L126] 0 int i=0; VAL [consume={-7:0}, done={-6:0}, finished1=0, finished2=0, front1=0, i=0, n1=0, n2=0, n_produce=1, n_queue=1, n_update=1, produce={-2:0}, queue1={-5:0}, size1=0, state11=0, state12=3, state21=0, state22=3, update={-4:0}] [L126] COND FALSE 0 !(i= 0 && front1+size1 < n_queue) [L38] COND FALSE 1 !(!cond) [L53] RET 1 assume_abort_if_not(front1+size1 >= 0 && front1+size1 < n_queue) [L54] CALL 1 assume_abort_if_not(state11 >= 0 && state11 < n_produce) [L38] COND FALSE 1 !(!cond) [L54] RET 1 assume_abort_if_not(state11 >= 0 && state11 < n_produce) [L55] EXPR 1 queue1[front1+size1] [L55] EXPR 1 produce[state11] [L55] CALL 1 assume_abort_if_not(queue1[front1+size1] == produce[state11]) [L38] COND FALSE 1 !(!cond) [L55] RET 1 assume_abort_if_not(queue1[front1+size1] == produce[state11]) [L56] 1 size1++ VAL [\old(_argptr)={0:0}, _argptr={0:0}, consume={-7:0}, done={-6:0}, finished1=0, finished2=0, front1=0, n1=0, n2=0, n_produce=1, n_queue=1, n_update=1, produce={-2:0}, queue1={-5:0}, size1=1, state11=0, state12=3, state21=0, state22=3, update={-4:0}] [L58] CALL 1 assume_abort_if_not(state11 >= 0 && state11 < n_update) [L38] COND FALSE 1 !(!cond) [L58] RET 1 assume_abort_if_not(state11 >= 0 && state11 < n_update) [L59] EXPR 1 update[state11] [L59] 1 state11 = update[state11] [L61] 1 done[state11] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 131]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 132]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 157 locations, 81 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 76.7s, OverallIterations: 29, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 60.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6727 SdHoareTripleChecker+Valid, 13.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5826 mSDsluCounter, 1914 SdHoareTripleChecker+Invalid, 11.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1816 mSDsCounter, 351 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20258 IncrementalHoareTripleChecker+Invalid, 20609 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 351 mSolverCounterUnsat, 98 mSDtfsCounter, 20258 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 475 GetRequests, 170 SyntacticMatches, 5 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3674occurred in iteration=28, InterpolantAutomatonStates: 194, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 525 ConstructedInterpolants, 37 QuantifiedInterpolants, 7368 SizeOfPredicates, 69 NumberOfNonLiveVariables, 2938 ConjunctsInSsa, 263 ConjunctsInUnsatCore, 52 InterpolantComputations, 19 PerfectInterpolantSequences, 49/111 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-19 09:54:38,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...