./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d 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/goblint-regression/09-regions_13-arraycollapse_nr-deref.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 e8cd6f4fedd4ae62debc23b5e2621fa19163a924ac1cc7b32aeb6e38c2fa5ce1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:25:47,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:25:47,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 03:25:47,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:25:47,523 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:25:47,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:25:47,550 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:25:47,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:25:47,552 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:25:47,553 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:25:47,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:25:47,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:25:47,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:25:47,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:25:47,556 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:25:47,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:25:47,556 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:25:47,557 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:25:47,557 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:25:47,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:25:47,557 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:25:47,558 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:25:47,559 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:25:47,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:25:47,559 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:25:47,559 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:25:47,560 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:25:47,560 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:25:47,560 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:25:47,561 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:25:47,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:25:47,562 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:25:47,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:25:47,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:25:47,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:25:47,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:25:47,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 03:25:47,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 03:25:47,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:25:47,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:25:47,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:25:47,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:25:47,565 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 -> e8cd6f4fedd4ae62debc23b5e2621fa19163a924ac1cc7b32aeb6e38c2fa5ce1 [2024-11-17 03:25:47,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:25:47,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:25:47,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:25:47,930 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:25:47,930 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:25:47,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i [2024-11-17 03:25:49,323 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:25:49,675 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:25:49,676 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i [2024-11-17 03:25:49,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb5df76ae/512df1f9ec6d4222b1d8ec5d20d6551d/FLAG9c430cce9 [2024-11-17 03:25:49,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb5df76ae/512df1f9ec6d4222b1d8ec5d20d6551d [2024-11-17 03:25:49,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:25:49,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:25:49,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:25:49,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:25:49,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:25:49,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:25:49" (1/1) ... [2024-11-17 03:25:49,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b923bed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:49, skipping insertion in model container [2024-11-17 03:25:49,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:25:49" (1/1) ... [2024-11-17 03:25:49,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:25:50,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:25:50,349 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:25:50,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:25:50,524 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:25:50,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:50 WrapperNode [2024-11-17 03:25:50,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:25:50,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:25:50,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:25:50,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:25:50,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:50" (1/1) ... [2024-11-17 03:25:50,564 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:50" (1/1) ... [2024-11-17 03:25:50,613 INFO L138 Inliner]: procedures = 372, calls = 100, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 259 [2024-11-17 03:25:50,616 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:25:50,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:25:50,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:25:50,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:25:50,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:50" (1/1) ... [2024-11-17 03:25:50,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:50" (1/1) ... [2024-11-17 03:25:50,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:50" (1/1) ... [2024-11-17 03:25:50,671 INFO L175 MemorySlicer]: Split 99 memory accesses to 3 slices as follows [50, 18, 31]. 51 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 26 writes are split as follows [0, 2, 24]. [2024-11-17 03:25:50,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:50" (1/1) ... [2024-11-17 03:25:50,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:50" (1/1) ... [2024-11-17 03:25:50,694 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:50" (1/1) ... [2024-11-17 03:25:50,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:50" (1/1) ... [2024-11-17 03:25:50,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:50" (1/1) ... [2024-11-17 03:25:50,700 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:50" (1/1) ... [2024-11-17 03:25:50,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:25:50,706 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:25:50,706 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:25:50,706 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:25:50,707 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:50" (1/1) ... [2024-11-17 03:25:50,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:25:50,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:25:50,739 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-17 03:25:50,744 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-17 03:25:50,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 03:25:50,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 03:25:50,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 03:25:50,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-17 03:25:50,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-17 03:25:50,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-17 03:25:50,797 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-17 03:25:50,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 03:25:50,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 03:25:50,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 03:25:50,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 03:25:50,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 03:25:50,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 03:25:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-17 03:25:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 03:25:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:25:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 03:25:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 03:25:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 03:25:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-17 03:25:50,800 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-17 03:25:50,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 03:25:50,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 03:25:50,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 03:25:50,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:25:50,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:25:50,802 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:25:50,991 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:25:50,993 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:25:51,607 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:25:51,608 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:25:52,007 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:25:52,008 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:25:52,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:25:52 BoogieIcfgContainer [2024-11-17 03:25:52,008 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:25:52,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:25:52,011 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:25:52,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:25:52,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:25:49" (1/3) ... [2024-11-17 03:25:52,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed85dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:25:52, skipping insertion in model container [2024-11-17 03:25:52,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:50" (2/3) ... [2024-11-17 03:25:52,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed85dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:25:52, skipping insertion in model container [2024-11-17 03:25:52,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:25:52" (3/3) ... [2024-11-17 03:25:52,018 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr-deref.i [2024-11-17 03:25:52,036 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:25:52,036 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 79 error locations. [2024-11-17 03:25:52,036 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:25:52,113 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-17 03:25:52,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 137 transitions, 278 flow [2024-11-17 03:25:52,265 INFO L124 PetriNetUnfolderBase]: 2/136 cut-off events. [2024-11-17 03:25:52,266 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:25:52,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 272 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2024-11-17 03:25:52,269 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 137 transitions, 278 flow [2024-11-17 03:25:52,275 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 136 transitions, 275 flow [2024-11-17 03:25:52,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:25:52,296 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;@4ff1b2cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:25:52,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-11-17 03:25:52,304 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:25:52,304 INFO L124 PetriNetUnfolderBase]: 2/7 cut-off events. [2024-11-17 03:25:52,304 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:25:52,304 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:25:52,305 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-17 03:25:52,306 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:25:52,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:25:52,313 INFO L85 PathProgramCache]: Analyzing trace with hash 25320186, now seen corresponding path program 1 times [2024-11-17 03:25:52,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:25:52,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755806581] [2024-11-17 03:25:52,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:25:52,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:25:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:25:52,581 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-17 03:25:52,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:25:52,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755806581] [2024-11-17 03:25:52,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755806581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:25:52,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:25:52,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:25:52,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123955263] [2024-11-17 03:25:52,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:25:52,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 03:25:52,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:25:52,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 03:25:52,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 03:25:52,636 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 137 [2024-11-17 03:25:52,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 136 transitions, 275 flow. Second operand has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 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-17 03:25:52,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:25:52,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 137 [2024-11-17 03:25:52,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:25:52,827 INFO L124 PetriNetUnfolderBase]: 64/330 cut-off events. [2024-11-17 03:25:52,828 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:25:52,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 330 events. 64/330 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1320 event pairs, 63 based on Foata normal form. 1/241 useless extension candidates. Maximal degree in co-relation 376. Up to 167 conditions per place. [2024-11-17 03:25:52,835 INFO L140 encePairwiseOnDemand]: 136/137 looper letters, 40 selfloop transitions, 0 changer transitions 0/135 dead transitions. [2024-11-17 03:25:52,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 135 transitions, 353 flow [2024-11-17 03:25:52,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 03:25:52,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-17 03:25:52,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 233 transitions. [2024-11-17 03:25:52,848 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8503649635036497 [2024-11-17 03:25:52,849 INFO L175 Difference]: Start difference. First operand has 138 places, 136 transitions, 275 flow. Second operand 2 states and 233 transitions. [2024-11-17 03:25:52,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 135 transitions, 353 flow [2024-11-17 03:25:52,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 135 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:25:52,856 INFO L231 Difference]: Finished difference. Result has 138 places, 135 transitions, 272 flow [2024-11-17 03:25:52,858 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=272, PETRI_PLACES=138, PETRI_TRANSITIONS=135} [2024-11-17 03:25:52,861 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 0 predicate places. [2024-11-17 03:25:52,862 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 135 transitions, 272 flow [2024-11-17 03:25:52,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 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-17 03:25:52,862 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:25:52,862 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-17 03:25:52,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 03:25:52,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:25:52,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:25:52,863 INFO L85 PathProgramCache]: Analyzing trace with hash 784925338, now seen corresponding path program 1 times [2024-11-17 03:25:52,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:25:52,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676923991] [2024-11-17 03:25:52,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:25:52,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:25:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:25:52,995 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-17 03:25:52,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:25:52,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676923991] [2024-11-17 03:25:52,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676923991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:25:52,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:25:52,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:25:52,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797637711] [2024-11-17 03:25:52,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:25:52,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:25:52,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:25:52,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:25:52,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:25:52,999 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 137 [2024-11-17 03:25:53,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 135 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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-17 03:25:53,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:25:53,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 137 [2024-11-17 03:25:53,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:25:53,181 INFO L124 PetriNetUnfolderBase]: 64/332 cut-off events. [2024-11-17 03:25:53,181 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:25:53,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 332 events. 64/332 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1317 event pairs, 63 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 502. Up to 168 conditions per place. [2024-11-17 03:25:53,184 INFO L140 encePairwiseOnDemand]: 134/137 looper letters, 40 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2024-11-17 03:25:53,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 136 transitions, 358 flow [2024-11-17 03:25:53,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:25:53,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:25:53,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2024-11-17 03:25:53,187 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7980535279805353 [2024-11-17 03:25:53,187 INFO L175 Difference]: Start difference. First operand has 138 places, 135 transitions, 272 flow. Second operand 3 states and 328 transitions. [2024-11-17 03:25:53,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 136 transitions, 358 flow [2024-11-17 03:25:53,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 136 transitions, 358 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-17 03:25:53,191 INFO L231 Difference]: Finished difference. Result has 141 places, 136 transitions, 284 flow [2024-11-17 03:25:53,191 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=141, PETRI_TRANSITIONS=136} [2024-11-17 03:25:53,192 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 3 predicate places. [2024-11-17 03:25:53,192 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 136 transitions, 284 flow [2024-11-17 03:25:53,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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-17 03:25:53,193 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:25:53,193 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-17 03:25:53,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 03:25:53,193 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:25:53,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:25:53,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1598982186, now seen corresponding path program 1 times [2024-11-17 03:25:53,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:25:53,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655546361] [2024-11-17 03:25:53,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:25:53,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:25:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:25:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:25:53,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:25:53,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655546361] [2024-11-17 03:25:53,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655546361] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:25:53,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331789515] [2024-11-17 03:25:53,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:25:53,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:25:53,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:25:53,291 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-17 03:25:53,292 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-17 03:25:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:25:53,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:25:53,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:25:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:25:53,461 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:25:53,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:25:53,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331789515] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:25:53,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:25:53,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-17 03:25:53,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931104277] [2024-11-17 03:25:53,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:25:53,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:25:53,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:25:53,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:25:53,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:25:53,485 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 137 [2024-11-17 03:25:53,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 136 transitions, 284 flow. Second operand has 7 states, 7 states have (on average 96.28571428571429) internal successors, (674), 7 states have internal predecessors, (674), 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-17 03:25:53,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:25:53,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 137 [2024-11-17 03:25:53,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:25:53,630 INFO L124 PetriNetUnfolderBase]: 64/338 cut-off events. [2024-11-17 03:25:53,631 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-17 03:25:53,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 338 events. 64/338 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1304 event pairs, 63 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 519. Up to 168 conditions per place. [2024-11-17 03:25:53,635 INFO L140 encePairwiseOnDemand]: 134/137 looper letters, 40 selfloop transitions, 5 changer transitions 0/139 dead transitions. [2024-11-17 03:25:53,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 139 transitions, 386 flow [2024-11-17 03:25:53,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:25:53,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:25:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 618 transitions. [2024-11-17 03:25:53,640 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7518248175182481 [2024-11-17 03:25:53,640 INFO L175 Difference]: Start difference. First operand has 141 places, 136 transitions, 284 flow. Second operand 6 states and 618 transitions. [2024-11-17 03:25:53,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 139 transitions, 386 flow [2024-11-17 03:25:53,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 139 transitions, 384 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:25:53,644 INFO L231 Difference]: Finished difference. Result has 148 places, 139 transitions, 318 flow [2024-11-17 03:25:53,644 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=318, PETRI_PLACES=148, PETRI_TRANSITIONS=139} [2024-11-17 03:25:53,645 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 10 predicate places. [2024-11-17 03:25:53,645 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 139 transitions, 318 flow [2024-11-17 03:25:53,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.28571428571429) internal successors, (674), 7 states have internal predecessors, (674), 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-17 03:25:53,646 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:25:53,646 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1] [2024-11-17 03:25:53,666 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-17 03:25:53,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:25:53,851 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:25:53,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:25:53,851 INFO L85 PathProgramCache]: Analyzing trace with hash -281567862, now seen corresponding path program 2 times [2024-11-17 03:25:53,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:25:53,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375222694] [2024-11-17 03:25:53,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:25:53,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:25:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:25:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-17 03:25:53,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:25:53,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375222694] [2024-11-17 03:25:53,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375222694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:25:53,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:25:53,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:25:53,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532079519] [2024-11-17 03:25:53,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:25:53,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:25:53,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:25:53,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:25:53,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:25:54,095 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 137 [2024-11-17 03:25:54,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 139 transitions, 318 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-17 03:25:54,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:25:54,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 137 [2024-11-17 03:25:54,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:25:54,243 INFO L124 PetriNetUnfolderBase]: 64/326 cut-off events. [2024-11-17 03:25:54,243 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-17 03:25:54,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 326 events. 64/326 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1245 event pairs, 63 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 523. Up to 165 conditions per place. [2024-11-17 03:25:54,247 INFO L140 encePairwiseOnDemand]: 113/137 looper letters, 38 selfloop transitions, 12 changer transitions 0/127 dead transitions. [2024-11-17 03:25:54,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 127 transitions, 394 flow [2024-11-17 03:25:54,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:25:54,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:25:54,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2024-11-17 03:25:54,249 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7104622871046229 [2024-11-17 03:25:54,249 INFO L175 Difference]: Start difference. First operand has 148 places, 139 transitions, 318 flow. Second operand 3 states and 292 transitions. [2024-11-17 03:25:54,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 127 transitions, 394 flow [2024-11-17 03:25:54,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 127 transitions, 386 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-17 03:25:54,254 INFO L231 Difference]: Finished difference. Result has 137 places, 127 transitions, 310 flow [2024-11-17 03:25:54,255 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=137, PETRI_TRANSITIONS=127} [2024-11-17 03:25:54,257 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -1 predicate places. [2024-11-17 03:25:54,257 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 127 transitions, 310 flow [2024-11-17 03:25:54,257 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-17 03:25:54,258 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:25:54,258 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1] [2024-11-17 03:25:54,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 03:25:54,259 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:25:54,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:25:54,259 INFO L85 PathProgramCache]: Analyzing trace with hash -281567861, now seen corresponding path program 1 times [2024-11-17 03:25:54,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:25:54,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42079388] [2024-11-17 03:25:54,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:25:54,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:25:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:25:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:25:54,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:25:54,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42079388] [2024-11-17 03:25:54,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42079388] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:25:54,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439253178] [2024-11-17 03:25:54,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:25:54,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:25:54,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:25:54,395 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-17 03:25:54,397 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-17 03:25:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:25:54,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 03:25:54,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:25:54,539 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:25:54,540 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:25:54,611 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:25:54,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439253178] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:25:54,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:25:54,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-17 03:25:54,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133082965] [2024-11-17 03:25:54,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:25:54,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 03:25:54,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:25:54,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 03:25:54,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-17 03:25:54,617 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 137 [2024-11-17 03:25:54,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 127 transitions, 310 flow. Second operand has 13 states, 13 states have (on average 96.15384615384616) internal successors, (1250), 13 states have internal predecessors, (1250), 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-17 03:25:54,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:25:54,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 137 [2024-11-17 03:25:54,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:25:54,808 INFO L124 PetriNetUnfolderBase]: 64/338 cut-off events. [2024-11-17 03:25:54,808 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2024-11-17 03:25:54,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 338 events. 64/338 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1261 event pairs, 63 based on Foata normal form. 6/266 useless extension candidates. Maximal degree in co-relation 556. Up to 168 conditions per place. [2024-11-17 03:25:54,810 INFO L140 encePairwiseOnDemand]: 134/137 looper letters, 40 selfloop transitions, 11 changer transitions 0/133 dead transitions. [2024-11-17 03:25:54,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 133 transitions, 448 flow [2024-11-17 03:25:54,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 03:25:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-17 03:25:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1197 transitions. [2024-11-17 03:25:54,813 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7281021897810219 [2024-11-17 03:25:54,814 INFO L175 Difference]: Start difference. First operand has 137 places, 127 transitions, 310 flow. Second operand 12 states and 1197 transitions. [2024-11-17 03:25:54,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 133 transitions, 448 flow [2024-11-17 03:25:54,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 133 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:25:54,821 INFO L231 Difference]: Finished difference. Result has 152 places, 133 transitions, 370 flow [2024-11-17 03:25:54,821 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=370, PETRI_PLACES=152, PETRI_TRANSITIONS=133} [2024-11-17 03:25:54,822 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 14 predicate places. [2024-11-17 03:25:54,822 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 133 transitions, 370 flow [2024-11-17 03:25:54,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 96.15384615384616) internal successors, (1250), 13 states have internal predecessors, (1250), 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-17 03:25:54,827 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:25:54,827 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1] [2024-11-17 03:25:54,844 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-17 03:25:55,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:25:55,028 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:25:55,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:25:55,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1824070669, now seen corresponding path program 2 times [2024-11-17 03:25:55,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:25:55,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517164396] [2024-11-17 03:25:55,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:25:55,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:25:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:25:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 03:25:55,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:25:55,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517164396] [2024-11-17 03:25:55,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517164396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:25:55,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:25:55,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:25:55,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183826789] [2024-11-17 03:25:55,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:25:55,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:25:55,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:25:55,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:25:55,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:25:55,277 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 137 [2024-11-17 03:25:55,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 133 transitions, 370 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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-17 03:25:55,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:25:55,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 137 [2024-11-17 03:25:55,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:25:55,395 INFO L124 PetriNetUnfolderBase]: 64/326 cut-off events. [2024-11-17 03:25:55,396 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2024-11-17 03:25:55,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 326 events. 64/326 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1231 event pairs, 63 based on Foata normal form. 6/260 useless extension candidates. Maximal degree in co-relation 555. Up to 171 conditions per place. [2024-11-17 03:25:55,398 INFO L140 encePairwiseOnDemand]: 113/137 looper letters, 38 selfloop transitions, 12 changer transitions 0/121 dead transitions. [2024-11-17 03:25:55,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 121 transitions, 446 flow [2024-11-17 03:25:55,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:25:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:25:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2024-11-17 03:25:55,400 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7396593673965937 [2024-11-17 03:25:55,400 INFO L175 Difference]: Start difference. First operand has 152 places, 133 transitions, 370 flow. Second operand 3 states and 304 transitions. [2024-11-17 03:25:55,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 121 transitions, 446 flow [2024-11-17 03:25:55,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 121 transitions, 410 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-11-17 03:25:55,404 INFO L231 Difference]: Finished difference. Result has 137 places, 121 transitions, 334 flow [2024-11-17 03:25:55,404 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=137, PETRI_TRANSITIONS=121} [2024-11-17 03:25:55,405 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -1 predicate places. [2024-11-17 03:25:55,405 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 121 transitions, 334 flow [2024-11-17 03:25:55,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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-17 03:25:55,406 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:25:55,406 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2024-11-17 03:25:55,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 03:25:55,406 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:25:55,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:25:55,407 INFO L85 PathProgramCache]: Analyzing trace with hash -585235619, now seen corresponding path program 1 times [2024-11-17 03:25:55,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:25:55,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937417917] [2024-11-17 03:25:55,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:25:55,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:25:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:25:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 03:25:55,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:25:55,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937417917] [2024-11-17 03:25:55,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937417917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:25:55,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:25:55,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:25:55,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254845149] [2024-11-17 03:25:55,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:25:55,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:25:55,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:25:55,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:25:55,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:25:56,212 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 137 [2024-11-17 03:25:56,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 121 transitions, 334 flow. Second operand has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 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-17 03:25:56,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:25:56,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 137 [2024-11-17 03:25:56,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:25:56,398 INFO L124 PetriNetUnfolderBase]: 73/339 cut-off events. [2024-11-17 03:25:56,398 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2024-11-17 03:25:56,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 339 events. 73/339 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1330 event pairs, 63 based on Foata normal form. 2/277 useless extension candidates. Maximal degree in co-relation 581. Up to 158 conditions per place. [2024-11-17 03:25:56,400 INFO L140 encePairwiseOnDemand]: 111/137 looper letters, 43 selfloop transitions, 14 changer transitions 3/118 dead transitions. [2024-11-17 03:25:56,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 118 transitions, 448 flow [2024-11-17 03:25:56,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:25:56,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:25:56,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2024-11-17 03:25:56,402 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6978102189781021 [2024-11-17 03:25:56,403 INFO L175 Difference]: Start difference. First operand has 137 places, 121 transitions, 334 flow. Second operand 5 states and 478 transitions. [2024-11-17 03:25:56,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 118 transitions, 448 flow [2024-11-17 03:25:56,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 118 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:25:56,409 INFO L231 Difference]: Finished difference. Result has 127 places, 109 transitions, 314 flow [2024-11-17 03:25:56,410 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=314, PETRI_PLACES=127, PETRI_TRANSITIONS=109} [2024-11-17 03:25:56,410 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -11 predicate places. [2024-11-17 03:25:56,410 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 109 transitions, 314 flow [2024-11-17 03:25:56,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 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-17 03:25:56,411 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:25:56,411 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:25:56,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 03:25:56,412 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:25:56,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:25:56,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1324464408, now seen corresponding path program 1 times [2024-11-17 03:25:56,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:25:56,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648316529] [2024-11-17 03:25:56,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:25:56,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:25:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:25:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 03:25:56,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:25:56,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648316529] [2024-11-17 03:25:56,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648316529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:25:56,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:25:56,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:25:56,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427074275] [2024-11-17 03:25:56,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:25:56,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:25:56,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:25:56,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:25:56,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:25:57,328 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 137 [2024-11-17 03:25:57,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 109 transitions, 314 flow. Second operand has 7 states, 7 states have (on average 67.42857142857143) internal successors, (472), 7 states have internal predecessors, (472), 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-17 03:25:57,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:25:57,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 137 [2024-11-17 03:25:57,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:25:57,564 INFO L124 PetriNetUnfolderBase]: 64/304 cut-off events. [2024-11-17 03:25:57,565 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-11-17 03:25:57,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 304 events. 64/304 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1130 event pairs, 63 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 551. Up to 166 conditions per place. [2024-11-17 03:25:57,566 INFO L140 encePairwiseOnDemand]: 115/137 looper letters, 46 selfloop transitions, 17 changer transitions 0/104 dead transitions. [2024-11-17 03:25:57,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 104 transitions, 430 flow [2024-11-17 03:25:57,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:25:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-17 03:25:57,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 586 transitions. [2024-11-17 03:25:57,569 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5346715328467153 [2024-11-17 03:25:57,569 INFO L175 Difference]: Start difference. First operand has 127 places, 109 transitions, 314 flow. Second operand 8 states and 586 transitions. [2024-11-17 03:25:57,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 104 transitions, 430 flow [2024-11-17 03:25:57,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 104 transitions, 402 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:25:57,572 INFO L231 Difference]: Finished difference. Result has 125 places, 104 transitions, 310 flow [2024-11-17 03:25:57,572 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=310, PETRI_PLACES=125, PETRI_TRANSITIONS=104} [2024-11-17 03:25:57,574 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -13 predicate places. [2024-11-17 03:25:57,574 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 104 transitions, 310 flow [2024-11-17 03:25:57,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 67.42857142857143) internal successors, (472), 7 states have internal predecessors, (472), 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-17 03:25:57,574 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:25:57,575 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:25:57,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 03:25:57,575 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:25:57,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:25:57,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1324464409, now seen corresponding path program 1 times [2024-11-17 03:25:57,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:25:57,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132894970] [2024-11-17 03:25:57,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:25:57,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:25:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:25:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 03:25:58,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:25:58,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132894970] [2024-11-17 03:25:58,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132894970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:25:58,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:25:58,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:25:58,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305021286] [2024-11-17 03:25:58,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:25:58,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:25:58,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:25:58,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:25:58,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:25:58,633 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 137 [2024-11-17 03:25:58,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 104 transitions, 310 flow. Second operand has 7 states, 7 states have (on average 59.42857142857143) internal successors, (416), 7 states have internal predecessors, (416), 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-17 03:25:58,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:25:58,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 137 [2024-11-17 03:25:58,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:25:58,846 INFO L124 PetriNetUnfolderBase]: 64/302 cut-off events. [2024-11-17 03:25:58,846 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-11-17 03:25:58,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 302 events. 64/302 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1131 event pairs, 63 based on Foata normal form. 1/257 useless extension candidates. Maximal degree in co-relation 542. Up to 172 conditions per place. [2024-11-17 03:25:58,848 INFO L140 encePairwiseOnDemand]: 122/137 looper letters, 49 selfloop transitions, 13 changer transitions 0/102 dead transitions. [2024-11-17 03:25:58,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 102 transitions, 430 flow [2024-11-17 03:25:58,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 03:25:58,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-17 03:25:58,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 460 transitions. [2024-11-17 03:25:58,850 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4796663190823775 [2024-11-17 03:25:58,851 INFO L175 Difference]: Start difference. First operand has 125 places, 104 transitions, 310 flow. Second operand 7 states and 460 transitions. [2024-11-17 03:25:58,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 102 transitions, 430 flow [2024-11-17 03:25:58,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 102 transitions, 396 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-17 03:25:58,854 INFO L231 Difference]: Finished difference. Result has 122 places, 102 transitions, 298 flow [2024-11-17 03:25:58,855 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=298, PETRI_PLACES=122, PETRI_TRANSITIONS=102} [2024-11-17 03:25:58,855 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -16 predicate places. [2024-11-17 03:25:58,856 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 102 transitions, 298 flow [2024-11-17 03:25:58,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.42857142857143) internal successors, (416), 7 states have internal predecessors, (416), 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-17 03:25:58,856 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:25:58,856 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:25:58,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 03:25:58,857 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:25:58,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:25:58,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1500003054, now seen corresponding path program 1 times [2024-11-17 03:25:58,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:25:58,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172366193] [2024-11-17 03:25:58,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:25:58,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:25:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:25:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 03:25:59,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:25:59,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172366193] [2024-11-17 03:25:59,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172366193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:25:59,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:25:59,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:25:59,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430748559] [2024-11-17 03:25:59,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:25:59,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:25:59,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:25:59,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:25:59,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:25:59,390 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 137 [2024-11-17 03:25:59,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 102 transitions, 298 flow. Second operand has 5 states, 5 states have (on average 81.8) internal successors, (409), 5 states have internal predecessors, (409), 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-17 03:25:59,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:25:59,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 137 [2024-11-17 03:25:59,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:25:59,539 INFO L124 PetriNetUnfolderBase]: 64/301 cut-off events. [2024-11-17 03:25:59,539 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2024-11-17 03:25:59,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 301 events. 64/301 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1124 event pairs, 63 based on Foata normal form. 1/253 useless extension candidates. Maximal degree in co-relation 528. Up to 171 conditions per place. [2024-11-17 03:25:59,541 INFO L140 encePairwiseOnDemand]: 123/137 looper letters, 40 selfloop transitions, 13 changer transitions 0/101 dead transitions. [2024-11-17 03:25:59,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 101 transitions, 402 flow [2024-11-17 03:25:59,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:25:59,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:25:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2024-11-17 03:25:59,544 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6481751824817519 [2024-11-17 03:25:59,544 INFO L175 Difference]: Start difference. First operand has 122 places, 102 transitions, 298 flow. Second operand 5 states and 444 transitions. [2024-11-17 03:25:59,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 101 transitions, 402 flow [2024-11-17 03:25:59,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 101 transitions, 376 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-17 03:25:59,547 INFO L231 Difference]: Finished difference. Result has 119 places, 101 transitions, 296 flow [2024-11-17 03:25:59,547 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=119, PETRI_TRANSITIONS=101} [2024-11-17 03:25:59,548 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -19 predicate places. [2024-11-17 03:25:59,548 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 101 transitions, 296 flow [2024-11-17 03:25:59,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.8) internal successors, (409), 5 states have internal predecessors, (409), 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-17 03:25:59,548 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:25:59,548 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:25:59,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 03:25:59,549 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:25:59,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:25:59,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1500003053, now seen corresponding path program 1 times [2024-11-17 03:25:59,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:25:59,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056981203] [2024-11-17 03:25:59,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:25:59,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:25:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:25:59,699 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 03:25:59,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:25:59,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056981203] [2024-11-17 03:25:59,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056981203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:25:59,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:25:59,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:25:59,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373570150] [2024-11-17 03:25:59,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:25:59,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:25:59,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:25:59,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:25:59,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:25:59,991 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 137 [2024-11-17 03:25:59,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 101 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 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-17 03:25:59,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:25:59,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 137 [2024-11-17 03:25:59,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:00,144 INFO L124 PetriNetUnfolderBase]: 64/300 cut-off events. [2024-11-17 03:26:00,145 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-11-17 03:26:00,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 300 events. 64/300 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1125 event pairs, 63 based on Foata normal form. 1/252 useless extension candidates. Maximal degree in co-relation 533. Up to 171 conditions per place. [2024-11-17 03:26:00,147 INFO L140 encePairwiseOnDemand]: 123/137 looper letters, 46 selfloop transitions, 13 changer transitions 0/100 dead transitions. [2024-11-17 03:26:00,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 100 transitions, 412 flow [2024-11-17 03:26:00,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:26:00,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:26:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 420 transitions. [2024-11-17 03:26:00,151 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6131386861313869 [2024-11-17 03:26:00,151 INFO L175 Difference]: Start difference. First operand has 119 places, 101 transitions, 296 flow. Second operand 5 states and 420 transitions. [2024-11-17 03:26:00,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 100 transitions, 412 flow [2024-11-17 03:26:00,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 100 transitions, 386 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:26:00,154 INFO L231 Difference]: Finished difference. Result has 118 places, 100 transitions, 294 flow [2024-11-17 03:26:00,154 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=118, PETRI_TRANSITIONS=100} [2024-11-17 03:26:00,156 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -20 predicate places. [2024-11-17 03:26:00,156 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 100 transitions, 294 flow [2024-11-17 03:26:00,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 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-17 03:26:00,156 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:00,156 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:26:00,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 03:26:00,156 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:26:00,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:00,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1752054651, now seen corresponding path program 1 times [2024-11-17 03:26:00,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:00,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267342422] [2024-11-17 03:26:00,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:00,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:00,595 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 03:26:00,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:00,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267342422] [2024-11-17 03:26:00,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267342422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:00,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:00,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:26:00,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502814109] [2024-11-17 03:26:00,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:00,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:26:00,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:00,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:26:00,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:26:01,337 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 137 [2024-11-17 03:26:01,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 100 transitions, 294 flow. Second operand has 7 states, 7 states have (on average 85.57142857142857) internal successors, (599), 7 states have internal predecessors, (599), 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-17 03:26:01,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:01,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 137 [2024-11-17 03:26:01,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:01,519 INFO L124 PetriNetUnfolderBase]: 73/327 cut-off events. [2024-11-17 03:26:01,519 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2024-11-17 03:26:01,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 327 events. 73/327 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1310 event pairs, 63 based on Foata normal form. 1/271 useless extension candidates. Maximal degree in co-relation 570. Up to 158 conditions per place. [2024-11-17 03:26:01,521 INFO L140 encePairwiseOnDemand]: 120/137 looper letters, 43 selfloop transitions, 14 changer transitions 3/106 dead transitions. [2024-11-17 03:26:01,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 106 transitions, 426 flow [2024-11-17 03:26:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:26:01,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:26:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2024-11-17 03:26:01,523 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6905109489051094 [2024-11-17 03:26:01,523 INFO L175 Difference]: Start difference. First operand has 118 places, 100 transitions, 294 flow. Second operand 5 states and 473 transitions. [2024-11-17 03:26:01,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 106 transitions, 426 flow [2024-11-17 03:26:01,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 106 transitions, 400 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:26:01,528 INFO L231 Difference]: Finished difference. Result has 115 places, 97 transitions, 290 flow [2024-11-17 03:26:01,528 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=290, PETRI_PLACES=115, PETRI_TRANSITIONS=97} [2024-11-17 03:26:01,530 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -23 predicate places. [2024-11-17 03:26:01,530 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 97 transitions, 290 flow [2024-11-17 03:26:01,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.57142857142857) internal successors, (599), 7 states have internal predecessors, (599), 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-17 03:26:01,530 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:01,531 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:26:01,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 03:26:01,531 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:26:01,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:01,531 INFO L85 PathProgramCache]: Analyzing trace with hash -923318525, now seen corresponding path program 1 times [2024-11-17 03:26:01,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:01,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517902534] [2024-11-17 03:26:01,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:01,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:01,888 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 03:26:01,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:01,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517902534] [2024-11-17 03:26:01,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517902534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:01,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:01,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:26:01,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426147039] [2024-11-17 03:26:01,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:01,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:26:01,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:01,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:26:01,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:26:02,304 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 137 [2024-11-17 03:26:02,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 97 transitions, 290 flow. Second operand has 7 states, 7 states have (on average 68.71428571428571) internal successors, (481), 7 states have internal predecessors, (481), 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-17 03:26:02,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:02,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 137 [2024-11-17 03:26:02,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:02,542 INFO L124 PetriNetUnfolderBase]: 64/295 cut-off events. [2024-11-17 03:26:02,542 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-11-17 03:26:02,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 295 events. 64/295 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1112 event pairs, 54 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 540. Up to 130 conditions per place. [2024-11-17 03:26:02,544 INFO L140 encePairwiseOnDemand]: 117/137 looper letters, 49 selfloop transitions, 18 changer transitions 3/104 dead transitions. [2024-11-17 03:26:02,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 104 transitions, 444 flow [2024-11-17 03:26:02,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:26:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-17 03:26:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 590 transitions. [2024-11-17 03:26:02,546 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5383211678832117 [2024-11-17 03:26:02,546 INFO L175 Difference]: Start difference. First operand has 115 places, 97 transitions, 290 flow. Second operand 8 states and 590 transitions. [2024-11-17 03:26:02,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 104 transitions, 444 flow [2024-11-17 03:26:02,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 104 transitions, 416 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:26:02,551 INFO L231 Difference]: Finished difference. Result has 116 places, 95 transitions, 294 flow [2024-11-17 03:26:02,551 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=294, PETRI_PLACES=116, PETRI_TRANSITIONS=95} [2024-11-17 03:26:02,551 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -22 predicate places. [2024-11-17 03:26:02,551 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 95 transitions, 294 flow [2024-11-17 03:26:02,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 68.71428571428571) internal successors, (481), 7 states have internal predecessors, (481), 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-17 03:26:02,552 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:02,552 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:26:02,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 03:26:02,552 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:26:02,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:02,552 INFO L85 PathProgramCache]: Analyzing trace with hash -923318524, now seen corresponding path program 1 times [2024-11-17 03:26:02,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:02,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980626990] [2024-11-17 03:26:02,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:02,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:03,087 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 03:26:03,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:03,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980626990] [2024-11-17 03:26:03,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980626990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:03,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:03,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:26:03,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630336437] [2024-11-17 03:26:03,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:03,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:26:03,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:03,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:26:03,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:26:03,686 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 137 [2024-11-17 03:26:03,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 95 transitions, 294 flow. Second operand has 7 states, 7 states have (on average 60.57142857142857) internal successors, (424), 7 states have internal predecessors, (424), 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-17 03:26:03,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:03,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 137 [2024-11-17 03:26:03,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:03,933 INFO L124 PetriNetUnfolderBase]: 64/291 cut-off events. [2024-11-17 03:26:03,933 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2024-11-17 03:26:03,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 291 events. 64/291 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1108 event pairs, 54 based on Foata normal form. 2/248 useless extension candidates. Maximal degree in co-relation 537. Up to 132 conditions per place. [2024-11-17 03:26:03,935 INFO L140 encePairwiseOnDemand]: 117/137 looper letters, 48 selfloop transitions, 16 changer transitions 3/100 dead transitions. [2024-11-17 03:26:03,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 100 transitions, 438 flow [2024-11-17 03:26:03,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 03:26:03,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-17 03:26:03,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 467 transitions. [2024-11-17 03:26:03,937 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4869655891553702 [2024-11-17 03:26:03,937 INFO L175 Difference]: Start difference. First operand has 116 places, 95 transitions, 294 flow. Second operand 7 states and 467 transitions. [2024-11-17 03:26:03,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 100 transitions, 438 flow [2024-11-17 03:26:03,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 100 transitions, 402 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-17 03:26:03,940 INFO L231 Difference]: Finished difference. Result has 111 places, 91 transitions, 282 flow [2024-11-17 03:26:03,941 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=111, PETRI_TRANSITIONS=91} [2024-11-17 03:26:03,941 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -27 predicate places. [2024-11-17 03:26:03,942 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 91 transitions, 282 flow [2024-11-17 03:26:03,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 60.57142857142857) internal successors, (424), 7 states have internal predecessors, (424), 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-17 03:26:03,942 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:03,942 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:26:03,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 03:26:03,942 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:26:03,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:03,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1749153579, now seen corresponding path program 1 times [2024-11-17 03:26:03,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:03,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579013961] [2024-11-17 03:26:03,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:03,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 03:26:04,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:04,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579013961] [2024-11-17 03:26:04,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579013961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:04,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:04,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:26:04,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200465231] [2024-11-17 03:26:04,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:04,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:26:04,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:04,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:26:04,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:26:04,645 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 137 [2024-11-17 03:26:04,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 91 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 83.0) internal successors, (415), 5 states have internal predecessors, (415), 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-17 03:26:04,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:04,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 137 [2024-11-17 03:26:04,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:04,805 INFO L124 PetriNetUnfolderBase]: 64/290 cut-off events. [2024-11-17 03:26:04,805 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-11-17 03:26:04,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 290 events. 64/290 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1102 event pairs, 63 based on Foata normal form. 1/247 useless extension candidates. Maximal degree in co-relation 528. Up to 170 conditions per place. [2024-11-17 03:26:04,807 INFO L140 encePairwiseOnDemand]: 123/137 looper letters, 39 selfloop transitions, 13 changer transitions 0/90 dead transitions. [2024-11-17 03:26:04,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 90 transitions, 384 flow [2024-11-17 03:26:04,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:26:04,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:26:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 443 transitions. [2024-11-17 03:26:04,809 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6467153284671533 [2024-11-17 03:26:04,809 INFO L175 Difference]: Start difference. First operand has 111 places, 91 transitions, 282 flow. Second operand 5 states and 443 transitions. [2024-11-17 03:26:04,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 90 transitions, 384 flow [2024-11-17 03:26:04,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 90 transitions, 352 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-17 03:26:04,811 INFO L231 Difference]: Finished difference. Result has 108 places, 90 transitions, 274 flow [2024-11-17 03:26:04,811 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=108, PETRI_TRANSITIONS=90} [2024-11-17 03:26:04,812 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -30 predicate places. [2024-11-17 03:26:04,812 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 90 transitions, 274 flow [2024-11-17 03:26:04,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.0) internal successors, (415), 5 states have internal predecessors, (415), 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-17 03:26:04,813 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:04,813 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:26:04,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 03:26:04,813 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:26:04,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:04,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1749153578, now seen corresponding path program 1 times [2024-11-17 03:26:04,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:04,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94970978] [2024-11-17 03:26:04,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:04,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 03:26:04,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:04,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94970978] [2024-11-17 03:26:04,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94970978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:04,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:04,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:26:04,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474834090] [2024-11-17 03:26:04,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:04,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:26:04,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:04,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:26:04,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:26:05,192 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 137 [2024-11-17 03:26:05,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 90 transitions, 274 flow. Second operand has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 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-17 03:26:05,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:05,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 137 [2024-11-17 03:26:05,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:05,336 INFO L124 PetriNetUnfolderBase]: 64/289 cut-off events. [2024-11-17 03:26:05,336 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-11-17 03:26:05,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 289 events. 64/289 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1091 event pairs, 63 based on Foata normal form. 1/245 useless extension candidates. Maximal degree in co-relation 521. Up to 170 conditions per place. [2024-11-17 03:26:05,337 INFO L140 encePairwiseOnDemand]: 123/137 looper letters, 45 selfloop transitions, 13 changer transitions 0/89 dead transitions. [2024-11-17 03:26:05,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 89 transitions, 388 flow [2024-11-17 03:26:05,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:26:05,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:26:05,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 419 transitions. [2024-11-17 03:26:05,339 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6116788321167883 [2024-11-17 03:26:05,339 INFO L175 Difference]: Start difference. First operand has 108 places, 90 transitions, 274 flow. Second operand 5 states and 419 transitions. [2024-11-17 03:26:05,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 89 transitions, 388 flow [2024-11-17 03:26:05,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 89 transitions, 362 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:26:05,341 INFO L231 Difference]: Finished difference. Result has 107 places, 89 transitions, 272 flow [2024-11-17 03:26:05,342 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=272, PETRI_PLACES=107, PETRI_TRANSITIONS=89} [2024-11-17 03:26:05,342 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -31 predicate places. [2024-11-17 03:26:05,342 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 89 transitions, 272 flow [2024-11-17 03:26:05,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 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-17 03:26:05,343 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:05,343 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 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-17 03:26:05,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 03:26:05,343 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:26:05,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:05,343 INFO L85 PathProgramCache]: Analyzing trace with hash -62439299, now seen corresponding path program 1 times [2024-11-17 03:26:05,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:05,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304125935] [2024-11-17 03:26:05,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:05,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:06,206 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 03:26:06,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:06,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304125935] [2024-11-17 03:26:06,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304125935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:06,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:06,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 03:26:06,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029384177] [2024-11-17 03:26:06,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:06,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 03:26:06,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:06,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 03:26:06,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-17 03:26:06,962 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 137 [2024-11-17 03:26:06,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 89 transitions, 272 flow. Second operand has 10 states, 10 states have (on average 80.5) internal successors, (805), 10 states have internal predecessors, (805), 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-17 03:26:06,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:06,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 137 [2024-11-17 03:26:06,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:07,208 INFO L124 PetriNetUnfolderBase]: 64/288 cut-off events. [2024-11-17 03:26:07,209 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-11-17 03:26:07,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 288 events. 64/288 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1099 event pairs, 54 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 522. Up to 135 conditions per place. [2024-11-17 03:26:07,211 INFO L140 encePairwiseOnDemand]: 124/137 looper letters, 54 selfloop transitions, 12 changer transitions 3/97 dead transitions. [2024-11-17 03:26:07,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 97 transitions, 426 flow [2024-11-17 03:26:07,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:26:07,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-17 03:26:07,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 684 transitions. [2024-11-17 03:26:07,213 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6240875912408759 [2024-11-17 03:26:07,214 INFO L175 Difference]: Start difference. First operand has 107 places, 89 transitions, 272 flow. Second operand 8 states and 684 transitions. [2024-11-17 03:26:07,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 97 transitions, 426 flow [2024-11-17 03:26:07,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 97 transitions, 400 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:26:07,216 INFO L231 Difference]: Finished difference. Result has 109 places, 88 transitions, 268 flow [2024-11-17 03:26:07,217 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=268, PETRI_PLACES=109, PETRI_TRANSITIONS=88} [2024-11-17 03:26:07,217 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -29 predicate places. [2024-11-17 03:26:07,217 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 88 transitions, 268 flow [2024-11-17 03:26:07,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 80.5) internal successors, (805), 10 states have internal predecessors, (805), 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-17 03:26:07,218 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:07,218 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 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-17 03:26:07,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 03:26:07,218 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:26:07,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:07,219 INFO L85 PathProgramCache]: Analyzing trace with hash -62439298, now seen corresponding path program 1 times [2024-11-17 03:26:07,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:07,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793563746] [2024-11-17 03:26:07,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:07,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:09,073 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 03:26:09,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:09,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793563746] [2024-11-17 03:26:09,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793563746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:09,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:09,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-17 03:26:09,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775407382] [2024-11-17 03:26:09,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:09,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 03:26:09,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:09,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 03:26:09,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-17 03:26:11,069 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 137 [2024-11-17 03:26:11,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 88 transitions, 268 flow. Second operand has 14 states, 14 states have (on average 55.785714285714285) internal successors, (781), 14 states have internal predecessors, (781), 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-17 03:26:11,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:11,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 137 [2024-11-17 03:26:11,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:11,515 INFO L124 PetriNetUnfolderBase]: 64/286 cut-off events. [2024-11-17 03:26:11,515 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-11-17 03:26:11,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 286 events. 64/286 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1095 event pairs, 54 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 528. Up to 134 conditions per place. [2024-11-17 03:26:11,517 INFO L140 encePairwiseOnDemand]: 119/137 looper letters, 50 selfloop transitions, 16 changer transitions 3/95 dead transitions. [2024-11-17 03:26:11,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 95 transitions, 420 flow [2024-11-17 03:26:11,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 03:26:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-17 03:26:11,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 763 transitions. [2024-11-17 03:26:11,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42841100505334084 [2024-11-17 03:26:11,521 INFO L175 Difference]: Start difference. First operand has 109 places, 88 transitions, 268 flow. Second operand 13 states and 763 transitions. [2024-11-17 03:26:11,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 95 transitions, 420 flow [2024-11-17 03:26:11,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 95 transitions, 396 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-17 03:26:11,524 INFO L231 Difference]: Finished difference. Result has 112 places, 86 transitions, 272 flow [2024-11-17 03:26:11,524 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=272, PETRI_PLACES=112, PETRI_TRANSITIONS=86} [2024-11-17 03:26:11,524 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -26 predicate places. [2024-11-17 03:26:11,524 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 86 transitions, 272 flow [2024-11-17 03:26:11,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 55.785714285714285) internal successors, (781), 14 states have internal predecessors, (781), 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-17 03:26:11,525 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:11,525 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 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-17 03:26:11,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 03:26:11,525 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:26:11,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:11,526 INFO L85 PathProgramCache]: Analyzing trace with hash 125400444, now seen corresponding path program 1 times [2024-11-17 03:26:11,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:11,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475212677] [2024-11-17 03:26:11,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:11,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:11,793 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 03:26:11,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:11,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475212677] [2024-11-17 03:26:11,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475212677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:11,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:11,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:26:11,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628081431] [2024-11-17 03:26:11,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:11,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:26:11,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:11,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:26:11,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:26:12,010 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 137 [2024-11-17 03:26:12,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 86 transitions, 272 flow. Second operand has 5 states, 5 states have (on average 82.8) internal successors, (414), 5 states have internal predecessors, (414), 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-17 03:26:12,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:12,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 137 [2024-11-17 03:26:12,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:12,182 INFO L124 PetriNetUnfolderBase]: 73/286 cut-off events. [2024-11-17 03:26:12,182 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2024-11-17 03:26:12,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 286 events. 73/286 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1062 event pairs, 18 based on Foata normal form. 1/252 useless extension candidates. Maximal degree in co-relation 541. Up to 135 conditions per place. [2024-11-17 03:26:12,184 INFO L140 encePairwiseOnDemand]: 119/137 looper letters, 44 selfloop transitions, 16 changer transitions 0/93 dead transitions. [2024-11-17 03:26:12,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 93 transitions, 406 flow [2024-11-17 03:26:12,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:26:12,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:26:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2024-11-17 03:26:12,186 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6399026763990268 [2024-11-17 03:26:12,186 INFO L175 Difference]: Start difference. First operand has 112 places, 86 transitions, 272 flow. Second operand 6 states and 526 transitions. [2024-11-17 03:26:12,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 93 transitions, 406 flow [2024-11-17 03:26:12,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 93 transitions, 374 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-17 03:26:12,189 INFO L231 Difference]: Finished difference. Result has 103 places, 84 transitions, 268 flow [2024-11-17 03:26:12,189 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=103, PETRI_TRANSITIONS=84} [2024-11-17 03:26:12,189 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -35 predicate places. [2024-11-17 03:26:12,190 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 84 transitions, 268 flow [2024-11-17 03:26:12,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.8) internal successors, (414), 5 states have internal predecessors, (414), 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-17 03:26:12,190 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:12,190 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 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-17 03:26:12,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 03:26:12,190 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:26:12,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:12,191 INFO L85 PathProgramCache]: Analyzing trace with hash 125400443, now seen corresponding path program 1 times [2024-11-17 03:26:12,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:12,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855020672] [2024-11-17 03:26:12,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:12,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:12,360 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 03:26:12,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:12,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855020672] [2024-11-17 03:26:12,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855020672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:12,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:12,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:26:12,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25875015] [2024-11-17 03:26:12,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:12,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:26:12,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:12,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:26:12,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:26:12,573 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 137 [2024-11-17 03:26:12,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 84 transitions, 268 flow. Second operand has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 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-17 03:26:12,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:12,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 137 [2024-11-17 03:26:12,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:12,726 INFO L124 PetriNetUnfolderBase]: 73/300 cut-off events. [2024-11-17 03:26:12,726 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2024-11-17 03:26:12,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 300 events. 73/300 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1169 event pairs, 45 based on Foata normal form. 2/256 useless extension candidates. Maximal degree in co-relation 561. Up to 108 conditions per place. [2024-11-17 03:26:12,728 INFO L140 encePairwiseOnDemand]: 117/137 looper letters, 48 selfloop transitions, 18 changer transitions 0/91 dead transitions. [2024-11-17 03:26:12,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 91 transitions, 414 flow [2024-11-17 03:26:12,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:26:12,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:26:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 496 transitions. [2024-11-17 03:26:12,730 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6034063260340633 [2024-11-17 03:26:12,730 INFO L175 Difference]: Start difference. First operand has 103 places, 84 transitions, 268 flow. Second operand 6 states and 496 transitions. [2024-11-17 03:26:12,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 91 transitions, 414 flow [2024-11-17 03:26:12,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 91 transitions, 382 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-17 03:26:12,733 INFO L231 Difference]: Finished difference. Result has 101 places, 82 transitions, 268 flow [2024-11-17 03:26:12,733 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=101, PETRI_TRANSITIONS=82} [2024-11-17 03:26:12,733 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -37 predicate places. [2024-11-17 03:26:12,733 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 82 transitions, 268 flow [2024-11-17 03:26:12,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 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-17 03:26:12,734 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:12,734 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:26:12,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-17 03:26:12,734 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:26:12,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:12,734 INFO L85 PathProgramCache]: Analyzing trace with hash 612655436, now seen corresponding path program 1 times [2024-11-17 03:26:12,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:12,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353048030] [2024-11-17 03:26:12,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:12,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:12,951 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 03:26:12,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:12,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353048030] [2024-11-17 03:26:12,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353048030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:12,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:12,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:26:12,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752136815] [2024-11-17 03:26:12,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:12,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:26:12,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:12,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:26:12,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:26:13,040 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 137 [2024-11-17 03:26:13,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 82 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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-17 03:26:13,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:13,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 137 [2024-11-17 03:26:13,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:13,161 INFO L124 PetriNetUnfolderBase]: 64/285 cut-off events. [2024-11-17 03:26:13,162 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2024-11-17 03:26:13,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 285 events. 64/285 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1104 event pairs, 56 based on Foata normal form. 8/256 useless extension candidates. Maximal degree in co-relation 541. Up to 162 conditions per place. [2024-11-17 03:26:13,163 INFO L140 encePairwiseOnDemand]: 133/137 looper letters, 55 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2024-11-17 03:26:13,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 87 transitions, 398 flow [2024-11-17 03:26:13,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:26:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:26:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2024-11-17 03:26:13,165 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.805352798053528 [2024-11-17 03:26:13,166 INFO L175 Difference]: Start difference. First operand has 101 places, 82 transitions, 268 flow. Second operand 3 states and 331 transitions. [2024-11-17 03:26:13,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 87 transitions, 398 flow [2024-11-17 03:26:13,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 87 transitions, 356 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-17 03:26:13,168 INFO L231 Difference]: Finished difference. Result has 96 places, 80 transitions, 232 flow [2024-11-17 03:26:13,168 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=96, PETRI_TRANSITIONS=80} [2024-11-17 03:26:13,169 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -42 predicate places. [2024-11-17 03:26:13,169 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 80 transitions, 232 flow [2024-11-17 03:26:13,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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-17 03:26:13,169 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:13,169 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:26:13,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-17 03:26:13,170 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:26:13,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:13,170 INFO L85 PathProgramCache]: Analyzing trace with hash 612655435, now seen corresponding path program 1 times [2024-11-17 03:26:13,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:13,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797790003] [2024-11-17 03:26:13,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:13,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 03:26:13,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:13,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797790003] [2024-11-17 03:26:13,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797790003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:13,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:13,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:26:13,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703888026] [2024-11-17 03:26:13,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:13,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:26:13,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:13,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:26:13,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:26:13,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 137 [2024-11-17 03:26:13,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 80 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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-17 03:26:13,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:13,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 137 [2024-11-17 03:26:13,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:13,535 INFO L124 PetriNetUnfolderBase]: 71/276 cut-off events. [2024-11-17 03:26:13,536 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-11-17 03:26:13,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 276 events. 71/276 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 985 event pairs, 56 based on Foata normal form. 8/255 useless extension candidates. Maximal degree in co-relation 518. Up to 162 conditions per place. [2024-11-17 03:26:13,537 INFO L140 encePairwiseOnDemand]: 133/137 looper letters, 56 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2024-11-17 03:26:13,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 85 transitions, 358 flow [2024-11-17 03:26:13,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:26:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:26:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2024-11-17 03:26:13,539 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8004866180048662 [2024-11-17 03:26:13,539 INFO L175 Difference]: Start difference. First operand has 96 places, 80 transitions, 232 flow. Second operand 3 states and 329 transitions. [2024-11-17 03:26:13,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 85 transitions, 358 flow [2024-11-17 03:26:13,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 85 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:26:13,541 INFO L231 Difference]: Finished difference. Result has 94 places, 78 transitions, 228 flow [2024-11-17 03:26:13,541 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=94, PETRI_TRANSITIONS=78} [2024-11-17 03:26:13,542 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -44 predicate places. [2024-11-17 03:26:13,542 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 78 transitions, 228 flow [2024-11-17 03:26:13,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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-17 03:26:13,542 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:13,542 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:26:13,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-17 03:26:13,543 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:26:13,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:13,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1795997702, now seen corresponding path program 1 times [2024-11-17 03:26:13,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:13,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524418913] [2024-11-17 03:26:13,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:13,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 03:26:14,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:14,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524418913] [2024-11-17 03:26:14,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524418913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:14,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:14,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:26:14,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209033951] [2024-11-17 03:26:14,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:14,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:26:14,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:14,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:26:14,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:26:14,513 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 137 [2024-11-17 03:26:14,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 78 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 78.57142857142857) internal successors, (550), 7 states have internal predecessors, (550), 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-17 03:26:14,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:14,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 137 [2024-11-17 03:26:14,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:14,721 INFO L124 PetriNetUnfolderBase]: 85/324 cut-off events. [2024-11-17 03:26:14,721 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-11-17 03:26:14,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 324 events. 85/324 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1289 event pairs, 60 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 604. Up to 159 conditions per place. [2024-11-17 03:26:14,723 INFO L140 encePairwiseOnDemand]: 125/137 looper letters, 61 selfloop transitions, 11 changer transitions 3/97 dead transitions. [2024-11-17 03:26:14,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 97 transitions, 424 flow [2024-11-17 03:26:14,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:26:14,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:26:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 510 transitions. [2024-11-17 03:26:14,724 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6204379562043796 [2024-11-17 03:26:14,725 INFO L175 Difference]: Start difference. First operand has 94 places, 78 transitions, 228 flow. Second operand 6 states and 510 transitions. [2024-11-17 03:26:14,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 97 transitions, 424 flow [2024-11-17 03:26:14,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 97 transitions, 412 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:26:14,729 INFO L231 Difference]: Finished difference. Result has 98 places, 80 transitions, 259 flow [2024-11-17 03:26:14,729 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=259, PETRI_PLACES=98, PETRI_TRANSITIONS=80} [2024-11-17 03:26:14,729 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -40 predicate places. [2024-11-17 03:26:14,729 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 80 transitions, 259 flow [2024-11-17 03:26:14,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.57142857142857) internal successors, (550), 7 states have internal predecessors, (550), 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-17 03:26:14,730 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:14,730 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:26:14,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-17 03:26:14,730 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:26:14,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1795997701, now seen corresponding path program 1 times [2024-11-17 03:26:14,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:14,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855996635] [2024-11-17 03:26:14,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:14,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:15,013 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 03:26:15,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:15,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855996635] [2024-11-17 03:26:15,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855996635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:15,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:15,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:26:15,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335488351] [2024-11-17 03:26:15,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:15,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:26:15,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:15,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:26:15,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:26:15,390 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 137 [2024-11-17 03:26:15,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 80 transitions, 259 flow. Second operand has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 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-17 03:26:15,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:15,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 137 [2024-11-17 03:26:15,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:15,581 INFO L124 PetriNetUnfolderBase]: 79/302 cut-off events. [2024-11-17 03:26:15,581 INFO L125 PetriNetUnfolderBase]: For 116/122 co-relation queries the response was YES. [2024-11-17 03:26:15,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 302 events. 79/302 cut-off events. For 116/122 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1138 event pairs, 54 based on Foata normal form. 17/288 useless extension candidates. Maximal degree in co-relation 614. Up to 139 conditions per place. [2024-11-17 03:26:15,583 INFO L140 encePairwiseOnDemand]: 126/137 looper letters, 60 selfloop transitions, 11 changer transitions 3/96 dead transitions. [2024-11-17 03:26:15,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 96 transitions, 441 flow [2024-11-17 03:26:15,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:26:15,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:26:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 556 transitions. [2024-11-17 03:26:15,585 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6763990267639902 [2024-11-17 03:26:15,585 INFO L175 Difference]: Start difference. First operand has 98 places, 80 transitions, 259 flow. Second operand 6 states and 556 transitions. [2024-11-17 03:26:15,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 96 transitions, 441 flow [2024-11-17 03:26:15,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 96 transitions, 422 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:26:15,589 INFO L231 Difference]: Finished difference. Result has 98 places, 79 transitions, 260 flow [2024-11-17 03:26:15,589 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=260, PETRI_PLACES=98, PETRI_TRANSITIONS=79} [2024-11-17 03:26:15,592 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -40 predicate places. [2024-11-17 03:26:15,592 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 79 transitions, 260 flow [2024-11-17 03:26:15,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 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-17 03:26:15,592 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:15,592 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:26:15,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-17 03:26:15,593 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:26:15,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:15,593 INFO L85 PathProgramCache]: Analyzing trace with hash -158645328, now seen corresponding path program 1 times [2024-11-17 03:26:15,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:15,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251335581] [2024-11-17 03:26:15,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:15,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 03:26:20,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:20,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251335581] [2024-11-17 03:26:20,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251335581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:20,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:20,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-11-17 03:26:20,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633177761] [2024-11-17 03:26:20,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:20,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-17 03:26:20,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:20,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-17 03:26:20,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2024-11-17 03:26:25,698 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 137 [2024-11-17 03:26:25,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 79 transitions, 260 flow. Second operand has 28 states, 28 states have (on average 39.392857142857146) internal successors, (1103), 28 states have internal predecessors, (1103), 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-17 03:26:25,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:25,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 137 [2024-11-17 03:26:25,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:27,265 INFO L124 PetriNetUnfolderBase]: 132/433 cut-off events. [2024-11-17 03:26:27,265 INFO L125 PetriNetUnfolderBase]: For 171/178 co-relation queries the response was YES. [2024-11-17 03:26:27,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 433 events. 132/433 cut-off events. For 171/178 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1924 event pairs, 6 based on Foata normal form. 0/397 useless extension candidates. Maximal degree in co-relation 902. Up to 84 conditions per place. [2024-11-17 03:26:27,268 INFO L140 encePairwiseOnDemand]: 111/137 looper letters, 76 selfloop transitions, 32 changer transitions 3/124 dead transitions. [2024-11-17 03:26:27,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 124 transitions, 592 flow [2024-11-17 03:26:27,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 03:26:27,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-11-17 03:26:27,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1013 transitions. [2024-11-17 03:26:27,272 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.30809002433090027 [2024-11-17 03:26:27,272 INFO L175 Difference]: Start difference. First operand has 98 places, 79 transitions, 260 flow. Second operand 24 states and 1013 transitions. [2024-11-17 03:26:27,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 124 transitions, 592 flow [2024-11-17 03:26:27,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 124 transitions, 560 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-17 03:26:27,275 INFO L231 Difference]: Finished difference. Result has 119 places, 87 transitions, 341 flow [2024-11-17 03:26:27,276 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=341, PETRI_PLACES=119, PETRI_TRANSITIONS=87} [2024-11-17 03:26:27,276 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -19 predicate places. [2024-11-17 03:26:27,276 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 87 transitions, 341 flow [2024-11-17 03:26:27,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 39.392857142857146) internal successors, (1103), 28 states have internal predecessors, (1103), 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-17 03:26:27,277 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:27,278 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:26:27,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-17 03:26:27,278 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:26:27,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:27,278 INFO L85 PathProgramCache]: Analyzing trace with hash -158645329, now seen corresponding path program 1 times [2024-11-17 03:26:27,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:27,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137285962] [2024-11-17 03:26:27,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:27,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:30,370 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 03:26:30,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:30,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137285962] [2024-11-17 03:26:30,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137285962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:30,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:30,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2024-11-17 03:26:30,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997735636] [2024-11-17 03:26:30,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:30,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-17 03:26:30,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:30,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-17 03:26:30,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2024-11-17 03:26:35,522 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 137 [2024-11-17 03:26:35,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 87 transitions, 341 flow. Second operand has 29 states, 29 states have (on average 59.3448275862069) internal successors, (1721), 29 states have internal predecessors, (1721), 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-17 03:26:35,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:35,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 137 [2024-11-17 03:26:35,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:36,954 INFO L124 PetriNetUnfolderBase]: 132/429 cut-off events. [2024-11-17 03:26:36,954 INFO L125 PetriNetUnfolderBase]: For 185/192 co-relation queries the response was YES. [2024-11-17 03:26:36,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 429 events. 132/429 cut-off events. For 185/192 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1902 event pairs, 6 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 961. Up to 101 conditions per place. [2024-11-17 03:26:36,957 INFO L140 encePairwiseOnDemand]: 108/137 looper letters, 71 selfloop transitions, 35 changer transitions 3/122 dead transitions. [2024-11-17 03:26:36,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 122 transitions, 633 flow [2024-11-17 03:26:36,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-17 03:26:36,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2024-11-17 03:26:36,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1780 transitions. [2024-11-17 03:26:36,965 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4480241631009313 [2024-11-17 03:26:36,965 INFO L175 Difference]: Start difference. First operand has 119 places, 87 transitions, 341 flow. Second operand 29 states and 1780 transitions. [2024-11-17 03:26:36,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 122 transitions, 633 flow [2024-11-17 03:26:36,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 122 transitions, 598 flow, removed 0 selfloop flow, removed 16 redundant places. [2024-11-17 03:26:36,968 INFO L231 Difference]: Finished difference. Result has 134 places, 88 transitions, 395 flow [2024-11-17 03:26:36,969 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=395, PETRI_PLACES=134, PETRI_TRANSITIONS=88} [2024-11-17 03:26:36,969 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -4 predicate places. [2024-11-17 03:26:36,969 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 88 transitions, 395 flow [2024-11-17 03:26:36,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 59.3448275862069) internal successors, (1721), 29 states have internal predecessors, (1721), 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-17 03:26:36,970 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:36,970 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:26:36,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-17 03:26:36,971 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:26:36,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:36,971 INFO L85 PathProgramCache]: Analyzing trace with hash 351378892, now seen corresponding path program 1 times [2024-11-17 03:26:36,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:36,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912094339] [2024-11-17 03:26:36,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:36,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:37,887 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 03:26:37,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:37,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912094339] [2024-11-17 03:26:37,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912094339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:37,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:37,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 03:26:37,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783216486] [2024-11-17 03:26:37,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:37,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 03:26:37,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:37,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 03:26:37,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-17 03:26:38,583 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 137 [2024-11-17 03:26:38,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 88 transitions, 395 flow. Second operand has 9 states, 9 states have (on average 77.22222222222223) internal successors, (695), 9 states have internal predecessors, (695), 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-17 03:26:38,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:38,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 137 [2024-11-17 03:26:38,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:38,741 INFO L124 PetriNetUnfolderBase]: 107/365 cut-off events. [2024-11-17 03:26:38,741 INFO L125 PetriNetUnfolderBase]: For 335/343 co-relation queries the response was YES. [2024-11-17 03:26:38,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 365 events. 107/365 cut-off events. For 335/343 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1542 event pairs, 59 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 915. Up to 222 conditions per place. [2024-11-17 03:26:38,744 INFO L140 encePairwiseOnDemand]: 122/137 looper letters, 53 selfloop transitions, 14 changer transitions 0/95 dead transitions. [2024-11-17 03:26:38,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 95 transitions, 566 flow [2024-11-17 03:26:38,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:26:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:26:38,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 420 transitions. [2024-11-17 03:26:38,746 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6131386861313869 [2024-11-17 03:26:38,747 INFO L175 Difference]: Start difference. First operand has 134 places, 88 transitions, 395 flow. Second operand 5 states and 420 transitions. [2024-11-17 03:26:38,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 95 transitions, 566 flow [2024-11-17 03:26:38,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 95 transitions, 497 flow, removed 0 selfloop flow, removed 26 redundant places. [2024-11-17 03:26:38,752 INFO L231 Difference]: Finished difference. Result has 111 places, 87 transitions, 358 flow [2024-11-17 03:26:38,752 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=358, PETRI_PLACES=111, PETRI_TRANSITIONS=87} [2024-11-17 03:26:38,753 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, -27 predicate places. [2024-11-17 03:26:38,753 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 87 transitions, 358 flow [2024-11-17 03:26:38,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 77.22222222222223) internal successors, (695), 9 states have internal predecessors, (695), 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-17 03:26:38,754 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:38,754 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:26:38,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-17 03:26:38,755 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-17 03:26:38,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:38,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1992155376, now seen corresponding path program 1 times [2024-11-17 03:26:38,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:38,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888360659] [2024-11-17 03:26:38,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:38,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:26:39,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:26:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:26:39,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 03:26:39,471 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:26:39,473 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 92 remaining) [2024-11-17 03:26:39,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 92 remaining) [2024-11-17 03:26:39,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 92 remaining) [2024-11-17 03:26:39,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 92 remaining) [2024-11-17 03:26:39,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 92 remaining) [2024-11-17 03:26:39,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 92 remaining) [2024-11-17 03:26:39,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 92 remaining) [2024-11-17 03:26:39,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 92 remaining) [2024-11-17 03:26:39,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 92 remaining) [2024-11-17 03:26:39,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 92 remaining) [2024-11-17 03:26:39,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 92 remaining) [2024-11-17 03:26:39,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 92 remaining) [2024-11-17 03:26:39,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 92 remaining) [2024-11-17 03:26:39,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 92 remaining) [2024-11-17 03:26:39,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 92 remaining) [2024-11-17 03:26:39,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 92 remaining) [2024-11-17 03:26:39,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 92 remaining) [2024-11-17 03:26:39,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 92 remaining) [2024-11-17 03:26:39,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 92 remaining) [2024-11-17 03:26:39,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 92 remaining) [2024-11-17 03:26:39,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 92 remaining) [2024-11-17 03:26:39,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 92 remaining) [2024-11-17 03:26:39,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 92 remaining) [2024-11-17 03:26:39,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 92 remaining) [2024-11-17 03:26:39,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 92 remaining) [2024-11-17 03:26:39,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 92 remaining) [2024-11-17 03:26:39,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 92 remaining) [2024-11-17 03:26:39,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 92 remaining) [2024-11-17 03:26:39,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 92 remaining) [2024-11-17 03:26:39,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 92 remaining) [2024-11-17 03:26:39,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 92 remaining) [2024-11-17 03:26:39,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 92 remaining) [2024-11-17 03:26:39,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 92 remaining) [2024-11-17 03:26:39,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 92 remaining) [2024-11-17 03:26:39,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 92 remaining) [2024-11-17 03:26:39,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 92 remaining) [2024-11-17 03:26:39,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 92 remaining) [2024-11-17 03:26:39,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 92 remaining) [2024-11-17 03:26:39,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 92 remaining) [2024-11-17 03:26:39,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 92 remaining) [2024-11-17 03:26:39,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 92 remaining) [2024-11-17 03:26:39,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 92 remaining) [2024-11-17 03:26:39,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 92 remaining) [2024-11-17 03:26:39,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 92 remaining) [2024-11-17 03:26:39,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 92 remaining) [2024-11-17 03:26:39,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 92 remaining) [2024-11-17 03:26:39,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 92 remaining) [2024-11-17 03:26:39,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 92 remaining) [2024-11-17 03:26:39,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 92 remaining) [2024-11-17 03:26:39,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 92 remaining) [2024-11-17 03:26:39,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 92 remaining) [2024-11-17 03:26:39,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 92 remaining) [2024-11-17 03:26:39,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 92 remaining) [2024-11-17 03:26:39,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 92 remaining) [2024-11-17 03:26:39,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 92 remaining) [2024-11-17 03:26:39,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 92 remaining) [2024-11-17 03:26:39,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 92 remaining) [2024-11-17 03:26:39,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 92 remaining) [2024-11-17 03:26:39,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 92 remaining) [2024-11-17 03:26:39,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 92 remaining) [2024-11-17 03:26:39,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 92 remaining) [2024-11-17 03:26:39,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 92 remaining) [2024-11-17 03:26:39,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 92 remaining) [2024-11-17 03:26:39,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 92 remaining) [2024-11-17 03:26:39,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 92 remaining) [2024-11-17 03:26:39,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 92 remaining) [2024-11-17 03:26:39,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 92 remaining) [2024-11-17 03:26:39,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (24 of 92 remaining) [2024-11-17 03:26:39,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 92 remaining) [2024-11-17 03:26:39,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 92 remaining) [2024-11-17 03:26:39,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 92 remaining) [2024-11-17 03:26:39,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 92 remaining) [2024-11-17 03:26:39,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 92 remaining) [2024-11-17 03:26:39,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 92 remaining) [2024-11-17 03:26:39,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 92 remaining) [2024-11-17 03:26:39,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 92 remaining) [2024-11-17 03:26:39,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 92 remaining) [2024-11-17 03:26:39,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 92 remaining) [2024-11-17 03:26:39,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 92 remaining) [2024-11-17 03:26:39,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 92 remaining) [2024-11-17 03:26:39,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 92 remaining) [2024-11-17 03:26:39,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 92 remaining) [2024-11-17 03:26:39,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 92 remaining) [2024-11-17 03:26:39,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 92 remaining) [2024-11-17 03:26:39,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 92 remaining) [2024-11-17 03:26:39,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 92 remaining) [2024-11-17 03:26:39,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 92 remaining) [2024-11-17 03:26:39,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 92 remaining) [2024-11-17 03:26:39,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 92 remaining) [2024-11-17 03:26:39,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 92 remaining) [2024-11-17 03:26:39,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 92 remaining) [2024-11-17 03:26:39,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 92 remaining) [2024-11-17 03:26:39,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-17 03:26:39,488 INFO L407 BasicCegarLoop]: Path program 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, 1] [2024-11-17 03:26:39,566 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 03:26:39,567 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:26:39,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:26:39 BasicIcfg [2024-11-17 03:26:39,573 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:26:39,573 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:26:39,574 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:26:39,574 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:26:39,574 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:25:52" (3/4) ... [2024-11-17 03:26:39,575 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-17 03:26:39,652 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 03:26:39,653 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:26:39,653 INFO L158 Benchmark]: Toolchain (without parser) took 49931.85ms. Allocated memory was 157.3MB in the beginning and 885.0MB in the end (delta: 727.7MB). Free memory was 123.2MB in the beginning and 700.9MB in the end (delta: -577.7MB). Peak memory consumption was 149.0MB. Max. memory is 16.1GB. [2024-11-17 03:26:39,653 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:26:39,654 INFO L158 Benchmark]: CACSL2BoogieTranslator took 801.72ms. Allocated memory is still 157.3MB. Free memory was 123.2MB in the beginning and 78.1MB in the end (delta: 45.1MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-17 03:26:39,654 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.76ms. Allocated memory is still 157.3MB. Free memory was 78.1MB in the beginning and 73.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 03:26:39,654 INFO L158 Benchmark]: Boogie Preprocessor took 87.72ms. Allocated memory is still 157.3MB. Free memory was 73.9MB in the beginning and 69.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 03:26:39,654 INFO L158 Benchmark]: IcfgBuilder took 1302.88ms. Allocated memory is still 157.3MB. Free memory was 69.7MB in the beginning and 61.6MB in the end (delta: 8.1MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2024-11-17 03:26:39,655 INFO L158 Benchmark]: TraceAbstraction took 47562.52ms. Allocated memory was 157.3MB in the beginning and 885.0MB in the end (delta: 727.7MB). Free memory was 61.6MB in the beginning and 710.3MB in the end (delta: -648.7MB). Peak memory consumption was 477.7MB. Max. memory is 16.1GB. [2024-11-17 03:26:39,656 INFO L158 Benchmark]: Witness Printer took 79.33ms. Allocated memory is still 885.0MB. Free memory was 710.3MB in the beginning and 700.9MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-17 03:26:39,657 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 801.72ms. Allocated memory is still 157.3MB. Free memory was 123.2MB in the beginning and 78.1MB in the end (delta: 45.1MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.76ms. Allocated memory is still 157.3MB. Free memory was 78.1MB in the beginning and 73.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.72ms. Allocated memory is still 157.3MB. Free memory was 73.9MB in the beginning and 69.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1302.88ms. Allocated memory is still 157.3MB. Free memory was 69.7MB in the beginning and 61.6MB in the end (delta: 8.1MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * TraceAbstraction took 47562.52ms. Allocated memory was 157.3MB in the beginning and 885.0MB in the end (delta: 727.7MB). Free memory was 61.6MB in the beginning and 710.3MB in the end (delta: -648.7MB). Peak memory consumption was 477.7MB. Max. memory is 16.1GB. * Witness Printer took 79.33ms. Allocated memory is still 885.0MB. Free memory was 710.3MB in the beginning and 700.9MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1254] 0 int i = 0; VAL [i=0, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=1, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=2, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=3, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=4, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=5, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=6, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=7, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=8, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=9, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=10, mutex={1:0}, slot={2:0}] [L1254] COND FALSE 0 !(i < 10) VAL [i=10, mutex={1:0}, slot={2:0}] [L1256] 0 int j = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(); [L1256] 0 int j = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(); [L1257] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1257] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1258] CALL 0 assume_abort_if_not(0 <= k && k < 10) [L11] COND FALSE 0 !(!cond) [L1258] RET 0 assume_abort_if_not(0 <= k && k < 10) [L1259] 0 struct s *p; [L1260] 0 pthread_t t1; [L1261] CALL, EXPR 0 new(1) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1261] RET, EXPR 0 new(1) [L1261] 0 slot[j] = new(1) [L1262] CALL, EXPR 0 new(2) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1262] RET, EXPR 0 new(2) [L1262] EXPR 0 slot[j] [L1262] CALL 0 list_add(new(2), slot[j]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [mutex={1:0}, slot={2:0}] [L1241] 0 node->next = temp [L1262] RET 0 list_add(new(2), slot[j]) [L1263] CALL, EXPR 0 new(1) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1263] RET, EXPR 0 new(1) [L1263] 0 slot[k] = new(1) [L1264] CALL, EXPR 0 new(2) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1264] RET, EXPR 0 new(2) [L1264] EXPR 0 slot[k] [L1264] CALL 0 list_add(new(2), slot[k]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [mutex={1:0}, slot={2:0}] [L1241] 0 node->next = temp [L1264] RET 0 list_add(new(2), slot[k]) [L1265] CALL, EXPR 0 new(3) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1265] RET, EXPR 0 new(3) [L1265] 0 p = new(3) [L1266] EXPR 0 slot[j] [L1266] CALL 0 list_add(p, slot[j]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [mutex={1:0}, slot={2:0}] [L1241] 0 node->next = temp [L1266] RET 0 list_add(p, slot[j]) [L1267] CALL, EXPR 0 new(3) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1267] RET, EXPR 0 new(3) [L1267] 0 p = new(3) [L1268] EXPR 0 slot[k] [L1268] CALL 0 list_add(p, slot[k]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [mutex={1:0}, slot={2:0}] [L1241] 0 node->next = temp [L1268] RET 0 list_add(p, slot[k]) [L1269] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [j=9, k=2, mutex={1:0}, p={5:0}, slot={2:0}, t1=-1] [L1246] 1 int i = __VERIFIER_nondet_int(); [L1247] CALL 1 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 1 !(!cond) [L1247] RET 1 assume_abort_if_not(0 <= i && i < 10) [L1249] CALL, EXPR 1 new(3) [L1233] 1 struct s *p = malloc(sizeof(struct s)); [L1234] 1 p->datum = x VAL [\old(arg)={0:0}, arg={0:0}, i=5, mutex={1:0}, slot={2:0}] [L1235] 1 p->next = ((void *)0) [L1236] 1 return p; [L1249] RET, EXPR 1 new(3) [L1249] EXPR 1 slot[i] [L1249] CALL 1 list_add(new(3), slot[i]) [L1239] 1 list->next - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1253]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1269]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 161 locations, 92 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 47.3s, OverallIterations: 28, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12550 SdHoareTripleChecker+Valid, 23.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9745 mSDsluCounter, 8113 SdHoareTripleChecker+Invalid, 20.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7581 mSDsCounter, 779 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43410 IncrementalHoareTripleChecker+Invalid, 44189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 779 mSolverCounterUnsat, 532 mSDtfsCounter, 43410 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=395occurred in iteration=26, InterpolantAutomatonStates: 198, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 1113 NumberOfCodeBlocks, 1113 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1040 ConstructedInterpolants, 0 QuantifiedInterpolants, 8858 SizeOfPredicates, 0 NumberOfNonLiveVariables, 418 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 31 InterpolantComputations, 25 PerfectInterpolantSequences, 2440/2506 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-17 03:26:39,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)