./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-prod-cons.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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.wvr.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 7225a3dc80a635bdf8bc0a0aebf3fff6c385d87e3635c30eb2fdc2ad9b10efb0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:55:23,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:55:23,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:55:24,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:55:24,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:55:24,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:55:24,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:55:24,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:55:24,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:55:24,040 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:55:24,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:55:24,041 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:55:24,041 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:55:24,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:55:24,044 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:55:24,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:55:24,045 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:55:24,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:55:24,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:55:24,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:55:24,046 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:55:24,047 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:55:24,047 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:55:24,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:55:24,047 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:55:24,047 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:55:24,048 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:55:24,048 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:55:24,048 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:55:24,048 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:55:24,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:55:24,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:55:24,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:55:24,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:55:24,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:55:24,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:55:24,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:55:24,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:55:24,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:55:24,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:55:24,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:55:24,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:55:24,056 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 -> 7225a3dc80a635bdf8bc0a0aebf3fff6c385d87e3635c30eb2fdc2ad9b10efb0 [2024-11-09 10:55:24,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:55:24,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:55:24,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:55:24,252 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:55:24,253 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:55:24,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-prod-cons.wvr.c [2024-11-09 10:55:25,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:55:25,842 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:55:25,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons.wvr.c [2024-11-09 10:55:25,849 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/832887a78/3f67d4b8b11a4fe1b63e43703e1a1e65/FLAGbe09a6fb2 [2024-11-09 10:55:25,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/832887a78/3f67d4b8b11a4fe1b63e43703e1a1e65 [2024-11-09 10:55:25,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:55:25,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:55:25,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:55:25,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:55:25,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:55:25,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:55:25" (1/1) ... [2024-11-09 10:55:25,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e610a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:25, skipping insertion in model container [2024-11-09 10:55:25,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:55:25" (1/1) ... [2024-11-09 10:55:25,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:55:26,038 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-09 10:55:26,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:55:26,047 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:55:26,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:55:26,125 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:55:26,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:26 WrapperNode [2024-11-09 10:55:26,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:55:26,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:55:26,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:55:26,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:55:26,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:26" (1/1) ... [2024-11-09 10:55:26,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:26" (1/1) ... [2024-11-09 10:55:26,175 INFO L138 Inliner]: procedures = 24, calls = 36, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 158 [2024-11-09 10:55:26,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:55:26,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:55:26,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:55:26,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:55:26,187 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:26" (1/1) ... [2024-11-09 10:55:26,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:26" (1/1) ... [2024-11-09 10:55:26,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:26" (1/1) ... [2024-11-09 10:55:26,201 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-09 10:55:26,201 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:26" (1/1) ... [2024-11-09 10:55:26,201 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:26" (1/1) ... [2024-11-09 10:55:26,206 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:26" (1/1) ... [2024-11-09 10:55:26,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:26" (1/1) ... [2024-11-09 10:55:26,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:26" (1/1) ... [2024-11-09 10:55:26,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:26" (1/1) ... [2024-11-09 10:55:26,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:55:26,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:55:26,213 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:55:26,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:55:26,214 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:26" (1/1) ... [2024-11-09 10:55:26,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:55:26,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:55:26,251 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-09 10:55:26,253 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-09 10:55:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:55:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 10:55:26,285 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 10:55:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 10:55:26,285 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 10:55:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 10:55:26,286 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 10:55:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:55:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:55:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:55:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:55:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:55:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:55:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:55:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:55:26,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:55:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:55:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:55:26,288 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:55:26,362 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:55:26,364 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:55:26,573 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:55:26,574 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:55:26,789 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:55:26,789 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 10:55:26,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:55:26 BoogieIcfgContainer [2024-11-09 10:55:26,790 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:55:26,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:55:26,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:55:26,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:55:26,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:55:25" (1/3) ... [2024-11-09 10:55:26,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e06247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:55:26, skipping insertion in model container [2024-11-09 10:55:26,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:26" (2/3) ... [2024-11-09 10:55:26,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e06247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:55:26, skipping insertion in model container [2024-11-09 10:55:26,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:55:26" (3/3) ... [2024-11-09 10:55:26,800 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons.wvr.c [2024-11-09 10:55:26,815 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:55:26,815 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-09 10:55:26,816 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:55:26,863 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 10:55:26,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 113 flow [2024-11-09 10:55:26,914 INFO L124 PetriNetUnfolderBase]: 4/43 cut-off events. [2024-11-09 10:55:26,914 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 10:55:26,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 43 events. 4/43 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 96 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2024-11-09 10:55:26,918 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 46 transitions, 113 flow [2024-11-09 10:55:26,920 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 42 transitions, 102 flow [2024-11-09 10:55:26,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:55:26,934 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;@2a391a20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:55:26,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-09 10:55:26,936 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:55:26,936 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-09 10:55:26,937 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:55:26,937 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:26,937 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:55:26,938 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 10:55:26,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:26,941 INFO L85 PathProgramCache]: Analyzing trace with hash 476732, now seen corresponding path program 1 times [2024-11-09 10:55:26,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:26,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962502383] [2024-11-09 10:55:26,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:26,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:27,158 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-09 10:55:27,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:27,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962502383] [2024-11-09 10:55:27,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962502383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:27,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:27,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:55:27,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872585882] [2024-11-09 10:55:27,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:27,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:55:27,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:27,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:55:27,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:55:27,204 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-11-09 10:55:27,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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-09 10:55:27,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:27,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-11-09 10:55:27,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:27,421 INFO L124 PetriNetUnfolderBase]: 503/898 cut-off events. [2024-11-09 10:55:27,422 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-09 10:55:27,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1798 conditions, 898 events. 503/898 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5629 event pairs, 456 based on Foata normal form. 1/658 useless extension candidates. Maximal degree in co-relation 1698. Up to 778 conditions per place. [2024-11-09 10:55:27,435 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 25 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2024-11-09 10:55:27,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 150 flow [2024-11-09 10:55:27,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:55:27,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:55:27,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-11-09 10:55:27,446 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5579710144927537 [2024-11-09 10:55:27,447 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 102 flow. Second operand 3 states and 77 transitions. [2024-11-09 10:55:27,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 150 flow [2024-11-09 10:55:27,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 138 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 10:55:27,454 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 88 flow [2024-11-09 10:55:27,455 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2024-11-09 10:55:27,458 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2024-11-09 10:55:27,458 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 88 flow [2024-11-09 10:55:27,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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-09 10:55:27,459 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:27,459 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:55:27,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:55:27,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 10:55:27,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:27,460 INFO L85 PathProgramCache]: Analyzing trace with hash 476733, now seen corresponding path program 1 times [2024-11-09 10:55:27,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:27,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666738396] [2024-11-09 10:55:27,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:27,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:27,661 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-09 10:55:27,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:27,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666738396] [2024-11-09 10:55:27,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666738396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:27,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:27,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:55:27,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580920115] [2024-11-09 10:55:27,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:27,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:55:27,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:27,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:55:27,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:55:27,673 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-11-09 10:55:27,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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-09 10:55:27,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:27,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-11-09 10:55:27,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:27,843 INFO L124 PetriNetUnfolderBase]: 504/901 cut-off events. [2024-11-09 10:55:27,843 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:55:27,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1741 conditions, 901 events. 504/901 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5649 event pairs, 456 based on Foata normal form. 0/660 useless extension candidates. Maximal degree in co-relation 1719. Up to 783 conditions per place. [2024-11-09 10:55:27,854 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 27 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-11-09 10:55:27,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 158 flow [2024-11-09 10:55:27,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:55:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:55:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2024-11-09 10:55:27,857 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2024-11-09 10:55:27,857 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 88 flow. Second operand 4 states and 96 transitions. [2024-11-09 10:55:27,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 158 flow [2024-11-09 10:55:27,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:55:27,860 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 111 flow [2024-11-09 10:55:27,861 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2024-11-09 10:55:27,862 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2024-11-09 10:55:27,862 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 111 flow [2024-11-09 10:55:27,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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-09 10:55:27,862 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:27,862 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-09 10:55:27,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:55:27,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 10:55:27,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:27,864 INFO L85 PathProgramCache]: Analyzing trace with hash 458154905, now seen corresponding path program 1 times [2024-11-09 10:55:27,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:27,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318391994] [2024-11-09 10:55:27,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:27,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:28,068 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-09 10:55:28,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:28,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318391994] [2024-11-09 10:55:28,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318391994] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:55:28,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170614135] [2024-11-09 10:55:28,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:28,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:28,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:55:28,076 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-09 10:55:28,081 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-09 10:55:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:28,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:55:28,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:55:28,207 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-09 10:55:28,386 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-09 10:55:28,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:55:28,491 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-09 10:55:28,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170614135] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:55:28,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:55:28,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-11-09 10:55:28,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499404315] [2024-11-09 10:55:28,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:55:28,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 10:55:28,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:28,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 10:55:28,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:55:28,538 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-11-09 10:55:28,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 111 flow. Second operand has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 0 states have call successors, (0), 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-09 10:55:28,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:28,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-11-09 10:55:28,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:28,807 INFO L124 PetriNetUnfolderBase]: 504/900 cut-off events. [2024-11-09 10:55:28,807 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:55:28,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1748 conditions, 900 events. 504/900 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5626 event pairs, 456 based on Foata normal form. 0/659 useless extension candidates. Maximal degree in co-relation 1726. Up to 779 conditions per place. [2024-11-09 10:55:28,812 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 23 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2024-11-09 10:55:28,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 167 flow [2024-11-09 10:55:28,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:55:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:55:28,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2024-11-09 10:55:28,814 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4601449275362319 [2024-11-09 10:55:28,816 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 111 flow. Second operand 6 states and 127 transitions. [2024-11-09 10:55:28,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 167 flow [2024-11-09 10:55:28,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 41 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:55:28,817 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 118 flow [2024-11-09 10:55:28,817 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2024-11-09 10:55:28,818 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2024-11-09 10:55:28,818 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 118 flow [2024-11-09 10:55:28,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 0 states have call successors, (0), 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-09 10:55:28,818 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:28,818 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:28,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 10:55:29,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:29,021 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 10:55:29,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:29,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1146846480, now seen corresponding path program 1 times [2024-11-09 10:55:29,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:29,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610571900] [2024-11-09 10:55:29,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:29,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:29,103 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-09 10:55:29,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:29,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610571900] [2024-11-09 10:55:29,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610571900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:29,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:29,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:55:29,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288112599] [2024-11-09 10:55:29,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:29,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:55:29,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:29,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:55:29,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:55:29,111 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-11-09 10:55:29,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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-09 10:55:29,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:29,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-11-09 10:55:29,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:29,179 INFO L124 PetriNetUnfolderBase]: 360/653 cut-off events. [2024-11-09 10:55:29,180 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:55:29,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 653 events. 360/653 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3677 event pairs, 319 based on Foata normal form. 0/522 useless extension candidates. Maximal degree in co-relation 1248. Up to 559 conditions per place. [2024-11-09 10:55:29,183 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 25 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2024-11-09 10:55:29,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 39 transitions, 170 flow [2024-11-09 10:55:29,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:55:29,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:55:29,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2024-11-09 10:55:29,184 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4945652173913043 [2024-11-09 10:55:29,184 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 118 flow. Second operand 4 states and 91 transitions. [2024-11-09 10:55:29,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 39 transitions, 170 flow [2024-11-09 10:55:29,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 140 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-11-09 10:55:29,185 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 90 flow [2024-11-09 10:55:29,185 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2024-11-09 10:55:29,185 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2024-11-09 10:55:29,186 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 90 flow [2024-11-09 10:55:29,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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-09 10:55:29,186 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:29,186 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:29,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:55:29,186 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 10:55:29,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:29,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1146846481, now seen corresponding path program 1 times [2024-11-09 10:55:29,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:29,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523443022] [2024-11-09 10:55:29,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:29,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:29,236 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-09 10:55:29,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:29,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523443022] [2024-11-09 10:55:29,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523443022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:29,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:29,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:55:29,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130116906] [2024-11-09 10:55:29,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:29,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:55:29,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:29,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:55:29,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:55:29,244 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-09 10:55:29,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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-09 10:55:29,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:29,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-09 10:55:29,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:29,396 INFO L124 PetriNetUnfolderBase]: 478/899 cut-off events. [2024-11-09 10:55:29,397 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:55:29,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 899 events. 478/899 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5261 event pairs, 436 based on Foata normal form. 33/800 useless extension candidates. Maximal degree in co-relation 1240. Up to 562 conditions per place. [2024-11-09 10:55:29,404 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 41 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2024-11-09 10:55:29,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 216 flow [2024-11-09 10:55:29,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:55:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:55:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-11-09 10:55:29,409 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6304347826086957 [2024-11-09 10:55:29,409 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 90 flow. Second operand 4 states and 116 transitions. [2024-11-09 10:55:29,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 216 flow [2024-11-09 10:55:29,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:55:29,411 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 101 flow [2024-11-09 10:55:29,411 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2024-11-09 10:55:29,411 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2024-11-09 10:55:29,411 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 101 flow [2024-11-09 10:55:29,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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-09 10:55:29,412 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:29,412 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:29,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:55:29,412 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 10:55:29,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:29,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1555310283, now seen corresponding path program 1 times [2024-11-09 10:55:29,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:29,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142353990] [2024-11-09 10:55:29,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:29,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:29,578 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-09 10:55:29,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:29,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142353990] [2024-11-09 10:55:29,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142353990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:55:29,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69743147] [2024-11-09 10:55:29,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:29,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:29,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:55:29,580 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-09 10:55:29,581 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-09 10:55:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:29,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 10:55:29,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:55:29,727 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-09 10:55:29,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:55:29,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69743147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:29,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 10:55:29,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2024-11-09 10:55:29,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370254478] [2024-11-09 10:55:29,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:29,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:55:29,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:29,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:55:29,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:55:29,736 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-09 10:55:29,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 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-09 10:55:29,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:29,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-09 10:55:29,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:29,821 INFO L124 PetriNetUnfolderBase]: 358/692 cut-off events. [2024-11-09 10:55:29,822 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-11-09 10:55:29,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 692 events. 358/692 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3741 event pairs, 323 based on Foata normal form. 0/624 useless extension candidates. Maximal degree in co-relation 904. Up to 583 conditions per place. [2024-11-09 10:55:29,825 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 23 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2024-11-09 10:55:29,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 37 transitions, 145 flow [2024-11-09 10:55:29,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:55:29,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:55:29,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-11-09 10:55:29,826 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5054347826086957 [2024-11-09 10:55:29,827 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 101 flow. Second operand 4 states and 93 transitions. [2024-11-09 10:55:29,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 37 transitions, 145 flow [2024-11-09 10:55:29,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:55:29,828 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 94 flow [2024-11-09 10:55:29,828 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-11-09 10:55:29,828 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places. [2024-11-09 10:55:29,829 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 94 flow [2024-11-09 10:55:29,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 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-09 10:55:29,829 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:29,829 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:29,843 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-09 10:55:30,033 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-09 10:55:30,034 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 10:55:30,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:30,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2108408073, now seen corresponding path program 1 times [2024-11-09 10:55:30,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:30,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492535809] [2024-11-09 10:55:30,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:30,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:30,091 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-09 10:55:30,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:30,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492535809] [2024-11-09 10:55:30,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492535809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:30,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:30,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:55:30,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898204977] [2024-11-09 10:55:30,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:30,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:55:30,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:30,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:55:30,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:55:30,100 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2024-11-09 10:55:30,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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-09 10:55:30,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:30,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2024-11-09 10:55:30,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:30,215 INFO L124 PetriNetUnfolderBase]: 718/1282 cut-off events. [2024-11-09 10:55:30,215 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2024-11-09 10:55:30,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2571 conditions, 1282 events. 718/1282 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6546 event pairs, 145 based on Foata normal form. 78/1333 useless extension candidates. Maximal degree in co-relation 1748. Up to 576 conditions per place. [2024-11-09 10:55:30,221 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 55 selfloop transitions, 5 changer transitions 0/68 dead transitions. [2024-11-09 10:55:30,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 68 transitions, 290 flow [2024-11-09 10:55:30,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:55:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:55:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2024-11-09 10:55:30,222 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5608695652173913 [2024-11-09 10:55:30,222 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 94 flow. Second operand 5 states and 129 transitions. [2024-11-09 10:55:30,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 68 transitions, 290 flow [2024-11-09 10:55:30,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 68 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:55:30,223 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 121 flow [2024-11-09 10:55:30,223 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2024-11-09 10:55:30,224 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2024-11-09 10:55:30,224 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 121 flow [2024-11-09 10:55:30,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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-09 10:55:30,224 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:30,224 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:30,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:55:30,225 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 10:55:30,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:30,225 INFO L85 PathProgramCache]: Analyzing trace with hash 253174661, now seen corresponding path program 2 times [2024-11-09 10:55:30,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:30,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085737645] [2024-11-09 10:55:30,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:30,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:30,369 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-09 10:55:30,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:30,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085737645] [2024-11-09 10:55:30,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085737645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:30,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:30,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:55:30,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328359499] [2024-11-09 10:55:30,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:30,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:55:30,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:30,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:55:30,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:55:30,383 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-11-09 10:55:30,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 121 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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-09 10:55:30,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:30,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-11-09 10:55:30,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:30,569 INFO L124 PetriNetUnfolderBase]: 1131/1929 cut-off events. [2024-11-09 10:55:30,569 INFO L125 PetriNetUnfolderBase]: For 728/750 co-relation queries the response was YES. [2024-11-09 10:55:30,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4481 conditions, 1929 events. 1131/1929 cut-off events. For 728/750 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10486 event pairs, 509 based on Foata normal form. 25/1863 useless extension candidates. Maximal degree in co-relation 3765. Up to 840 conditions per place. [2024-11-09 10:55:30,578 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 49 selfloop transitions, 4 changer transitions 5/69 dead transitions. [2024-11-09 10:55:30,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 322 flow [2024-11-09 10:55:30,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:55:30,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:55:30,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2024-11-09 10:55:30,579 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5695652173913044 [2024-11-09 10:55:30,579 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 121 flow. Second operand 5 states and 131 transitions. [2024-11-09 10:55:30,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 69 transitions, 322 flow [2024-11-09 10:55:30,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 319 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:55:30,581 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 140 flow [2024-11-09 10:55:30,581 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-11-09 10:55:30,582 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2024-11-09 10:55:30,582 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 140 flow [2024-11-09 10:55:30,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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-09 10:55:30,582 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:30,583 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:30,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:55:30,583 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 10:55:30,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:30,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1541404730, now seen corresponding path program 1 times [2024-11-09 10:55:30,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:30,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749249002] [2024-11-09 10:55:30,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:30,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:30,640 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-09 10:55:30,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:30,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749249002] [2024-11-09 10:55:30,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749249002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:30,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:30,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:55:30,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425251171] [2024-11-09 10:55:30,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:30,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:55:30,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:30,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:55:30,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:55:30,642 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-09 10:55:30,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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-09 10:55:30,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:30,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-09 10:55:30,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:30,733 INFO L124 PetriNetUnfolderBase]: 647/1258 cut-off events. [2024-11-09 10:55:30,734 INFO L125 PetriNetUnfolderBase]: For 488/532 co-relation queries the response was YES. [2024-11-09 10:55:30,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2840 conditions, 1258 events. 647/1258 cut-off events. For 488/532 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7062 event pairs, 266 based on Foata normal form. 45/1190 useless extension candidates. Maximal degree in co-relation 2814. Up to 716 conditions per place. [2024-11-09 10:55:30,739 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 30 selfloop transitions, 2 changer transitions 7/55 dead transitions. [2024-11-09 10:55:30,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 55 transitions, 257 flow [2024-11-09 10:55:30,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:55:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:55:30,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-11-09 10:55:30,740 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.644927536231884 [2024-11-09 10:55:30,740 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 140 flow. Second operand 3 states and 89 transitions. [2024-11-09 10:55:30,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 55 transitions, 257 flow [2024-11-09 10:55:30,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 55 transitions, 253 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:55:30,742 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 150 flow [2024-11-09 10:55:30,742 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2024-11-09 10:55:30,743 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2024-11-09 10:55:30,743 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 150 flow [2024-11-09 10:55:30,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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-09 10:55:30,743 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:30,743 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:30,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:55:30,759 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 10:55:30,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:30,760 INFO L85 PathProgramCache]: Analyzing trace with hash -844247355, now seen corresponding path program 1 times [2024-11-09 10:55:30,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:30,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998771006] [2024-11-09 10:55:30,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:30,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:31,201 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-09 10:55:31,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:31,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998771006] [2024-11-09 10:55:31,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998771006] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:55:31,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607562780] [2024-11-09 10:55:31,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:31,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:31,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:55:31,206 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-09 10:55:31,207 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-09 10:55:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:31,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 10:55:31,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:55:31,658 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-09 10:55:31,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:55:31,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:55:31,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2024-11-09 10:55:32,056 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-09 10:55:32,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607562780] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:55:32,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:55:32,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-11-09 10:55:32,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730656540] [2024-11-09 10:55:32,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:55:32,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 10:55:32,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:32,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 10:55:32,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2024-11-09 10:55:32,187 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2024-11-09 10:55:32,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 150 flow. Second operand has 28 states, 28 states have (on average 16.785714285714285) internal successors, (470), 28 states have internal predecessors, (470), 0 states have call successors, (0), 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-09 10:55:32,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:32,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2024-11-09 10:55:32,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:34,525 INFO L124 PetriNetUnfolderBase]: 4762/8040 cut-off events. [2024-11-09 10:55:34,526 INFO L125 PetriNetUnfolderBase]: For 5789/5906 co-relation queries the response was YES. [2024-11-09 10:55:34,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20282 conditions, 8040 events. 4762/8040 cut-off events. For 5789/5906 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 53521 event pairs, 320 based on Foata normal form. 110/7575 useless extension candidates. Maximal degree in co-relation 11775. Up to 1018 conditions per place. [2024-11-09 10:55:34,555 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 205 selfloop transitions, 54 changer transitions 175/443 dead transitions. [2024-11-09 10:55:34,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 443 transitions, 2359 flow [2024-11-09 10:55:34,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-09 10:55:34,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2024-11-09 10:55:34,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 997 transitions. [2024-11-09 10:55:34,558 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5286320254506893 [2024-11-09 10:55:34,558 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 150 flow. Second operand 41 states and 997 transitions. [2024-11-09 10:55:34,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 443 transitions, 2359 flow [2024-11-09 10:55:34,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 443 transitions, 2285 flow, removed 35 selfloop flow, removed 2 redundant places. [2024-11-09 10:55:34,566 INFO L231 Difference]: Finished difference. Result has 109 places, 100 transitions, 580 flow [2024-11-09 10:55:34,566 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=580, PETRI_PLACES=109, PETRI_TRANSITIONS=100} [2024-11-09 10:55:34,566 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 61 predicate places. [2024-11-09 10:55:34,567 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 100 transitions, 580 flow [2024-11-09 10:55:34,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 16.785714285714285) internal successors, (470), 28 states have internal predecessors, (470), 0 states have call successors, (0), 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-09 10:55:34,567 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:34,567 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:34,581 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-09 10:55:34,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:34,772 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 10:55:34,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:34,772 INFO L85 PathProgramCache]: Analyzing trace with hash -793771378, now seen corresponding path program 2 times [2024-11-09 10:55:34,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:34,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811249167] [2024-11-09 10:55:34,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:34,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:34,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:34,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:34,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811249167] [2024-11-09 10:55:34,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811249167] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:55:34,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602817977] [2024-11-09 10:55:34,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:55:34,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:34,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:55:34,986 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-09 10:55:34,991 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-09 10:55:35,062 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:55:35,062 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:55:35,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:55:35,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:55:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:35,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:55:35,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:35,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602817977] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:55:35,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:55:35,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2024-11-09 10:55:35,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722041317] [2024-11-09 10:55:35,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:55:35,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 10:55:35,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:35,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 10:55:35,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-11-09 10:55:35,362 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-09 10:55:35,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 100 transitions, 580 flow. Second operand has 17 states, 17 states have (on average 20.647058823529413) internal successors, (351), 17 states have internal predecessors, (351), 0 states have call successors, (0), 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-09 10:55:35,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:35,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-09 10:55:35,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:35,848 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L48-7-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_7|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#res#1.base][113], [Black: 408#(and (= ~v_assert~0 1) (or (< ~back~0 0) (< ~d~0 ~W~0) (< ~n~0 (+ ~back~0 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1)) (or (< ~back~0 0) (and (= ~back~0 ~front~0) (<= ~d~0 0)) (< ~n~0 (+ ~back~0 1)))), Black: 424#(and (<= (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) ~W~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0)))), Black: 436#(and (= ~d~0 0) (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= ~front~0 0) (<= 1 ~W~0) (or (< ~back~0 0) (= ~back~0 0) (< ~n~0 (+ ~back~0 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1))), Black: 452#(and (<= (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) ~W~0) (<= ~d~0 ~W~0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0)))), Black: 418#(and (= ~d~0 0) (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= ~v_assert~0 1) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= ~front~0 0) (<= 1 ~W~0)), Black: 428#(and (= ~d~0 0) (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= ~front~0 0) (<= 1 ~W~0)), Black: 462#(and (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0)))), Black: 422#(and (= |thread2Thread1of1ForFork1_~temp~0#1| 1) (or (and (= ~queue~0.offset 0) (= ~front~0 0)) (not (= ~back~0 0))) (= ~d~0 0) (= ~v_assert~0 1) (or (< ~back~0 1) (< ~n~0 2)) (<= 1 ~W~0) (or (not (= ~back~0 0)) (< |thread1Thread1of1ForFork0_~w~0#1| (+ ~W~0 1)))), Black: 434#(and (<= ~d~0 1) (= ~v_assert~0 1) (<= 1 ~W~0)), Black: 410#(and (= ~v_assert~0 1) (or (< ~back~0 0) (< ~d~0 ~W~0) (< ~n~0 (+ ~back~0 1))) (or (< ~back~0 0) (and (= ~back~0 ~front~0) (<= ~d~0 0)) (< ~n~0 (+ ~back~0 1)))), Black: 414#(and (= ~d~0 0) (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= ~v_assert~0 1) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= ~front~0 0) (<= 1 ~W~0) (or (not (= ~back~0 0)) (< |thread1Thread1of1ForFork0_~w~0#1| (+ ~W~0 1)))), Black: 432#(and (<= (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) ~W~0) (<= ~d~0 ~W~0)), Black: 154#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 156#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 1)), Black: 398#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (= ~d~0 0) (not (= ~back~0 0))) (<= ~d~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 153#(= ~v_assert~0 1), Black: 404#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~w~0#1| ~W~0) (or (= ~d~0 0) (not (= ~back~0 0))) (<= ~d~0 ~W~0) (= ~queue~0.offset 0) (<= ~d~0 0) (<= ~n~0 1)), Black: 420#(and (or (< ~back~0 0) (< ~d~0 ~W~0) (< ~n~0 (+ ~back~0 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1)) (or (< ~back~0 0) (and (= ~back~0 ~front~0) (<= ~d~0 0)) (< ~n~0 (+ ~back~0 1)))), Black: 448#(and (= ~v_assert~0 1) (<= ~d~0 ~W~0)), Black: 416#(and (<= (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) ~W~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0)), Black: 402#(and (= ~v_assert~0 1) (or (< ~back~0 0) (and (= ~back~0 ~front~0) (<= ~d~0 0)) (< ~n~0 (+ ~back~0 1)))), 110#(= (select |#valid| ~queue~0.base) 1), 3#L78true, Black: 164#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 269#(= ~v_assert~0 1), 484#true, Black: 168#(and (<= 1 ~v_assert~0) (= ~d~0 0) (<= (div ~v_assert~0 256) 0) (<= 0 ~W~0)), Black: 173#(= ~back~0 ~front~0), 40#L110-4true, 12#thread1EXITtrue, 35#thread3EXITtrue, 135#(and (<= 0 ~queue~0.offset) (<= (+ (* ~n~0 4) ~queue~0.offset) (select |#length| ~queue~0.base)))]) [2024-11-09 10:55:35,848 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-09 10:55:35,849 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:55:35,849 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:55:35,849 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-09 10:55:35,857 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L48-7-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_7|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#res#1.base][113], [32#L111true, Black: 408#(and (= ~v_assert~0 1) (or (< ~back~0 0) (< ~d~0 ~W~0) (< ~n~0 (+ ~back~0 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1)) (or (< ~back~0 0) (and (= ~back~0 ~front~0) (<= ~d~0 0)) (< ~n~0 (+ ~back~0 1)))), Black: 424#(and (<= (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) ~W~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0)))), Black: 436#(and (= ~d~0 0) (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= ~front~0 0) (<= 1 ~W~0) (or (< ~back~0 0) (= ~back~0 0) (< ~n~0 (+ ~back~0 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1))), Black: 452#(and (<= (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) ~W~0) (<= ~d~0 ~W~0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0)))), Black: 418#(and (= ~d~0 0) (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= ~v_assert~0 1) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= ~front~0 0) (<= 1 ~W~0)), Black: 428#(and (= ~d~0 0) (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= ~v_assert~0 1) (= ~queue~0.offset 0) (= ~front~0 0) (<= 1 ~W~0)), Black: 462#(and (= ~v_assert~0 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1) (and (= ~back~0 ~front~0) (<= (+ ~d~0 1) ~W~0)))), Black: 422#(and (= |thread2Thread1of1ForFork1_~temp~0#1| 1) (or (and (= ~queue~0.offset 0) (= ~front~0 0)) (not (= ~back~0 0))) (= ~d~0 0) (= ~v_assert~0 1) (or (< ~back~0 1) (< ~n~0 2)) (<= 1 ~W~0) (or (not (= ~back~0 0)) (< |thread1Thread1of1ForFork0_~w~0#1| (+ ~W~0 1)))), Black: 434#(and (<= ~d~0 1) (= ~v_assert~0 1) (<= 1 ~W~0)), Black: 410#(and (= ~v_assert~0 1) (or (< ~back~0 0) (< ~d~0 ~W~0) (< ~n~0 (+ ~back~0 1))) (or (< ~back~0 0) (and (= ~back~0 ~front~0) (<= ~d~0 0)) (< ~n~0 (+ ~back~0 1)))), Black: 414#(and (= ~d~0 0) (= (select (select |#memory_int#1| ~queue~0.base) 0) 1) (= ~v_assert~0 1) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= ~front~0 0) (<= 1 ~W~0) (or (not (= ~back~0 0)) (< |thread1Thread1of1ForFork0_~w~0#1| (+ ~W~0 1)))), Black: 432#(and (<= (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) ~W~0) (<= ~d~0 ~W~0)), Black: 154#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 156#(and (<= (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 1)), Black: 398#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~v_assert~0 1) (or (= ~d~0 0) (not (= ~back~0 0))) (<= ~d~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 153#(= ~v_assert~0 1), Black: 404#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~w~0#1| ~W~0) (or (= ~d~0 0) (not (= ~back~0 0))) (<= ~d~0 ~W~0) (= ~queue~0.offset 0) (<= ~d~0 0) (<= ~n~0 1)), Black: 420#(and (or (< ~back~0 0) (< ~d~0 ~W~0) (< ~n~0 (+ ~back~0 1)) (< |thread1Thread1of1ForFork0_~w~0#1| 1)) (or (< ~back~0 0) (and (= ~back~0 ~front~0) (<= ~d~0 0)) (< ~n~0 (+ ~back~0 1)))), Black: 448#(and (= ~v_assert~0 1) (<= ~d~0 ~W~0)), Black: 416#(and (<= (+ ~d~0 (select (select |#memory_int#1| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) ~W~0) (= ~v_assert~0 1) (<= ~d~0 ~W~0)), Black: 402#(and (= ~v_assert~0 1) (or (< ~back~0 0) (and (= ~back~0 ~front~0) (<= ~d~0 0)) (< ~n~0 (+ ~back~0 1)))), 110#(= (select |#valid| ~queue~0.base) 1), 3#L78true, Black: 164#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 269#(= ~v_assert~0 1), Black: 168#(and (<= 1 ~v_assert~0) (= ~d~0 0) (<= (div ~v_assert~0 256) 0) (<= 0 ~W~0)), 484#true, Black: 173#(= ~back~0 ~front~0), 35#thread3EXITtrue, 12#thread1EXITtrue, 135#(and (<= 0 ~queue~0.offset) (<= (+ (* ~n~0 4) ~queue~0.offset) (select |#length| ~queue~0.base)))]) [2024-11-09 10:55:35,857 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-09 10:55:35,857 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-09 10:55:35,857 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-09 10:55:35,858 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-09 10:55:35,869 INFO L124 PetriNetUnfolderBase]: 1871/3500 cut-off events. [2024-11-09 10:55:35,871 INFO L125 PetriNetUnfolderBase]: For 15734/15862 co-relation queries the response was YES. [2024-11-09 10:55:35,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11532 conditions, 3500 events. 1871/3500 cut-off events. For 15734/15862 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 23074 event pairs, 445 based on Foata normal form. 140/3330 useless extension candidates. Maximal degree in co-relation 10046. Up to 1547 conditions per place. [2024-11-09 10:55:35,892 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 43 selfloop transitions, 6 changer transitions 60/133 dead transitions. [2024-11-09 10:55:35,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 133 transitions, 867 flow [2024-11-09 10:55:35,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:55:35,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 10:55:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2024-11-09 10:55:35,893 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5410628019323671 [2024-11-09 10:55:35,894 INFO L175 Difference]: Start difference. First operand has 109 places, 100 transitions, 580 flow. Second operand 9 states and 224 transitions. [2024-11-09 10:55:35,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 133 transitions, 867 flow [2024-11-09 10:55:35,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 133 transitions, 819 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-11-09 10:55:35,915 INFO L231 Difference]: Finished difference. Result has 102 places, 67 transitions, 358 flow [2024-11-09 10:55:35,915 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=358, PETRI_PLACES=102, PETRI_TRANSITIONS=67} [2024-11-09 10:55:35,915 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 54 predicate places. [2024-11-09 10:55:35,915 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 67 transitions, 358 flow [2024-11-09 10:55:35,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 20.647058823529413) internal successors, (351), 17 states have internal predecessors, (351), 0 states have call successors, (0), 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-09 10:55:35,917 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:35,917 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:35,929 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-09 10:55:36,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:36,122 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 10:55:36,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:36,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1382053874, now seen corresponding path program 3 times [2024-11-09 10:55:36,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:36,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744255590] [2024-11-09 10:55:36,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:36,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:36,197 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 10:55:36,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:36,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744255590] [2024-11-09 10:55:36,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744255590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:55:36,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97109977] [2024-11-09 10:55:36,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:55:36,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:36,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:55:36,199 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-09 10:55:36,200 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-09 10:55:36,267 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 10:55:36,268 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:55:36,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:55:36,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:55:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 10:55:36,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:55:36,393 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 10:55:36,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97109977] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:55:36,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:55:36,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2024-11-09 10:55:36,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257428452] [2024-11-09 10:55:36,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:55:36,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:55:36,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:36,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:55:36,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:55:36,397 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-09 10:55:36,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 67 transitions, 358 flow. Second operand has 8 states, 8 states have (on average 23.875) internal successors, (191), 8 states have internal predecessors, (191), 0 states have call successors, (0), 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-09 10:55:36,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:36,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-09 10:55:36,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:37,028 INFO L124 PetriNetUnfolderBase]: 3093/5681 cut-off events. [2024-11-09 10:55:37,029 INFO L125 PetriNetUnfolderBase]: For 25715/26020 co-relation queries the response was YES. [2024-11-09 10:55:37,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18406 conditions, 5681 events. 3093/5681 cut-off events. For 25715/26020 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 39404 event pairs, 762 based on Foata normal form. 184/5390 useless extension candidates. Maximal degree in co-relation 18358. Up to 1655 conditions per place. [2024-11-09 10:55:37,080 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 89 selfloop transitions, 6 changer transitions 6/125 dead transitions. [2024-11-09 10:55:37,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 125 transitions, 816 flow [2024-11-09 10:55:37,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:55:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:55:37,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2024-11-09 10:55:37,085 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6793478260869565 [2024-11-09 10:55:37,085 INFO L175 Difference]: Start difference. First operand has 102 places, 67 transitions, 358 flow. Second operand 4 states and 125 transitions. [2024-11-09 10:55:37,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 125 transitions, 816 flow [2024-11-09 10:55:37,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 125 transitions, 761 flow, removed 22 selfloop flow, removed 13 redundant places. [2024-11-09 10:55:37,124 INFO L231 Difference]: Finished difference. Result has 76 places, 71 transitions, 380 flow [2024-11-09 10:55:37,124 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=380, PETRI_PLACES=76, PETRI_TRANSITIONS=71} [2024-11-09 10:55:37,125 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 28 predicate places. [2024-11-09 10:55:37,125 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 380 flow [2024-11-09 10:55:37,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.875) internal successors, (191), 8 states have internal predecessors, (191), 0 states have call successors, (0), 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-09 10:55:37,125 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:37,125 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:37,138 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-09 10:55:37,326 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,SelfDestructingSolverStorable11 [2024-11-09 10:55:37,326 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 10:55:37,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:37,327 INFO L85 PathProgramCache]: Analyzing trace with hash -685522565, now seen corresponding path program 4 times [2024-11-09 10:55:37,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:37,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116430031] [2024-11-09 10:55:37,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:37,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:38,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:38,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116430031] [2024-11-09 10:55:38,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116430031] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:55:38,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907397516] [2024-11-09 10:55:38,138 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:55:38,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:38,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:55:38,142 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-09 10:55:38,150 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-09 10:55:38,219 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 10:55:38,219 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:55:38,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 10:55:38,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:55:38,855 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:38,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:55:39,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:55:39,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 53 [2024-11-09 10:55:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:39,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907397516] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:55:39,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:55:39,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 42 [2024-11-09 10:55:39,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757227954] [2024-11-09 10:55:39,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:55:39,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-09 10:55:39,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:39,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-09 10:55:39,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1579, Unknown=0, NotChecked=0, Total=1806 [2024-11-09 10:55:39,820 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2024-11-09 10:55:39,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 71 transitions, 380 flow. Second operand has 43 states, 43 states have (on average 16.302325581395348) internal successors, (701), 43 states have internal predecessors, (701), 0 states have call successors, (0), 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-09 10:55:39,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:39,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2024-11-09 10:55:39,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:52,511 INFO L124 PetriNetUnfolderBase]: 26742/45599 cut-off events. [2024-11-09 10:55:52,512 INFO L125 PetriNetUnfolderBase]: For 91744/92353 co-relation queries the response was YES. [2024-11-09 10:55:52,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141228 conditions, 45599 events. 26742/45599 cut-off events. For 91744/92353 co-relation queries the response was YES. Maximal size of possible extension queue 1311. Compared 380141 event pairs, 2256 based on Foata normal form. 663/44966 useless extension candidates. Maximal degree in co-relation 102600. Up to 6063 conditions per place. [2024-11-09 10:55:52,973 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 641 selfloop transitions, 326 changer transitions 639/1615 dead transitions. [2024-11-09 10:55:52,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 1615 transitions, 10983 flow [2024-11-09 10:55:52,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2024-11-09 10:55:52,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2024-11-09 10:55:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 3548 transitions. [2024-11-09 10:55:52,986 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5008469791078487 [2024-11-09 10:55:52,987 INFO L175 Difference]: Start difference. First operand has 76 places, 71 transitions, 380 flow. Second operand 154 states and 3548 transitions. [2024-11-09 10:55:52,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 1615 transitions, 10983 flow [2024-11-09 10:55:53,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 1615 transitions, 10855 flow, removed 64 selfloop flow, removed 0 redundant places. [2024-11-09 10:55:53,275 INFO L231 Difference]: Finished difference. Result has 286 places, 405 transitions, 3938 flow [2024-11-09 10:55:53,278 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=154, PETRI_FLOW=3938, PETRI_PLACES=286, PETRI_TRANSITIONS=405} [2024-11-09 10:55:53,279 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 238 predicate places. [2024-11-09 10:55:53,279 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 405 transitions, 3938 flow [2024-11-09 10:55:53,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 16.302325581395348) internal successors, (701), 43 states have internal predecessors, (701), 0 states have call successors, (0), 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-09 10:55:53,281 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:53,281 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:53,294 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-09 10:55:53,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:53,482 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 10:55:53,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:53,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1323373435, now seen corresponding path program 5 times [2024-11-09 10:55:53,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:53,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737366062] [2024-11-09 10:55:53,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:53,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:54,336 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:54,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:54,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737366062] [2024-11-09 10:55:54,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737366062] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:55:54,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258334833] [2024-11-09 10:55:54,337 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:55:54,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:54,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:55:54,338 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-09 10:55:54,339 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-09 10:55:54,412 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-11-09 10:55:54,412 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:55:54,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 10:55:54,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:55:55,155 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2024-11-09 10:55:55,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 13 [2024-11-09 10:55:55,238 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:55,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:55:55,916 INFO L349 Elim1Store]: treesize reduction 18, result has 60.0 percent of original size [2024-11-09 10:55:55,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 43 [2024-11-09 10:55:56,613 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:56,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258334833] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:55:56,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:55:56,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 48 [2024-11-09 10:55:56,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764097323] [2024-11-09 10:55:56,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:55:56,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-09 10:55:56,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:56,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-09 10:55:56,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=2030, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 10:55:56,902 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 46 [2024-11-09 10:55:56,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 405 transitions, 3938 flow. Second operand has 49 states, 49 states have (on average 10.571428571428571) internal successors, (518), 49 states have internal predecessors, (518), 0 states have call successors, (0), 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-09 10:55:56,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:56,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 46 [2024-11-09 10:55:56,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:56:32,636 INFO L124 PetriNetUnfolderBase]: 79211/120213 cut-off events. [2024-11-09 10:56:32,636 INFO L125 PetriNetUnfolderBase]: For 998426/998426 co-relation queries the response was YES. [2024-11-09 10:56:34,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523339 conditions, 120213 events. 79211/120213 cut-off events. For 998426/998426 co-relation queries the response was YES. Maximal size of possible extension queue 2050. Compared 889426 event pairs, 8597 based on Foata normal form. 33/115592 useless extension candidates. Maximal degree in co-relation 520293. Up to 19132 conditions per place. [2024-11-09 10:56:34,238 INFO L140 encePairwiseOnDemand]: 24/46 looper letters, 1057 selfloop transitions, 838 changer transitions 1169/3066 dead transitions. [2024-11-09 10:56:34,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 3066 transitions, 30791 flow [2024-11-09 10:56:34,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2024-11-09 10:56:34,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2024-11-09 10:56:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 3426 transitions. [2024-11-09 10:56:34,246 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.366887984579139 [2024-11-09 10:56:34,246 INFO L175 Difference]: Start difference. First operand has 286 places, 405 transitions, 3938 flow. Second operand 203 states and 3426 transitions. [2024-11-09 10:56:34,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 3066 transitions, 30791 flow [2024-11-09 10:56:51,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 3066 transitions, 27158 flow, removed 1418 selfloop flow, removed 21 redundant places. [2024-11-09 10:56:51,556 INFO L231 Difference]: Finished difference. Result has 508 places, 1020 transitions, 11783 flow [2024-11-09 10:56:51,557 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3246, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=223, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=203, PETRI_FLOW=11783, PETRI_PLACES=508, PETRI_TRANSITIONS=1020} [2024-11-09 10:56:51,557 INFO L277 CegarLoopForPetriNet]: 48 programPoint places, 460 predicate places. [2024-11-09 10:56:51,557 INFO L471 AbstractCegarLoop]: Abstraction has has 508 places, 1020 transitions, 11783 flow [2024-11-09 10:56:51,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 10.571428571428571) internal successors, (518), 49 states have internal predecessors, (518), 0 states have call successors, (0), 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-09 10:56:51,558 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:56:51,558 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:56:51,571 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-09 10:56:51,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:56:51,759 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 10:56:51,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:56:51,760 INFO L85 PathProgramCache]: Analyzing trace with hash -49202203, now seen corresponding path program 6 times [2024-11-09 10:56:51,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:56:51,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303905478] [2024-11-09 10:56:51,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:56:51,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:56:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:56:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:56:52,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:56:52,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303905478] [2024-11-09 10:56:52,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303905478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:56:52,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120188392] [2024-11-09 10:56:52,443 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 10:56:52,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:56:52,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:56:52,445 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-09 10:56:52,446 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-09 10:56:52,521 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-11-09 10:56:52,522 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:56:52,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 10:56:52,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:56:53,156 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2024-11-09 10:56:53,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 13 [2024-11-09 10:56:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:56:53,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:56:53,699 INFO L349 Elim1Store]: treesize reduction 18, result has 60.0 percent of original size [2024-11-09 10:56:53,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 43 [2024-11-09 10:56:54,356 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:56:54,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120188392] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:56:54,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:56:54,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 46 [2024-11-09 10:56:54,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481891722] [2024-11-09 10:56:54,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:56:54,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-09 10:56:54,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:56:54,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-09 10:56:54,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=1872, Unknown=0, NotChecked=0, Total=2162