./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/queue_ok_longer.i --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/pthread/queue_ok_longer.i -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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:21:11,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:21:11,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:21:11,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:21:11,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:21:11,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:21:11,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:21:11,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:21:11,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:21:11,816 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:21:11,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:21:11,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:21:11,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:21:11,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:21:11,818 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:21:11,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:21:11,819 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:21:11,819 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:21:11,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:21:11,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:21:11,823 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:21:11,825 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:21:11,825 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:21:11,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:21:11,826 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:21:11,826 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:21:11,826 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:21:11,826 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:21:11,827 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:21:11,827 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:21:11,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:21:11,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:21:11,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:21:11,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:21:11,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:21:11,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:21:11,829 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:21:11,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:21:11,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:21:11,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:21:11,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:21:11,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:21:11,831 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2024-11-09 10:21:12,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:21:12,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:21:12,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:21:12,110 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:21:12,111 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:21:12,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_ok_longer.i [2024-11-09 10:21:13,580 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:21:13,827 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:21:13,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longer.i [2024-11-09 10:21:13,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50952517d/a0d435d27cc746689025e144033aaa1b/FLAGce0f888e4 [2024-11-09 10:21:13,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50952517d/a0d435d27cc746689025e144033aaa1b [2024-11-09 10:21:13,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:21:13,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:21:13,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:21:13,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:21:13,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:21:13,872 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:21:13" (1/1) ... [2024-11-09 10:21:13,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f2c87f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:13, skipping insertion in model container [2024-11-09 10:21:13,873 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:21:13" (1/1) ... [2024-11-09 10:21:13,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:21:14,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:21:14,498 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:21:14,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:21:14,710 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:21:14,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:14 WrapperNode [2024-11-09 10:21:14,711 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:21:14,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:21:14,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:21:14,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:21:14,721 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:21:14" (1/1) ... [2024-11-09 10:21:14,767 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:21:14" (1/1) ... [2024-11-09 10:21:14,916 INFO L138 Inliner]: procedures = 274, calls = 854, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1001 [2024-11-09 10:21:14,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:21:14,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:21:14,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:21:14,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:21:14,929 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:14" (1/1) ... [2024-11-09 10:21:14,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:14" (1/1) ... [2024-11-09 10:21:14,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:14" (1/1) ... [2024-11-09 10:21:14,982 INFO L175 MemorySlicer]: Split 835 memory accesses to 4 slices as follows [2, 5, 402, 426]. 51 percent of accesses are in the largest equivalence class. The 810 initializations are split as follows [2, 5, 400, 403]. The 11 writes are split as follows [0, 0, 1, 10]. [2024-11-09 10:21:14,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:14" (1/1) ... [2024-11-09 10:21:14,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:14" (1/1) ... [2024-11-09 10:21:15,025 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:14" (1/1) ... [2024-11-09 10:21:15,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:14" (1/1) ... [2024-11-09 10:21:15,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:14" (1/1) ... [2024-11-09 10:21:15,043 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:14" (1/1) ... [2024-11-09 10:21:15,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:21:15,056 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:21:15,056 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:21:15,056 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:21:15,057 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:14" (1/1) ... [2024-11-09 10:21:15,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:21:15,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:21:15,104 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:21:15,119 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:21:15,164 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-09 10:21:15,165 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-09 10:21:15,165 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-09 10:21:15,165 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-09 10:21:15,165 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:21:15,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:21:15,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:21:15,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 10:21:15,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 10:21:15,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:21:15,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:21:15,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 10:21:15,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 10:21:15,169 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:21:15,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:21:15,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:21:15,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:21:15,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 10:21:15,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 10:21:15,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:21:15,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:21:15,172 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:21:15,353 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:21:15,355 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:21:16,624 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:21:16,624 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:21:22,874 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:21:22,874 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 10:21:22,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:21:22 BoogieIcfgContainer [2024-11-09 10:21:22,875 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:21:22,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:21:22,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:21:22,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:21:22,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:21:13" (1/3) ... [2024-11-09 10:21:22,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fbccee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:21:22, skipping insertion in model container [2024-11-09 10:21:22,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:21:14" (2/3) ... [2024-11-09 10:21:22,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fbccee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:21:22, skipping insertion in model container [2024-11-09 10:21:22,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:21:22" (3/3) ... [2024-11-09 10:21:22,884 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2024-11-09 10:21:22,901 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:21:22,902 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2024-11-09 10:21:22,902 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:21:23,012 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:21:23,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 129 transitions, 272 flow [2024-11-09 10:21:23,144 INFO L124 PetriNetUnfolderBase]: 11/127 cut-off events. [2024-11-09 10:21:23,145 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:21:23,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 127 events. 11/127 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 405 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 99. Up to 3 conditions per place. [2024-11-09 10:21:23,150 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 129 transitions, 272 flow [2024-11-09 10:21:23,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 126 transitions, 264 flow [2024-11-09 10:21:23,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:21:23,178 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;@32256ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:21:23,178 INFO L334 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2024-11-09 10:21:23,217 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:21:23,217 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2024-11-09 10:21:23,217 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:21:23,217 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:23,218 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-11-09 10:21:23,219 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 10:21:23,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:23,225 INFO L85 PathProgramCache]: Analyzing trace with hash 69449, now seen corresponding path program 1 times [2024-11-09 10:21:23,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:23,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049687440] [2024-11-09 10:21:23,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:23,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:24,242 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:21:24,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:24,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049687440] [2024-11-09 10:21:24,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049687440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:24,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:24,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:21:24,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716734948] [2024-11-09 10:21:24,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:24,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:21:24,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:24,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:21:24,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:21:24,397 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 129 [2024-11-09 10:21:24,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 126 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:21:24,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:24,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 129 [2024-11-09 10:21:24,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:24,919 INFO L124 PetriNetUnfolderBase]: 1089/2984 cut-off events. [2024-11-09 10:21:24,919 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-09 10:21:24,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4727 conditions, 2984 events. 1089/2984 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 23575 event pairs, 839 based on Foata normal form. 68/2109 useless extension candidates. Maximal degree in co-relation 4570. Up to 1689 conditions per place. [2024-11-09 10:21:24,956 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 45 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2024-11-09 10:21:24,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 114 transitions, 334 flow [2024-11-09 10:21:24,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:21:24,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:21:24,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2024-11-09 10:21:24,970 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6873385012919897 [2024-11-09 10:21:24,972 INFO L175 Difference]: Start difference. First operand has 122 places, 126 transitions, 264 flow. Second operand 3 states and 266 transitions. [2024-11-09 10:21:24,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 114 transitions, 334 flow [2024-11-09 10:21:24,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 114 transitions, 326 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:21:24,980 INFO L231 Difference]: Finished difference. Result has 112 places, 114 transitions, 236 flow [2024-11-09 10:21:24,982 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=112, PETRI_TRANSITIONS=114} [2024-11-09 10:21:24,987 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -10 predicate places. [2024-11-09 10:21:24,987 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 114 transitions, 236 flow [2024-11-09 10:21:24,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:21:24,988 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:24,988 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-11-09 10:21:24,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:21:24,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 10:21:24,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:24,990 INFO L85 PathProgramCache]: Analyzing trace with hash 69450, now seen corresponding path program 1 times [2024-11-09 10:21:24,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:24,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538873019] [2024-11-09 10:21:24,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:24,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:25,713 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:21:25,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:25,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538873019] [2024-11-09 10:21:25,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538873019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:25,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:25,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:21:25,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053221553] [2024-11-09 10:21:25,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:25,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:21:25,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:25,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:21:25,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:21:25,810 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 129 [2024-11-09 10:21:25,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 114 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:21:25,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:25,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 129 [2024-11-09 10:21:25,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:26,263 INFO L124 PetriNetUnfolderBase]: 1089/2981 cut-off events. [2024-11-09 10:21:26,263 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-09 10:21:26,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4690 conditions, 2981 events. 1089/2981 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 23571 event pairs, 839 based on Foata normal form. 3/2043 useless extension candidates. Maximal degree in co-relation 4679. Up to 1689 conditions per place. [2024-11-09 10:21:26,286 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 45 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2024-11-09 10:21:26,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 111 transitions, 324 flow [2024-11-09 10:21:26,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:21:26,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:21:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2024-11-09 10:21:26,289 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6795865633074936 [2024-11-09 10:21:26,290 INFO L175 Difference]: Start difference. First operand has 112 places, 114 transitions, 236 flow. Second operand 3 states and 263 transitions. [2024-11-09 10:21:26,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 111 transitions, 324 flow [2024-11-09 10:21:26,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 111 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:21:26,293 INFO L231 Difference]: Finished difference. Result has 109 places, 111 transitions, 230 flow [2024-11-09 10:21:26,293 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=109, PETRI_TRANSITIONS=111} [2024-11-09 10:21:26,294 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -13 predicate places. [2024-11-09 10:21:26,294 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 111 transitions, 230 flow [2024-11-09 10:21:26,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:21:26,295 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:26,295 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:21:26,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:21:26,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 10:21:26,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:26,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2071095474, now seen corresponding path program 1 times [2024-11-09 10:21:26,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:26,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262802209] [2024-11-09 10:21:26,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:26,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:26,671 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:21:26,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:26,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262802209] [2024-11-09 10:21:26,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262802209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:26,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:26,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:21:26,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213301884] [2024-11-09 10:21:26,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:26,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:21:26,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:26,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:21:26,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:21:26,761 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2024-11-09 10:21:26,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 111 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 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:21:26,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:26,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2024-11-09 10:21:26,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:27,189 INFO L124 PetriNetUnfolderBase]: 1089/2979 cut-off events. [2024-11-09 10:21:27,190 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-09 10:21:27,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4688 conditions, 2979 events. 1089/2979 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 23545 event pairs, 839 based on Foata normal form. 1/2041 useless extension candidates. Maximal degree in co-relation 4677. Up to 1688 conditions per place. [2024-11-09 10:21:27,207 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 44 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2024-11-09 10:21:27,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 109 transitions, 320 flow [2024-11-09 10:21:27,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:21:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:21:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2024-11-09 10:21:27,210 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6531007751937985 [2024-11-09 10:21:27,210 INFO L175 Difference]: Start difference. First operand has 109 places, 111 transitions, 230 flow. Second operand 4 states and 337 transitions. [2024-11-09 10:21:27,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 109 transitions, 320 flow [2024-11-09 10:21:27,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 109 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:21:27,212 INFO L231 Difference]: Finished difference. Result has 108 places, 109 transitions, 228 flow [2024-11-09 10:21:27,213 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=108, PETRI_TRANSITIONS=109} [2024-11-09 10:21:27,213 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -14 predicate places. [2024-11-09 10:21:27,214 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 109 transitions, 228 flow [2024-11-09 10:21:27,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 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:21:27,214 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:27,214 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:21:27,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:21:27,215 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 10:21:27,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:27,215 INFO L85 PathProgramCache]: Analyzing trace with hash 2071095475, now seen corresponding path program 1 times [2024-11-09 10:21:27,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:27,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647510843] [2024-11-09 10:21:27,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:27,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:27,611 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:21:27,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:27,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647510843] [2024-11-09 10:21:27,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647510843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:27,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:27,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:21:27,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447456467] [2024-11-09 10:21:27,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:27,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:21:27,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:27,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:21:27,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:21:27,759 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2024-11-09 10:21:27,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 109 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 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:21:27,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:27,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2024-11-09 10:21:27,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:28,206 INFO L124 PetriNetUnfolderBase]: 1089/2977 cut-off events. [2024-11-09 10:21:28,206 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-09 10:21:28,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4687 conditions, 2977 events. 1089/2977 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 23568 event pairs, 839 based on Foata normal form. 2/2041 useless extension candidates. Maximal degree in co-relation 4672. Up to 1688 conditions per place. [2024-11-09 10:21:28,224 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 44 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2024-11-09 10:21:28,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 107 transitions, 318 flow [2024-11-09 10:21:28,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:21:28,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:21:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2024-11-09 10:21:28,227 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6531007751937985 [2024-11-09 10:21:28,227 INFO L175 Difference]: Start difference. First operand has 108 places, 109 transitions, 228 flow. Second operand 4 states and 337 transitions. [2024-11-09 10:21:28,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 107 transitions, 318 flow [2024-11-09 10:21:28,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 107 transitions, 312 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:21:28,230 INFO L231 Difference]: Finished difference. Result has 106 places, 107 transitions, 224 flow [2024-11-09 10:21:28,230 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=106, PETRI_TRANSITIONS=107} [2024-11-09 10:21:28,231 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -16 predicate places. [2024-11-09 10:21:28,231 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 107 transitions, 224 flow [2024-11-09 10:21:28,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 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:21:28,231 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:28,232 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:21:28,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:21:28,232 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 10:21:28,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:28,233 INFO L85 PathProgramCache]: Analyzing trace with hash 902343804, now seen corresponding path program 1 times [2024-11-09 10:21:28,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:28,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139798250] [2024-11-09 10:21:28,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:28,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:28,573 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:21:28,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:28,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139798250] [2024-11-09 10:21:28,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139798250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:28,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:28,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:21:28,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551890088] [2024-11-09 10:21:28,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:28,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:21:28,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:28,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:21:28,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:21:28,738 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 129 [2024-11-09 10:21:28,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 107 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 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:21:28,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:28,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 129 [2024-11-09 10:21:28,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:29,059 INFO L124 PetriNetUnfolderBase]: 1046/2622 cut-off events. [2024-11-09 10:21:29,059 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-09 10:21:29,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4287 conditions, 2622 events. 1046/2622 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 19408 event pairs, 426 based on Foata normal form. 120/2116 useless extension candidates. Maximal degree in co-relation 4272. Up to 882 conditions per place. [2024-11-09 10:21:29,082 INFO L140 encePairwiseOnDemand]: 118/129 looper letters, 67 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2024-11-09 10:21:29,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 122 transitions, 395 flow [2024-11-09 10:21:29,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:21:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:21:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 342 transitions. [2024-11-09 10:21:29,084 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6627906976744186 [2024-11-09 10:21:29,084 INFO L175 Difference]: Start difference. First operand has 106 places, 107 transitions, 224 flow. Second operand 4 states and 342 transitions. [2024-11-09 10:21:29,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 122 transitions, 395 flow [2024-11-09 10:21:29,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 122 transitions, 389 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:21:29,087 INFO L231 Difference]: Finished difference. Result has 98 places, 99 transitions, 208 flow [2024-11-09 10:21:29,088 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=98, PETRI_TRANSITIONS=99} [2024-11-09 10:21:29,090 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2024-11-09 10:21:29,090 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 99 transitions, 208 flow [2024-11-09 10:21:29,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 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:21:29,093 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:29,094 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:21:29,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:21:29,094 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 10:21:29,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:29,095 INFO L85 PathProgramCache]: Analyzing trace with hash 902343805, now seen corresponding path program 1 times [2024-11-09 10:21:29,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:29,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957723066] [2024-11-09 10:21:29,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:29,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:29,593 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:21:29,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:29,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957723066] [2024-11-09 10:21:29,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957723066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:29,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:29,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:21:29,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638703036] [2024-11-09 10:21:29,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:29,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:21:29,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:29,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:21:29,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:21:29,733 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 129 [2024-11-09 10:21:29,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 99 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 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:21:29,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:29,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 129 [2024-11-09 10:21:29,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:30,057 INFO L124 PetriNetUnfolderBase]: 1046/2354 cut-off events. [2024-11-09 10:21:30,058 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2024-11-09 10:21:30,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4097 conditions, 2354 events. 1046/2354 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 15823 event pairs, 426 based on Foata normal form. 120/2000 useless extension candidates. Maximal degree in co-relation 1953. Up to 882 conditions per place. [2024-11-09 10:21:30,073 INFO L140 encePairwiseOnDemand]: 119/129 looper letters, 67 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2024-11-09 10:21:30,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 115 transitions, 381 flow [2024-11-09 10:21:30,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:21:30,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:21:30,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 345 transitions. [2024-11-09 10:21:30,075 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6686046511627907 [2024-11-09 10:21:30,075 INFO L175 Difference]: Start difference. First operand has 98 places, 99 transitions, 208 flow. Second operand 4 states and 345 transitions. [2024-11-09 10:21:30,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 115 transitions, 381 flow [2024-11-09 10:21:30,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 115 transitions, 375 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:21:30,079 INFO L231 Difference]: Finished difference. Result has 91 places, 92 transitions, 194 flow [2024-11-09 10:21:30,080 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=91, PETRI_TRANSITIONS=92} [2024-11-09 10:21:30,080 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -31 predicate places. [2024-11-09 10:21:30,081 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 92 transitions, 194 flow [2024-11-09 10:21:30,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 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:21:30,082 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:30,082 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:21:30,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:21:30,082 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 10:21:30,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:30,083 INFO L85 PathProgramCache]: Analyzing trace with hash -2092110920, now seen corresponding path program 1 times [2024-11-09 10:21:30,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:30,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886517699] [2024-11-09 10:21:30,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:30,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:31,625 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:21:31,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:31,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886517699] [2024-11-09 10:21:31,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886517699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:31,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:31,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:21:31,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571683102] [2024-11-09 10:21:31,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:31,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:21:31,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:31,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:21:31,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:21:32,069 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 129 [2024-11-09 10:21:32,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 92 transitions, 194 flow. Second operand has 8 states, 8 states have (on average 59.625) internal successors, (477), 8 states have internal predecessors, (477), 0 states have call successors, (0), 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:21:32,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:32,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 129 [2024-11-09 10:21:32,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:32,847 INFO L124 PetriNetUnfolderBase]: 2065/4255 cut-off events. [2024-11-09 10:21:32,848 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-11-09 10:21:32,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7679 conditions, 4255 events. 2065/4255 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 29549 event pairs, 289 based on Foata normal form. 0/3449 useless extension candidates. Maximal degree in co-relation 2484. Up to 2157 conditions per place. [2024-11-09 10:21:32,871 INFO L140 encePairwiseOnDemand]: 119/129 looper letters, 131 selfloop transitions, 12 changer transitions 0/182 dead transitions. [2024-11-09 10:21:32,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 182 transitions, 667 flow [2024-11-09 10:21:32,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:21:32,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:21:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 609 transitions. [2024-11-09 10:21:32,874 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5901162790697675 [2024-11-09 10:21:32,874 INFO L175 Difference]: Start difference. First operand has 91 places, 92 transitions, 194 flow. Second operand 8 states and 609 transitions. [2024-11-09 10:21:32,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 182 transitions, 667 flow [2024-11-09 10:21:32,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 182 transitions, 659 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:21:32,880 INFO L231 Difference]: Finished difference. Result has 99 places, 102 transitions, 264 flow [2024-11-09 10:21:32,880 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=264, PETRI_PLACES=99, PETRI_TRANSITIONS=102} [2024-11-09 10:21:32,881 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -23 predicate places. [2024-11-09 10:21:32,881 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 102 transitions, 264 flow [2024-11-09 10:21:32,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 59.625) internal successors, (477), 8 states have internal predecessors, (477), 0 states have call successors, (0), 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:21:32,882 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:32,882 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:21:32,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:21:32,882 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 10:21:32,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:32,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1088727253, now seen corresponding path program 1 times [2024-11-09 10:21:32,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:32,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607904448] [2024-11-09 10:21:32,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:32,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:33,202 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:21:33,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:33,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607904448] [2024-11-09 10:21:33,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607904448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:33,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:33,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:21:33,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852416953] [2024-11-09 10:21:33,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:33,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:21:33,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:33,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:21:33,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:21:33,207 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2024-11-09 10:21:33,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 102 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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:21:33,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:33,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2024-11-09 10:21:33,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:33,487 INFO L124 PetriNetUnfolderBase]: 692/1652 cut-off events. [2024-11-09 10:21:33,487 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2024-11-09 10:21:33,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3115 conditions, 1652 events. 692/1652 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 10240 event pairs, 446 based on Foata normal form. 43/1432 useless extension candidates. Maximal degree in co-relation 3072. Up to 693 conditions per place. [2024-11-09 10:21:33,497 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 59 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2024-11-09 10:21:33,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 109 transitions, 393 flow [2024-11-09 10:21:33,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:21:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:21:33,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2024-11-09 10:21:33,500 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7260981912144703 [2024-11-09 10:21:33,500 INFO L175 Difference]: Start difference. First operand has 99 places, 102 transitions, 264 flow. Second operand 3 states and 281 transitions. [2024-11-09 10:21:33,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 109 transitions, 393 flow [2024-11-09 10:21:33,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 109 transitions, 387 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-11-09 10:21:33,504 INFO L231 Difference]: Finished difference. Result has 98 places, 98 transitions, 249 flow [2024-11-09 10:21:33,504 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=249, PETRI_PLACES=98, PETRI_TRANSITIONS=98} [2024-11-09 10:21:33,508 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2024-11-09 10:21:33,508 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 98 transitions, 249 flow [2024-11-09 10:21:33,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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:21:33,509 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:33,509 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:21:33,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:21:33,513 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 10:21:33,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:33,514 INFO L85 PathProgramCache]: Analyzing trace with hash 230754673, now seen corresponding path program 1 times [2024-11-09 10:21:33,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:33,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545415648] [2024-11-09 10:21:33,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:33,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:33,744 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:21:33,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:33,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545415648] [2024-11-09 10:21:33,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545415648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:33,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:33,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:21:33,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666022945] [2024-11-09 10:21:33,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:33,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:21:33,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:33,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:21:33,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:21:33,750 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2024-11-09 10:21:33,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 98 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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:21:33,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:33,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2024-11-09 10:21:33,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:34,037 INFO L124 PetriNetUnfolderBase]: 572/1382 cut-off events. [2024-11-09 10:21:34,038 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-11-09 10:21:34,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2663 conditions, 1382 events. 572/1382 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 7625 event pairs, 380 based on Foata normal form. 12/1194 useless extension candidates. Maximal degree in co-relation 1698. Up to 753 conditions per place. [2024-11-09 10:21:34,045 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 62 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2024-11-09 10:21:34,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 111 transitions, 401 flow [2024-11-09 10:21:34,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:21:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:21:34,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2024-11-09 10:21:34,047 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7416020671834626 [2024-11-09 10:21:34,047 INFO L175 Difference]: Start difference. First operand has 98 places, 98 transitions, 249 flow. Second operand 3 states and 287 transitions. [2024-11-09 10:21:34,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 111 transitions, 401 flow [2024-11-09 10:21:34,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 111 transitions, 393 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 10:21:34,055 INFO L231 Difference]: Finished difference. Result has 99 places, 98 transitions, 248 flow [2024-11-09 10:21:34,055 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=99, PETRI_TRANSITIONS=98} [2024-11-09 10:21:34,056 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -23 predicate places. [2024-11-09 10:21:34,058 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 98 transitions, 248 flow [2024-11-09 10:21:34,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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:21:34,058 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:34,058 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] [2024-11-09 10:21:34,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:21:34,059 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 10:21:34,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:34,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1879953541, now seen corresponding path program 1 times [2024-11-09 10:21:34,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:34,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410644095] [2024-11-09 10:21:34,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:34,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:34,296 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:21:34,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:34,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410644095] [2024-11-09 10:21:34,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410644095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:34,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:34,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:21:34,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304875139] [2024-11-09 10:21:34,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:34,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:21:34,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:34,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:21:34,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:21:34,375 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2024-11-09 10:21:34,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 98 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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:21:34,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:34,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2024-11-09 10:21:34,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:34,676 INFO L124 PetriNetUnfolderBase]: 572/1349 cut-off events. [2024-11-09 10:21:34,677 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2024-11-09 10:21:34,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2660 conditions, 1349 events. 572/1349 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7253 event pairs, 515 based on Foata normal form. 31/1215 useless extension candidates. Maximal degree in co-relation 809. Up to 1007 conditions per place. [2024-11-09 10:21:34,683 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 50 selfloop transitions, 1 changer transitions 0/96 dead transitions. [2024-11-09 10:21:34,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 96 transitions, 346 flow [2024-11-09 10:21:34,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:21:34,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:21:34,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2024-11-09 10:21:34,685 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6847545219638242 [2024-11-09 10:21:34,685 INFO L175 Difference]: Start difference. First operand has 99 places, 98 transitions, 248 flow. Second operand 3 states and 265 transitions. [2024-11-09 10:21:34,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 96 transitions, 346 flow [2024-11-09 10:21:34,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 96 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:21:34,688 INFO L231 Difference]: Finished difference. Result has 98 places, 96 transitions, 244 flow [2024-11-09 10:21:34,688 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=98, PETRI_TRANSITIONS=96} [2024-11-09 10:21:34,689 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2024-11-09 10:21:34,689 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 96 transitions, 244 flow [2024-11-09 10:21:34,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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:21:34,689 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:34,689 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] [2024-11-09 10:21:34,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:21:34,690 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 10:21:34,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:34,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1879953542, now seen corresponding path program 1 times [2024-11-09 10:21:34,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:34,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175695927] [2024-11-09 10:21:34,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:34,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:35,046 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:21:35,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:35,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175695927] [2024-11-09 10:21:35,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175695927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:35,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:35,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:21:35,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763725478] [2024-11-09 10:21:35,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:35,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:21:35,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:35,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:21:35,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:21:35,172 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 129 [2024-11-09 10:21:35,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 96 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 0 states have call successors, (0), 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:21:35,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:35,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 129 [2024-11-09 10:21:35,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:35,422 INFO L124 PetriNetUnfolderBase]: 587/1354 cut-off events. [2024-11-09 10:21:35,423 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-11-09 10:21:35,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2686 conditions, 1354 events. 587/1354 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7192 event pairs, 395 based on Foata normal form. 12/1197 useless extension candidates. Maximal degree in co-relation 2674. Up to 779 conditions per place. [2024-11-09 10:21:35,431 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 62 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2024-11-09 10:21:35,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 109 transitions, 401 flow [2024-11-09 10:21:35,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:21:35,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:21:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 358 transitions. [2024-11-09 10:21:35,433 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6937984496124031 [2024-11-09 10:21:35,433 INFO L175 Difference]: Start difference. First operand has 98 places, 96 transitions, 244 flow. Second operand 4 states and 358 transitions. [2024-11-09 10:21:35,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 109 transitions, 401 flow [2024-11-09 10:21:35,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 109 transitions, 400 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:21:35,436 INFO L231 Difference]: Finished difference. Result has 101 places, 96 transitions, 253 flow [2024-11-09 10:21:35,436 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=101, PETRI_TRANSITIONS=96} [2024-11-09 10:21:35,437 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -21 predicate places. [2024-11-09 10:21:35,437 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 96 transitions, 253 flow [2024-11-09 10:21:35,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 0 states have call successors, (0), 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:21:35,437 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:35,438 INFO L204 CegarLoopForPetriNet]: trace histogram [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:21:35,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:21:35,438 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 10:21:35,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:35,438 INFO L85 PathProgramCache]: Analyzing trace with hash -675303991, now seen corresponding path program 1 times [2024-11-09 10:21:35,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:35,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262255944] [2024-11-09 10:21:35,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:35,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:21:36,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:36,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262255944] [2024-11-09 10:21:36,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262255944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:21:36,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218737333] [2024-11-09 10:21:36,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:36,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:21:36,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:21:36,419 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:21:36,420 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:21:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:36,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 1849 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 10:21:36,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:21:37,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 10:21:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:21:37,091 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:21:37,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-09 10:21:37,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:21:37,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:21:37,344 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:21:37,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218737333] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:21:37,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:21:37,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2024-11-09 10:21:37,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722646390] [2024-11-09 10:21:37,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:21:37,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 10:21:37,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:37,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 10:21:37,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-09 10:21:38,635 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 129 [2024-11-09 10:21:38,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 96 transitions, 253 flow. Second operand has 17 states, 17 states have (on average 64.05882352941177) internal successors, (1089), 17 states have internal predecessors, (1089), 0 states have call successors, (0), 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:21:38,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:38,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 129 [2024-11-09 10:21:38,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:39,440 INFO L124 PetriNetUnfolderBase]: 1005/2167 cut-off events. [2024-11-09 10:21:39,440 INFO L125 PetriNetUnfolderBase]: For 169/169 co-relation queries the response was YES. [2024-11-09 10:21:39,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4471 conditions, 2167 events. 1005/2167 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 12911 event pairs, 183 based on Foata normal form. 12/1955 useless extension candidates. Maximal degree in co-relation 4457. Up to 471 conditions per place. [2024-11-09 10:21:39,450 INFO L140 encePairwiseOnDemand]: 120/129 looper letters, 127 selfloop transitions, 14 changer transitions 0/177 dead transitions. [2024-11-09 10:21:39,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 177 transitions, 731 flow [2024-11-09 10:21:39,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:21:39,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:21:39,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 738 transitions. [2024-11-09 10:21:39,453 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5720930232558139 [2024-11-09 10:21:39,453 INFO L175 Difference]: Start difference. First operand has 101 places, 96 transitions, 253 flow. Second operand 10 states and 738 transitions. [2024-11-09 10:21:39,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 177 transitions, 731 flow [2024-11-09 10:21:39,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 177 transitions, 723 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:21:39,457 INFO L231 Difference]: Finished difference. Result has 111 places, 103 transitions, 329 flow [2024-11-09 10:21:39,457 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=329, PETRI_PLACES=111, PETRI_TRANSITIONS=103} [2024-11-09 10:21:39,458 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -11 predicate places. [2024-11-09 10:21:39,458 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 103 transitions, 329 flow [2024-11-09 10:21:39,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 64.05882352941177) internal successors, (1089), 17 states have internal predecessors, (1089), 0 states have call successors, (0), 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:21:39,459 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:39,459 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-09 10:21:39,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 10:21:39,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 10:21:39,660 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 10:21:39,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:39,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1787894202, now seen corresponding path program 1 times [2024-11-09 10:21:39,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:39,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580682749] [2024-11-09 10:21:39,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:39,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:41,955 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:21:41,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:41,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580682749] [2024-11-09 10:21:41,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580682749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:21:41,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371538182] [2024-11-09 10:21:41,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:41,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:21:41,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:21:41,959 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:21:41,961 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:21:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:42,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 1856 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-09 10:21:42,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:21:42,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 10:21:42,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 10:21:42,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:21:42,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:21:42,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2024-11-09 10:21:42,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-09 10:21:42,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 10:21:42,963 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:21:42,964 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:22:18,748 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#3| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select .cse0 .cse1))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (or (forall ((v_ArrVal_172 Int)) (<= 0 (+ (* (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_172) .cse1) 4) |c_~#queue~0.offset| 4))) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (or (forall ((v_ArrVal_172 Int)) (<= (+ (* (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_172) .cse1) 4) |c_~#queue~0.offset| 8) (select |c_#length| |c_~#queue~0.base|))) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|)))))) is different from false [2024-11-09 10:22:23,186 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (store |c_#memory_int#3| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int#3| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) 0)) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse1 .cse2))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) (forall ((v_ArrVal_172 Int)) (<= 0 (+ (* (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_172) .cse2) 4) |c_~#queue~0.offset| 4))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) (forall ((v_ArrVal_172 Int)) (<= (+ (* (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_172) .cse2) 4) |c_~#queue~0.offset| 8) (select |c_#length| |c_~#queue~0.base|)))))))) is different from false [2024-11-09 10:22:23,321 INFO L349 Elim1Store]: treesize reduction 47, result has 52.5 percent of original size [2024-11-09 10:22:23,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 146 [2024-11-09 10:22:23,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:22:23,366 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 73 treesize of output 73 [2024-11-09 10:22:23,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 10:22:23,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:22:23,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 60 [2024-11-09 10:22:23,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:22:23,646 INFO L349 Elim1Store]: treesize reduction 57, result has 26.9 percent of original size [2024-11-09 10:22:23,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 89 [2024-11-09 10:22:23,658 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2024-11-09 10:22:23,665 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:22:23,687 INFO L349 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2024-11-09 10:22:23,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 23 [2024-11-09 10:22:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-09 10:22:23,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371538182] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:22:23,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:22:23,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2024-11-09 10:22:23,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391143434] [2024-11-09 10:22:23,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:22:23,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 10:22:23,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:23,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 10:22:23,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=788, Unknown=9, NotChecked=118, Total=1056 [2024-11-09 10:22:24,484 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 129 [2024-11-09 10:22:24,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 329 flow. Second operand has 33 states, 33 states have (on average 28.363636363636363) internal successors, (936), 33 states have internal predecessors, (936), 0 states have call successors, (0), 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:22:24,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:24,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 129 [2024-11-09 10:22:24,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:28,817 INFO L124 PetriNetUnfolderBase]: 2344/4499 cut-off events. [2024-11-09 10:22:28,818 INFO L125 PetriNetUnfolderBase]: For 787/787 co-relation queries the response was YES. [2024-11-09 10:22:28,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10188 conditions, 4499 events. 2344/4499 cut-off events. For 787/787 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 26030 event pairs, 443 based on Foata normal form. 24/4198 useless extension candidates. Maximal degree in co-relation 10170. Up to 1756 conditions per place. [2024-11-09 10:22:28,841 INFO L140 encePairwiseOnDemand]: 116/129 looper letters, 224 selfloop transitions, 28 changer transitions 0/270 dead transitions. [2024-11-09 10:22:28,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 270 transitions, 1286 flow [2024-11-09 10:22:28,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 10:22:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-09 10:22:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 655 transitions. [2024-11-09 10:22:28,844 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3173449612403101 [2024-11-09 10:22:28,844 INFO L175 Difference]: Start difference. First operand has 111 places, 103 transitions, 329 flow. Second operand 16 states and 655 transitions. [2024-11-09 10:22:28,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 270 transitions, 1286 flow [2024-11-09 10:22:28,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 270 transitions, 1265 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-09 10:22:28,851 INFO L231 Difference]: Finished difference. Result has 128 places, 123 transitions, 537 flow [2024-11-09 10:22:28,851 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=537, PETRI_PLACES=128, PETRI_TRANSITIONS=123} [2024-11-09 10:22:28,852 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 6 predicate places. [2024-11-09 10:22:28,852 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 123 transitions, 537 flow [2024-11-09 10:22:28,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 28.363636363636363) internal successors, (936), 33 states have internal predecessors, (936), 0 states have call successors, (0), 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:22:28,853 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:28,853 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:22:28,873 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:22:29,058 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,SelfDestructingSolverStorable12 [2024-11-09 10:22:29,059 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 10:22:29,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:29,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2096467843, now seen corresponding path program 1 times [2024-11-09 10:22:29,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:29,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98981093] [2024-11-09 10:22:29,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:29,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:29,197 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:22:29,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:29,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98981093] [2024-11-09 10:22:29,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98981093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:29,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:29,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:22:29,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803155492] [2024-11-09 10:22:29,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:29,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:22:29,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:29,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:22:29,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:22:29,304 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 129 [2024-11-09 10:22:29,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 123 transitions, 537 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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:22:29,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:29,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 129 [2024-11-09 10:22:29,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:29,714 INFO L124 PetriNetUnfolderBase]: 1675/3817 cut-off events. [2024-11-09 10:22:29,714 INFO L125 PetriNetUnfolderBase]: For 1533/1533 co-relation queries the response was YES. [2024-11-09 10:22:29,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8856 conditions, 3817 events. 1675/3817 cut-off events. For 1533/1533 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 25066 event pairs, 1526 based on Foata normal form. 11/3375 useless extension candidates. Maximal degree in co-relation 8833. Up to 2934 conditions per place. [2024-11-09 10:22:29,737 INFO L140 encePairwiseOnDemand]: 127/129 looper letters, 70 selfloop transitions, 1 changer transitions 3/122 dead transitions. [2024-11-09 10:22:29,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 122 transitions, 681 flow [2024-11-09 10:22:29,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:22:29,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:22:29,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2024-11-09 10:22:29,739 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2024-11-09 10:22:29,739 INFO L175 Difference]: Start difference. First operand has 128 places, 123 transitions, 537 flow. Second operand 3 states and 267 transitions. [2024-11-09 10:22:29,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 122 transitions, 681 flow [2024-11-09 10:22:29,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 122 transitions, 647 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-11-09 10:22:29,750 INFO L231 Difference]: Finished difference. Result has 123 places, 119 transitions, 495 flow [2024-11-09 10:22:29,750 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=495, PETRI_PLACES=123, PETRI_TRANSITIONS=119} [2024-11-09 10:22:29,751 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 1 predicate places. [2024-11-09 10:22:29,751 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 119 transitions, 495 flow [2024-11-09 10:22:29,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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:22:29,751 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:29,751 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] [2024-11-09 10:22:29,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 10:22:29,752 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 10:22:29,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:29,752 INFO L85 PathProgramCache]: Analyzing trace with hash -580366467, now seen corresponding path program 1 times [2024-11-09 10:22:29,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:29,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630019257] [2024-11-09 10:22:29,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:29,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:29,915 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:22:29,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:29,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630019257] [2024-11-09 10:22:29,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630019257] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:22:29,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591032969] [2024-11-09 10:22:29,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:29,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:22:29,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:22:29,919 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:22:29,920 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:22:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:30,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 1874 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:22:30,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:30,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 10:22:30,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:22:30,293 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:30,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591032969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:30,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 10:22:30,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-09 10:22:30,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87899828] [2024-11-09 10:22:30,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:30,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:22:30,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:30,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:22:30,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:22:30,295 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2024-11-09 10:22:30,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 119 transitions, 495 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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:22:30,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:30,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2024-11-09 10:22:30,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:30,643 INFO L124 PetriNetUnfolderBase]: 1101/2780 cut-off events. [2024-11-09 10:22:30,643 INFO L125 PetriNetUnfolderBase]: For 1008/1008 co-relation queries the response was YES. [2024-11-09 10:22:30,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6458 conditions, 2780 events. 1101/2780 cut-off events. For 1008/1008 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 17208 event pairs, 177 based on Foata normal form. 116/2571 useless extension candidates. Maximal degree in co-relation 6435. Up to 1708 conditions per place. [2024-11-09 10:22:30,658 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 75 selfloop transitions, 4 changer transitions 0/127 dead transitions. [2024-11-09 10:22:30,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 127 transitions, 671 flow [2024-11-09 10:22:30,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:22:30,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:22:30,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2024-11-09 10:22:30,660 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7157622739018088 [2024-11-09 10:22:30,660 INFO L175 Difference]: Start difference. First operand has 123 places, 119 transitions, 495 flow. Second operand 3 states and 277 transitions. [2024-11-09 10:22:30,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 127 transitions, 671 flow [2024-11-09 10:22:30,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 127 transitions, 670 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:22:30,668 INFO L231 Difference]: Finished difference. Result has 122 places, 119 transitions, 502 flow [2024-11-09 10:22:30,668 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=122, PETRI_TRANSITIONS=119} [2024-11-09 10:22:30,668 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 0 predicate places. [2024-11-09 10:22:30,669 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 119 transitions, 502 flow [2024-11-09 10:22:30,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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:22:30,669 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:30,669 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:22:30,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 10:22:30,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:22:30,874 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-09 10:22:30,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:30,874 INFO L85 PathProgramCache]: Analyzing trace with hash 467214656, now seen corresponding path program 1 times [2024-11-09 10:22:30,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:30,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668767864] [2024-11-09 10:22:30,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:30,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:31,097 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:22:31,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:31,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668767864] [2024-11-09 10:22:31,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668767864] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:22:31,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175127501] [2024-11-09 10:22:31,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:31,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:22:31,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:22:31,101 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:22:31,103 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:22:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:31,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 1880 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:22:31,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:31,486 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:22:31,486 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:22:31,547 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:22:31,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175127501] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:22:31,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:22:31,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-09 10:22:31,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531150486] [2024-11-09 10:22:31,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:22:31,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:22:31,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:31,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:22:31,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:22:31,560 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2024-11-09 10:22:31,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 119 transitions, 502 flow. Second operand has 7 states, 7 states have (on average 79.85714285714286) internal successors, (559), 7 states have internal predecessors, (559), 0 states have call successors, (0), 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:22:31,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:31,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2024-11-09 10:22:31,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand