./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/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 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-wip.fs.cvc5-61a6796-m [2024-10-14 19:41:25,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:41:25,260 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:41:25,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:41:25,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:41:25,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:41:25,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:41:25,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:41:25,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:41:25,290 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:41:25,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:41:25,290 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:41:25,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:41:25,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:41:25,292 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:41:25,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:41:25,292 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:41:25,293 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:41:25,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:41:25,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:41:25,298 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:41:25,298 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:41:25,299 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:41:25,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:41:25,299 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:41:25,299 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:41:25,299 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:41:25,300 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:41:25,300 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:41:25,300 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:41:25,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:41:25,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:41:25,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:41:25,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:41:25,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:41:25,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:41:25,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:41:25,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:41:25,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:41:25,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:41:25,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:41:25,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:41:25,304 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-10-14 19:41:25,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:41:25,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:41:25,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:41:25,560 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:41:25,561 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:41:25,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i [2024-10-14 19:41:27,016 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:41:27,305 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:41:27,306 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i [2024-10-14 19:41:27,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ed506b1b/11e371fe953541d1a98e8a161a6f5068/FLAG2d96081f1 [2024-10-14 19:41:27,336 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ed506b1b/11e371fe953541d1a98e8a161a6f5068 [2024-10-14 19:41:27,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:41:27,339 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:41:27,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:41:27,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:41:27,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:41:27,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:41:27" (1/1) ... [2024-10-14 19:41:27,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@281b2d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:27, skipping insertion in model container [2024-10-14 19:41:27,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:41:27" (1/1) ... [2024-10-14 19:41:27,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:41:27,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:41:27,913 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:41:28,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:41:28,116 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:41:28,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:28 WrapperNode [2024-10-14 19:41:28,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:41:28,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:41:28,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:41:28,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:41:28,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:28" (1/1) ... [2024-10-14 19:41:28,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:28" (1/1) ... [2024-10-14 19:41:28,197 INFO L138 Inliner]: procedures = 370, calls = 40, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 202 [2024-10-14 19:41:28,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:41:28,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:41:28,201 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:41:28,201 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:41:28,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:28" (1/1) ... [2024-10-14 19:41:28,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:28" (1/1) ... [2024-10-14 19:41:28,220 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:28" (1/1) ... [2024-10-14 19:41:28,260 INFO L175 MemorySlicer]: Split 41 memory accesses to 3 slices as follows [1, 9, 31]. 76 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 28 writes are split as follows [1, 3, 24]. [2024-10-14 19:41:28,261 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:28" (1/1) ... [2024-10-14 19:41:28,261 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:28" (1/1) ... [2024-10-14 19:41:28,279 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:28" (1/1) ... [2024-10-14 19:41:28,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:28" (1/1) ... [2024-10-14 19:41:28,291 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:28" (1/1) ... [2024-10-14 19:41:28,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:28" (1/1) ... [2024-10-14 19:41:28,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:41:28,305 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:41:28,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:41:28,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:41:28,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:28" (1/1) ... [2024-10-14 19:41:28,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:41:28,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:41:28,338 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-10-14 19:41:28,342 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-10-14 19:41:28,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 19:41:28,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 19:41:28,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 19:41:28,383 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-14 19:41:28,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 19:41:28,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 19:41:28,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 19:41:28,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 19:41:28,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 19:41:28,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 19:41:28,385 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-14 19:41:28,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 19:41:28,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:41:28,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 19:41:28,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 19:41:28,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 19:41:28,387 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-14 19:41:28,387 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-14 19:41:28,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:41:28,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:41:28,390 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 19:41:28,561 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:41:28,562 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:41:29,115 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 19:41:29,115 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:41:29,331 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:41:29,331 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 19:41:29,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:41:29 BoogieIcfgContainer [2024-10-14 19:41:29,331 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:41:29,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:41:29,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:41:29,339 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:41:29,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:41:27" (1/3) ... [2024-10-14 19:41:29,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a722dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:41:29, skipping insertion in model container [2024-10-14 19:41:29,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:28" (2/3) ... [2024-10-14 19:41:29,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a722dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:41:29, skipping insertion in model container [2024-10-14 19:41:29,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:41:29" (3/3) ... [2024-10-14 19:41:29,344 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr-deref.i [2024-10-14 19:41:29,357 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:41:29,357 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 79 error locations. [2024-10-14 19:41:29,357 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 19:41:29,420 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-14 19:41:29,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 134 transitions, 272 flow [2024-10-14 19:41:29,537 INFO L124 PetriNetUnfolderBase]: 1/133 cut-off events. [2024-10-14 19:41:29,537 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:41:29,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 133 events. 1/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 269 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2024-10-14 19:41:29,540 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 134 transitions, 272 flow [2024-10-14 19:41:29,546 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 133 transitions, 269 flow [2024-10-14 19:41:29,560 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:41:29,569 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;@3274206d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:41:29,570 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-10-14 19:41:29,573 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 19:41:29,573 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-10-14 19:41:29,573 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:41:29,573 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:29,574 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-14 19:41:29,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:29,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:29,580 INFO L85 PathProgramCache]: Analyzing trace with hash 643940, now seen corresponding path program 1 times [2024-10-14 19:41:29,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:29,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603657324] [2024-10-14 19:41:29,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:29,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:29,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:41:29,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:29,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603657324] [2024-10-14 19:41:29,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603657324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:29,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:29,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:41:29,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12544325] [2024-10-14 19:41:29,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:29,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:41:29,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:29,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:41:29,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:41:29,915 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2024-10-14 19:41:29,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:29,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:29,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2024-10-14 19:41:29,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:30,131 INFO L124 PetriNetUnfolderBase]: 64/329 cut-off events. [2024-10-14 19:41:30,131 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:41:30,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 329 events. 64/329 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1306 event pairs, 63 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 376. Up to 167 conditions per place. [2024-10-14 19:41:30,136 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2024-10-14 19:41:30,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 134 transitions, 353 flow [2024-10-14 19:41:30,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:41:30,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:41:30,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2024-10-14 19:41:30,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8059701492537313 [2024-10-14 19:41:30,155 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 269 flow. Second operand 3 states and 324 transitions. [2024-10-14 19:41:30,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 134 transitions, 353 flow [2024-10-14 19:41:30,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 134 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 19:41:30,164 INFO L231 Difference]: Finished difference. Result has 138 places, 134 transitions, 280 flow [2024-10-14 19:41:30,166 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=138, PETRI_TRANSITIONS=134} [2024-10-14 19:41:30,171 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 2 predicate places. [2024-10-14 19:41:30,172 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 134 transitions, 280 flow [2024-10-14 19:41:30,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:30,172 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:30,173 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-14 19:41:30,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 19:41:30,173 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:30,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:30,175 INFO L85 PathProgramCache]: Analyzing trace with hash 19958118, now seen corresponding path program 1 times [2024-10-14 19:41:30,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:30,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848342295] [2024-10-14 19:41:30,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:30,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:30,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:41:30,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:30,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848342295] [2024-10-14 19:41:30,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848342295] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 19:41:30,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698666427] [2024-10-14 19:41:30,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:30,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 19:41:30,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:41:30,285 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-10-14 19:41:30,287 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-10-14 19:41:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:30,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:41:30,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:41:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:41:30,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:41:30,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:41:30,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698666427] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:41:30,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 19:41:30,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-14 19:41:30,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931845154] [2024-10-14 19:41:30,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 19:41:30,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 19:41:30,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:30,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 19:41:30,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-14 19:41:30,445 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2024-10-14 19:41:30,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 134 transitions, 280 flow. Second operand has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 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-10-14 19:41:30,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:30,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2024-10-14 19:41:30,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:30,732 INFO L124 PetriNetUnfolderBase]: 64/332 cut-off events. [2024-10-14 19:41:30,732 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:41:30,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 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 1303 event pairs, 63 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 505. Up to 167 conditions per place. [2024-10-14 19:41:30,739 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2024-10-14 19:41:30,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 380 flow [2024-10-14 19:41:30,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:41:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:41:30,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2024-10-14 19:41:30,747 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7599502487562189 [2024-10-14 19:41:30,747 INFO L175 Difference]: Start difference. First operand has 138 places, 134 transitions, 280 flow. Second operand 6 states and 611 transitions. [2024-10-14 19:41:30,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 380 flow [2024-10-14 19:41:30,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 137 transitions, 376 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-14 19:41:30,751 INFO L231 Difference]: Finished difference. Result has 145 places, 137 transitions, 312 flow [2024-10-14 19:41:30,751 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=145, PETRI_TRANSITIONS=137} [2024-10-14 19:41:30,752 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 9 predicate places. [2024-10-14 19:41:30,754 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 137 transitions, 312 flow [2024-10-14 19:41:30,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 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-10-14 19:41:30,755 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:30,755 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2024-10-14 19:41:30,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 19:41:30,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 19:41:30,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:30,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:30,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1862812644, now seen corresponding path program 2 times [2024-10-14 19:41:30,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:30,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026053700] [2024-10-14 19:41:30,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:30,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 19:41:31,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:31,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026053700] [2024-10-14 19:41:31,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026053700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:31,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:31,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:41:31,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161488628] [2024-10-14 19:41:31,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:31,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:41:31,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:31,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:41:31,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:41:31,237 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 134 [2024-10-14 19:41:31,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 137 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:31,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:31,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 134 [2024-10-14 19:41:31,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:31,370 INFO L124 PetriNetUnfolderBase]: 64/320 cut-off events. [2024-10-14 19:41:31,371 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-14 19:41:31,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 320 events. 64/320 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1245 event pairs, 63 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 490. Up to 165 conditions per place. [2024-10-14 19:41:31,376 INFO L140 encePairwiseOnDemand]: 110/134 looper letters, 38 selfloop transitions, 12 changer transitions 0/125 dead transitions. [2024-10-14 19:41:31,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 125 transitions, 388 flow [2024-10-14 19:41:31,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:41:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:41:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2024-10-14 19:41:31,378 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7114427860696517 [2024-10-14 19:41:31,378 INFO L175 Difference]: Start difference. First operand has 145 places, 137 transitions, 312 flow. Second operand 3 states and 286 transitions. [2024-10-14 19:41:31,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 125 transitions, 388 flow [2024-10-14 19:41:31,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 125 transitions, 374 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-10-14 19:41:31,384 INFO L231 Difference]: Finished difference. Result has 134 places, 125 transitions, 298 flow [2024-10-14 19:41:31,385 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=134, PETRI_TRANSITIONS=125} [2024-10-14 19:41:31,386 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2024-10-14 19:41:31,386 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 125 transitions, 298 flow [2024-10-14 19:41:31,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:31,387 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:31,387 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2024-10-14 19:41:31,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 19:41:31,388 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:31,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:31,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1862812645, now seen corresponding path program 1 times [2024-10-14 19:41:31,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:31,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975133539] [2024-10-14 19:41:31,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:31,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:31,514 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:41:31,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:31,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975133539] [2024-10-14 19:41:31,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975133539] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 19:41:31,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531472331] [2024-10-14 19:41:31,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:31,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 19:41:31,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:41:31,518 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-10-14 19:41:31,520 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-10-14 19:41:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:31,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:41:31,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:41:31,622 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:41:31,623 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:41:31,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:41:31,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531472331] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:41:31,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 19:41:31,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-14 19:41:31,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502152607] [2024-10-14 19:41:31,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 19:41:31,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 19:41:31,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:31,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 19:41:31,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-14 19:41:31,688 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2024-10-14 19:41:31,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 125 transitions, 298 flow. Second operand has 13 states, 13 states have (on average 95.07692307692308) internal successors, (1236), 13 states have internal predecessors, (1236), 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-10-14 19:41:31,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:31,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2024-10-14 19:41:31,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:31,852 INFO L124 PetriNetUnfolderBase]: 64/326 cut-off events. [2024-10-14 19:41:31,852 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-10-14 19:41:31,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 326 events. 64/326 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1242 event pairs, 63 based on Foata normal form. 6/254 useless extension candidates. Maximal degree in co-relation 496. Up to 167 conditions per place. [2024-10-14 19:41:31,855 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 11 changer transitions 0/131 dead transitions. [2024-10-14 19:41:31,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 131 transitions, 434 flow [2024-10-14 19:41:31,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 19:41:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-14 19:41:31,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1184 transitions. [2024-10-14 19:41:31,858 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2024-10-14 19:41:31,858 INFO L175 Difference]: Start difference. First operand has 134 places, 125 transitions, 298 flow. Second operand 12 states and 1184 transitions. [2024-10-14 19:41:31,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 131 transitions, 434 flow [2024-10-14 19:41:31,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 131 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:41:31,862 INFO L231 Difference]: Finished difference. Result has 149 places, 131 transitions, 358 flow [2024-10-14 19:41:31,862 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=358, PETRI_PLACES=149, PETRI_TRANSITIONS=131} [2024-10-14 19:41:31,863 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 13 predicate places. [2024-10-14 19:41:31,863 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 131 transitions, 358 flow [2024-10-14 19:41:31,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 95.07692307692308) internal successors, (1236), 13 states have internal predecessors, (1236), 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-10-14 19:41:31,865 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:31,865 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2024-10-14 19:41:31,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 19:41:32,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-14 19:41:32,069 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:32,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:32,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1282607963, now seen corresponding path program 2 times [2024-10-14 19:41:32,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:32,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127948480] [2024-10-14 19:41:32,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:32,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:32,177 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:32,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:32,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127948480] [2024-10-14 19:41:32,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127948480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:32,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:32,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:41:32,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180051157] [2024-10-14 19:41:32,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:32,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:41:32,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:32,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:41:32,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:41:32,306 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 134 [2024-10-14 19:41:32,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 131 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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-10-14 19:41:32,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:32,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 134 [2024-10-14 19:41:32,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:32,443 INFO L124 PetriNetUnfolderBase]: 64/314 cut-off events. [2024-10-14 19:41:32,443 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-10-14 19:41:32,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 314 events. 64/314 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1211 event pairs, 63 based on Foata normal form. 6/248 useless extension candidates. Maximal degree in co-relation 478. Up to 171 conditions per place. [2024-10-14 19:41:32,446 INFO L140 encePairwiseOnDemand]: 110/134 looper letters, 38 selfloop transitions, 12 changer transitions 0/119 dead transitions. [2024-10-14 19:41:32,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 119 transitions, 434 flow [2024-10-14 19:41:32,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:41:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:41:32,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2024-10-14 19:41:32,448 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2024-10-14 19:41:32,448 INFO L175 Difference]: Start difference. First operand has 149 places, 131 transitions, 358 flow. Second operand 3 states and 298 transitions. [2024-10-14 19:41:32,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 119 transitions, 434 flow [2024-10-14 19:41:32,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 119 transitions, 386 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-10-14 19:41:32,453 INFO L231 Difference]: Finished difference. Result has 134 places, 119 transitions, 310 flow [2024-10-14 19:41:32,453 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=134, PETRI_TRANSITIONS=119} [2024-10-14 19:41:32,456 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2024-10-14 19:41:32,457 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 119 transitions, 310 flow [2024-10-14 19:41:32,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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-10-14 19:41:32,457 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:32,457 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2024-10-14 19:41:32,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 19:41:32,458 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:32,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:32,458 INFO L85 PathProgramCache]: Analyzing trace with hash 69381473, now seen corresponding path program 1 times [2024-10-14 19:41:32,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:32,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176876041] [2024-10-14 19:41:32,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:32,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:32,649 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:32,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:32,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176876041] [2024-10-14 19:41:32,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176876041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:32,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:32,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:41:32,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381345782] [2024-10-14 19:41:32,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:32,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:41:32,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:32,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:41:32,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:41:32,952 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 134 [2024-10-14 19:41:32,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 119 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 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-10-14 19:41:32,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:32,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 134 [2024-10-14 19:41:32,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:33,071 INFO L124 PetriNetUnfolderBase]: 73/332 cut-off events. [2024-10-14 19:41:33,071 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-10-14 19:41:33,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 332 events. 73/332 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1334 event pairs, 72 based on Foata normal form. 2/270 useless extension candidates. Maximal degree in co-relation 533. Up to 201 conditions per place. [2024-10-14 19:41:33,073 INFO L140 encePairwiseOnDemand]: 125/134 looper letters, 56 selfloop transitions, 1 changer transitions 0/111 dead transitions. [2024-10-14 19:41:33,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 111 transitions, 408 flow [2024-10-14 19:41:33,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:41:33,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:41:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2024-10-14 19:41:33,075 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2024-10-14 19:41:33,075 INFO L175 Difference]: Start difference. First operand has 134 places, 119 transitions, 310 flow. Second operand 3 states and 292 transitions. [2024-10-14 19:41:33,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 111 transitions, 408 flow [2024-10-14 19:41:33,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 111 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:41:33,080 INFO L231 Difference]: Finished difference. Result has 126 places, 111 transitions, 272 flow [2024-10-14 19:41:33,080 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=126, PETRI_TRANSITIONS=111} [2024-10-14 19:41:33,081 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -10 predicate places. [2024-10-14 19:41:33,082 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 111 transitions, 272 flow [2024-10-14 19:41:33,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 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-10-14 19:41:33,083 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:33,083 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2024-10-14 19:41:33,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 19:41:33,083 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:33,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:33,084 INFO L85 PathProgramCache]: Analyzing trace with hash 69381474, now seen corresponding path program 1 times [2024-10-14 19:41:33,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:33,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203603066] [2024-10-14 19:41:33,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:33,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:33,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:33,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203603066] [2024-10-14 19:41:33,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203603066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:33,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:33,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:41:33,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154816973] [2024-10-14 19:41:33,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:33,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:41:33,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:33,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:41:33,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:41:33,672 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 134 [2024-10-14 19:41:33,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 111 transitions, 272 flow. Second operand has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 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-10-14 19:41:33,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:33,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 134 [2024-10-14 19:41:33,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:33,860 INFO L124 PetriNetUnfolderBase]: 73/327 cut-off events. [2024-10-14 19:41:33,861 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-10-14 19:41:33,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 327 events. 73/327 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1319 event pairs, 63 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 544. Up to 158 conditions per place. [2024-10-14 19:41:33,863 INFO L140 encePairwiseOnDemand]: 116/134 looper letters, 43 selfloop transitions, 14 changer transitions 3/116 dead transitions. [2024-10-14 19:41:33,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 116 transitions, 402 flow [2024-10-14 19:41:33,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:41:33,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:41:33,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 459 transitions. [2024-10-14 19:41:33,865 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6850746268656717 [2024-10-14 19:41:33,865 INFO L175 Difference]: Start difference. First operand has 126 places, 111 transitions, 272 flow. Second operand 5 states and 459 transitions. [2024-10-14 19:41:33,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 116 transitions, 402 flow [2024-10-14 19:41:33,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 116 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 19:41:33,868 INFO L231 Difference]: Finished difference. Result has 125 places, 107 transitions, 291 flow [2024-10-14 19:41:33,868 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=125, PETRI_TRANSITIONS=107} [2024-10-14 19:41:33,869 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -11 predicate places. [2024-10-14 19:41:33,869 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 107 transitions, 291 flow [2024-10-14 19:41:33,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 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-10-14 19:41:33,870 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:33,870 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:41:33,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 19:41:33,870 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:33,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:33,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1348957676, now seen corresponding path program 1 times [2024-10-14 19:41:33,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:33,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985467280] [2024-10-14 19:41:33,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:33,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:34,199 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:34,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:34,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985467280] [2024-10-14 19:41:34,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985467280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:34,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:34,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:41:34,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105223241] [2024-10-14 19:41:34,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:34,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 19:41:34,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:34,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 19:41:34,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 19:41:34,676 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 134 [2024-10-14 19:41:34,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 107 transitions, 291 flow. Second operand has 7 states, 7 states have (on average 65.42857142857143) internal successors, (458), 7 states have internal predecessors, (458), 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-10-14 19:41:34,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:34,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 134 [2024-10-14 19:41:34,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:34,911 INFO L124 PetriNetUnfolderBase]: 64/292 cut-off events. [2024-10-14 19:41:34,911 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-10-14 19:41:34,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 292 events. 64/292 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1115 event pairs, 63 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 525. Up to 166 conditions per place. [2024-10-14 19:41:34,913 INFO L140 encePairwiseOnDemand]: 112/134 looper letters, 46 selfloop transitions, 17 changer transitions 0/102 dead transitions. [2024-10-14 19:41:34,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 102 transitions, 407 flow [2024-10-14 19:41:34,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 19:41:34,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-14 19:41:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 570 transitions. [2024-10-14 19:41:34,915 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5317164179104478 [2024-10-14 19:41:34,915 INFO L175 Difference]: Start difference. First operand has 125 places, 107 transitions, 291 flow. Second operand 8 states and 570 transitions. [2024-10-14 19:41:34,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 102 transitions, 407 flow [2024-10-14 19:41:34,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 102 transitions, 379 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-14 19:41:34,918 INFO L231 Difference]: Finished difference. Result has 123 places, 102 transitions, 287 flow [2024-10-14 19:41:34,918 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=287, PETRI_PLACES=123, PETRI_TRANSITIONS=102} [2024-10-14 19:41:34,919 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -13 predicate places. [2024-10-14 19:41:34,920 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 102 transitions, 287 flow [2024-10-14 19:41:34,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 65.42857142857143) internal successors, (458), 7 states have internal predecessors, (458), 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-10-14 19:41:34,920 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:34,920 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:41:34,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 19:41:34,920 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:34,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:34,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1348957675, now seen corresponding path program 1 times [2024-10-14 19:41:34,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:34,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324355736] [2024-10-14 19:41:34,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:34,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:35,282 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:35,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:35,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324355736] [2024-10-14 19:41:35,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324355736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:35,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:35,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:41:35,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931504793] [2024-10-14 19:41:35,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:35,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 19:41:35,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:35,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 19:41:35,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 19:41:35,902 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 134 [2024-10-14 19:41:35,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 102 transitions, 287 flow. Second operand has 7 states, 7 states have (on average 57.42857142857143) internal successors, (402), 7 states have internal predecessors, (402), 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-10-14 19:41:35,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:35,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 134 [2024-10-14 19:41:35,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:36,157 INFO L124 PetriNetUnfolderBase]: 64/290 cut-off events. [2024-10-14 19:41:36,157 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-10-14 19:41:36,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 290 events. 64/290 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1130 event pairs, 63 based on Foata normal form. 1/245 useless extension candidates. Maximal degree in co-relation 517. Up to 172 conditions per place. [2024-10-14 19:41:36,159 INFO L140 encePairwiseOnDemand]: 119/134 looper letters, 49 selfloop transitions, 13 changer transitions 0/100 dead transitions. [2024-10-14 19:41:36,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 100 transitions, 407 flow [2024-10-14 19:41:36,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 19:41:36,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-14 19:41:36,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 446 transitions. [2024-10-14 19:41:36,161 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47547974413646055 [2024-10-14 19:41:36,161 INFO L175 Difference]: Start difference. First operand has 123 places, 102 transitions, 287 flow. Second operand 7 states and 446 transitions. [2024-10-14 19:41:36,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 100 transitions, 407 flow [2024-10-14 19:41:36,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 100 transitions, 373 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-14 19:41:36,164 INFO L231 Difference]: Finished difference. Result has 120 places, 100 transitions, 275 flow [2024-10-14 19:41:36,165 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=249, 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=7, PETRI_FLOW=275, PETRI_PLACES=120, PETRI_TRANSITIONS=100} [2024-10-14 19:41:36,165 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -16 predicate places. [2024-10-14 19:41:36,165 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 100 transitions, 275 flow [2024-10-14 19:41:36,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 57.42857142857143) internal successors, (402), 7 states have internal predecessors, (402), 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-10-14 19:41:36,166 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:36,166 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:41:36,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 19:41:36,166 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:36,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:36,167 INFO L85 PathProgramCache]: Analyzing trace with hash 731818980, now seen corresponding path program 1 times [2024-10-14 19:41:36,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:36,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346416743] [2024-10-14 19:41:36,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:36,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:36,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:36,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346416743] [2024-10-14 19:41:36,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346416743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:36,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:36,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:41:36,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017436992] [2024-10-14 19:41:36,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:36,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:41:36,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:36,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:41:36,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:41:36,637 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 134 [2024-10-14 19:41:36,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 100 transitions, 275 flow. Second operand has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 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-10-14 19:41:36,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:36,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 134 [2024-10-14 19:41:36,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:36,813 INFO L124 PetriNetUnfolderBase]: 64/289 cut-off events. [2024-10-14 19:41:36,813 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-10-14 19:41:36,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 289 events. 64/289 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1117 event pairs, 63 based on Foata normal form. 1/241 useless extension candidates. Maximal degree in co-relation 503. Up to 171 conditions per place. [2024-10-14 19:41:36,815 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 40 selfloop transitions, 13 changer transitions 0/99 dead transitions. [2024-10-14 19:41:36,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 99 transitions, 379 flow [2024-10-14 19:41:36,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:41:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:41:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2024-10-14 19:41:36,817 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6477611940298508 [2024-10-14 19:41:36,817 INFO L175 Difference]: Start difference. First operand has 120 places, 100 transitions, 275 flow. Second operand 5 states and 434 transitions. [2024-10-14 19:41:36,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 99 transitions, 379 flow [2024-10-14 19:41:36,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 99 transitions, 353 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-14 19:41:36,819 INFO L231 Difference]: Finished difference. Result has 117 places, 99 transitions, 273 flow [2024-10-14 19:41:36,819 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=273, PETRI_PLACES=117, PETRI_TRANSITIONS=99} [2024-10-14 19:41:36,820 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -19 predicate places. [2024-10-14 19:41:36,820 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 99 transitions, 273 flow [2024-10-14 19:41:36,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 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-10-14 19:41:36,821 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:36,821 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:41:36,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 19:41:36,821 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:36,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:36,822 INFO L85 PathProgramCache]: Analyzing trace with hash 731818979, now seen corresponding path program 1 times [2024-10-14 19:41:36,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:36,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362435029] [2024-10-14 19:41:36,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:36,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:36,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:36,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362435029] [2024-10-14 19:41:36,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362435029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:36,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:36,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:41:36,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670654403] [2024-10-14 19:41:36,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:36,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:41:36,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:36,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:41:36,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:41:37,157 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 134 [2024-10-14 19:41:37,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 99 transitions, 273 flow. Second operand has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 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-10-14 19:41:37,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:37,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 134 [2024-10-14 19:41:37,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:37,321 INFO L124 PetriNetUnfolderBase]: 64/288 cut-off events. [2024-10-14 19:41:37,322 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-10-14 19:41:37,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 288 events. 64/288 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1119 event pairs, 63 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 508. Up to 171 conditions per place. [2024-10-14 19:41:37,324 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 46 selfloop transitions, 13 changer transitions 0/98 dead transitions. [2024-10-14 19:41:37,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 98 transitions, 389 flow [2024-10-14 19:41:37,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:41:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:41:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 410 transitions. [2024-10-14 19:41:37,325 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6119402985074627 [2024-10-14 19:41:37,325 INFO L175 Difference]: Start difference. First operand has 117 places, 99 transitions, 273 flow. Second operand 5 states and 410 transitions. [2024-10-14 19:41:37,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 98 transitions, 389 flow [2024-10-14 19:41:37,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 98 transitions, 363 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-14 19:41:37,328 INFO L231 Difference]: Finished difference. Result has 116 places, 98 transitions, 271 flow [2024-10-14 19:41:37,328 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=116, PETRI_TRANSITIONS=98} [2024-10-14 19:41:37,329 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -20 predicate places. [2024-10-14 19:41:37,329 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 98 transitions, 271 flow [2024-10-14 19:41:37,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 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-10-14 19:41:37,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:37,329 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:41:37,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 19:41:37,330 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:37,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:37,330 INFO L85 PathProgramCache]: Analyzing trace with hash 365922887, now seen corresponding path program 1 times [2024-10-14 19:41:37,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:37,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431891043] [2024-10-14 19:41:37,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:37,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:37,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:37,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431891043] [2024-10-14 19:41:37,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431891043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:37,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:37,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:41:37,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634408946] [2024-10-14 19:41:37,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:37,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:41:37,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:37,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:41:37,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:41:38,130 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 134 [2024-10-14 19:41:38,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 98 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 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-10-14 19:41:38,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:38,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 134 [2024-10-14 19:41:38,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:38,276 INFO L124 PetriNetUnfolderBase]: 73/315 cut-off events. [2024-10-14 19:41:38,276 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-10-14 19:41:38,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 315 events. 73/315 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1305 event pairs, 63 based on Foata normal form. 1/259 useless extension candidates. Maximal degree in co-relation 545. Up to 164 conditions per place. [2024-10-14 19:41:38,279 INFO L140 encePairwiseOnDemand]: 128/134 looper letters, 54 selfloop transitions, 3 changer transitions 3/104 dead transitions. [2024-10-14 19:41:38,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 104 transitions, 403 flow [2024-10-14 19:41:38,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:41:38,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:41:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 381 transitions. [2024-10-14 19:41:38,281 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.710820895522388 [2024-10-14 19:41:38,281 INFO L175 Difference]: Start difference. First operand has 116 places, 98 transitions, 271 flow. Second operand 4 states and 381 transitions. [2024-10-14 19:41:38,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 104 transitions, 403 flow [2024-10-14 19:41:38,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 104 transitions, 377 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-14 19:41:38,284 INFO L231 Difference]: Finished difference. Result has 112 places, 95 transitions, 245 flow [2024-10-14 19:41:38,284 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=245, PETRI_PLACES=112, PETRI_TRANSITIONS=95} [2024-10-14 19:41:38,286 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -24 predicate places. [2024-10-14 19:41:38,286 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 95 transitions, 245 flow [2024-10-14 19:41:38,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 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-10-14 19:41:38,286 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:38,286 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:41:38,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 19:41:38,287 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:38,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:38,287 INFO L85 PathProgramCache]: Analyzing trace with hash 874402569, now seen corresponding path program 1 times [2024-10-14 19:41:38,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:38,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696051785] [2024-10-14 19:41:38,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:38,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:38,816 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:38,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:38,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696051785] [2024-10-14 19:41:38,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696051785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:38,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:38,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:41:38,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718702896] [2024-10-14 19:41:38,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:38,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 19:41:38,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:38,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 19:41:38,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 19:41:39,457 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 134 [2024-10-14 19:41:39,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 95 transitions, 245 flow. Second operand has 7 states, 7 states have (on average 58.57142857142857) internal successors, (410), 7 states have internal predecessors, (410), 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-10-14 19:41:39,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:39,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 134 [2024-10-14 19:41:39,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:39,665 INFO L124 PetriNetUnfolderBase]: 64/281 cut-off events. [2024-10-14 19:41:39,665 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-10-14 19:41:39,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 281 events. 64/281 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1105 event pairs, 54 based on Foata normal form. 2/237 useless extension candidates. Maximal degree in co-relation 498. Up to 132 conditions per place. [2024-10-14 19:41:39,667 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 48 selfloop transitions, 16 changer transitions 3/100 dead transitions. [2024-10-14 19:41:39,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 100 transitions, 389 flow [2024-10-14 19:41:39,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 19:41:39,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-14 19:41:39,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 453 transitions. [2024-10-14 19:41:39,669 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48294243070362475 [2024-10-14 19:41:39,670 INFO L175 Difference]: Start difference. First operand has 112 places, 95 transitions, 245 flow. Second operand 7 states and 453 transitions. [2024-10-14 19:41:39,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 100 transitions, 389 flow [2024-10-14 19:41:39,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 100 transitions, 383 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 19:41:39,672 INFO L231 Difference]: Finished difference. Result has 111 places, 91 transitions, 263 flow [2024-10-14 19:41:39,673 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=231, 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=263, PETRI_PLACES=111, PETRI_TRANSITIONS=91} [2024-10-14 19:41:39,674 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -25 predicate places. [2024-10-14 19:41:39,674 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 91 transitions, 263 flow [2024-10-14 19:41:39,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 58.57142857142857) internal successors, (410), 7 states have internal predecessors, (410), 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-10-14 19:41:39,674 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:39,674 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:41:39,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 19:41:39,675 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:39,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:39,675 INFO L85 PathProgramCache]: Analyzing trace with hash 874402568, now seen corresponding path program 1 times [2024-10-14 19:41:39,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:39,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904824847] [2024-10-14 19:41:39,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:39,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:39,984 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:39,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:39,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904824847] [2024-10-14 19:41:39,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904824847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:39,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:39,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:41:39,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567328845] [2024-10-14 19:41:39,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:39,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 19:41:39,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:39,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 19:41:39,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 19:41:40,449 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 134 [2024-10-14 19:41:40,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 91 transitions, 263 flow. Second operand has 7 states, 7 states have (on average 66.71428571428571) internal successors, (467), 7 states have internal predecessors, (467), 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-10-14 19:41:40,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:40,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 134 [2024-10-14 19:41:40,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:40,675 INFO L124 PetriNetUnfolderBase]: 64/279 cut-off events. [2024-10-14 19:41:40,675 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-10-14 19:41:40,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 279 events. 64/279 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1090 event pairs, 54 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 513. Up to 130 conditions per place. [2024-10-14 19:41:40,677 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 49 selfloop transitions, 18 changer transitions 3/98 dead transitions. [2024-10-14 19:41:40,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 98 transitions, 417 flow [2024-10-14 19:41:40,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 19:41:40,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-14 19:41:40,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 574 transitions. [2024-10-14 19:41:40,679 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5354477611940298 [2024-10-14 19:41:40,679 INFO L175 Difference]: Start difference. First operand has 111 places, 91 transitions, 263 flow. Second operand 8 states and 574 transitions. [2024-10-14 19:41:40,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 98 transitions, 417 flow [2024-10-14 19:41:40,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 98 transitions, 385 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-14 19:41:40,681 INFO L231 Difference]: Finished difference. Result has 110 places, 89 transitions, 263 flow [2024-10-14 19:41:40,681 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=263, PETRI_PLACES=110, PETRI_TRANSITIONS=89} [2024-10-14 19:41:40,682 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -26 predicate places. [2024-10-14 19:41:40,682 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 89 transitions, 263 flow [2024-10-14 19:41:40,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 66.71428571428571) internal successors, (467), 7 states have internal predecessors, (467), 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-10-14 19:41:40,682 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:40,683 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:41:40,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 19:41:40,683 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:40,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:40,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1512699294, now seen corresponding path program 1 times [2024-10-14 19:41:40,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:40,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546276578] [2024-10-14 19:41:40,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:40,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:40,834 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:40,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:40,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546276578] [2024-10-14 19:41:40,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546276578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:40,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:40,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:41:40,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487249955] [2024-10-14 19:41:40,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:40,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:41:40,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:40,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:41:40,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:41:41,028 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 134 [2024-10-14 19:41:41,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 89 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 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-10-14 19:41:41,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:41,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 134 [2024-10-14 19:41:41,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:41,159 INFO L124 PetriNetUnfolderBase]: 64/278 cut-off events. [2024-10-14 19:41:41,160 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-10-14 19:41:41,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 278 events. 64/278 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1098 event pairs, 63 based on Foata normal form. 1/235 useless extension candidates. Maximal degree in co-relation 511. Up to 170 conditions per place. [2024-10-14 19:41:41,162 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 45 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2024-10-14 19:41:41,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 88 transitions, 377 flow [2024-10-14 19:41:41,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:41:41,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:41:41,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 409 transitions. [2024-10-14 19:41:41,163 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6104477611940299 [2024-10-14 19:41:41,163 INFO L175 Difference]: Start difference. First operand has 110 places, 89 transitions, 263 flow. Second operand 5 states and 409 transitions. [2024-10-14 19:41:41,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 88 transitions, 377 flow [2024-10-14 19:41:41,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 88 transitions, 341 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-14 19:41:41,166 INFO L231 Difference]: Finished difference. Result has 106 places, 88 transitions, 251 flow [2024-10-14 19:41:41,166 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=106, PETRI_TRANSITIONS=88} [2024-10-14 19:41:41,167 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -30 predicate places. [2024-10-14 19:41:41,168 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 88 transitions, 251 flow [2024-10-14 19:41:41,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 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-10-14 19:41:41,168 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:41,168 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:41:41,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 19:41:41,169 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:41,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:41,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1512699293, now seen corresponding path program 1 times [2024-10-14 19:41:41,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:41,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583047915] [2024-10-14 19:41:41,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:41,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:41,414 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:41,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:41,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583047915] [2024-10-14 19:41:41,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583047915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:41,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:41,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:41:41,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813565068] [2024-10-14 19:41:41,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:41,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:41:41,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:41,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:41:41,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:41:41,621 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 134 [2024-10-14 19:41:41,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 88 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 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-10-14 19:41:41,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:41,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 134 [2024-10-14 19:41:41,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:41,770 INFO L124 PetriNetUnfolderBase]: 64/277 cut-off events. [2024-10-14 19:41:41,771 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-10-14 19:41:41,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 277 events. 64/277 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1090 event pairs, 63 based on Foata normal form. 1/233 useless extension candidates. Maximal degree in co-relation 490. Up to 170 conditions per place. [2024-10-14 19:41:41,772 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 39 selfloop transitions, 13 changer transitions 0/87 dead transitions. [2024-10-14 19:41:41,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 87 transitions, 353 flow [2024-10-14 19:41:41,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:41:41,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:41:41,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2024-10-14 19:41:41,774 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6462686567164179 [2024-10-14 19:41:41,774 INFO L175 Difference]: Start difference. First operand has 106 places, 88 transitions, 251 flow. Second operand 5 states and 433 transitions. [2024-10-14 19:41:41,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 87 transitions, 353 flow [2024-10-14 19:41:41,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 87 transitions, 327 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-14 19:41:41,777 INFO L231 Difference]: Finished difference. Result has 105 places, 87 transitions, 249 flow [2024-10-14 19:41:41,777 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=105, PETRI_TRANSITIONS=87} [2024-10-14 19:41:41,777 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -31 predicate places. [2024-10-14 19:41:41,778 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 87 transitions, 249 flow [2024-10-14 19:41:41,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 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-10-14 19:41:41,778 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:41,778 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-10-14 19:41:41,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 19:41:41,779 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:41,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:41,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1583846751, now seen corresponding path program 1 times [2024-10-14 19:41:41,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:41,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282142842] [2024-10-14 19:41:41,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:41,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:43,678 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:43,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:43,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282142842] [2024-10-14 19:41:43,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282142842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:43,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:43,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-14 19:41:43,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102947493] [2024-10-14 19:41:43,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:43,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 19:41:43,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:43,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 19:41:43,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-10-14 19:41:46,187 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 134 [2024-10-14 19:41:46,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 87 transitions, 249 flow. Second operand has 17 states, 17 states have (on average 45.470588235294116) internal successors, (773), 17 states have internal predecessors, (773), 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-10-14 19:41:46,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:46,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 134 [2024-10-14 19:41:46,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:46,906 INFO L124 PetriNetUnfolderBase]: 64/275 cut-off events. [2024-10-14 19:41:46,906 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-10-14 19:41:46,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 275 events. 64/275 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1088 event pairs, 54 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 497. Up to 126 conditions per place. [2024-10-14 19:41:46,908 INFO L140 encePairwiseOnDemand]: 113/134 looper letters, 48 selfloop transitions, 19 changer transitions 3/94 dead transitions. [2024-10-14 19:41:46,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 94 transitions, 403 flow [2024-10-14 19:41:46,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 19:41:46,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-14 19:41:46,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 766 transitions. [2024-10-14 19:41:46,913 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3572761194029851 [2024-10-14 19:41:46,913 INFO L175 Difference]: Start difference. First operand has 105 places, 87 transitions, 249 flow. Second operand 16 states and 766 transitions. [2024-10-14 19:41:46,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 94 transitions, 403 flow [2024-10-14 19:41:46,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 94 transitions, 377 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-14 19:41:46,916 INFO L231 Difference]: Finished difference. Result has 114 places, 85 transitions, 257 flow [2024-10-14 19:41:46,916 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=257, PETRI_PLACES=114, PETRI_TRANSITIONS=85} [2024-10-14 19:41:46,917 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -22 predicate places. [2024-10-14 19:41:46,917 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 85 transitions, 257 flow [2024-10-14 19:41:46,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 45.470588235294116) internal successors, (773), 17 states have internal predecessors, (773), 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-10-14 19:41:46,918 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:46,918 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-10-14 19:41:46,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 19:41:46,918 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:46,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:46,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1583846750, now seen corresponding path program 1 times [2024-10-14 19:41:46,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:46,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538291421] [2024-10-14 19:41:46,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:46,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:47,590 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:47,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:47,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538291421] [2024-10-14 19:41:47,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538291421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:47,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:47,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 19:41:47,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476412187] [2024-10-14 19:41:47,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:47,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 19:41:47,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:47,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 19:41:47,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-14 19:41:48,500 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 134 [2024-10-14 19:41:48,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 85 transitions, 257 flow. Second operand has 10 states, 10 states have (on average 78.5) internal successors, (785), 10 states have internal predecessors, (785), 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-10-14 19:41:48,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:48,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 134 [2024-10-14 19:41:48,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:48,703 INFO L124 PetriNetUnfolderBase]: 64/274 cut-off events. [2024-10-14 19:41:48,704 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-10-14 19:41:48,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 274 events. 64/274 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1089 event pairs, 54 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 509. Up to 135 conditions per place. [2024-10-14 19:41:48,706 INFO L140 encePairwiseOnDemand]: 121/134 looper letters, 54 selfloop transitions, 12 changer transitions 3/93 dead transitions. [2024-10-14 19:41:48,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 93 transitions, 409 flow [2024-10-14 19:41:48,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 19:41:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-14 19:41:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 668 transitions. [2024-10-14 19:41:48,708 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6231343283582089 [2024-10-14 19:41:48,708 INFO L175 Difference]: Start difference. First operand has 114 places, 85 transitions, 257 flow. Second operand 8 states and 668 transitions. [2024-10-14 19:41:48,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 93 transitions, 409 flow [2024-10-14 19:41:48,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 93 transitions, 373 flow, removed 0 selfloop flow, removed 14 redundant places. [2024-10-14 19:41:48,710 INFO L231 Difference]: Finished difference. Result has 105 places, 84 transitions, 241 flow [2024-10-14 19:41:48,710 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=241, PETRI_PLACES=105, PETRI_TRANSITIONS=84} [2024-10-14 19:41:48,710 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -31 predicate places. [2024-10-14 19:41:48,710 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 84 transitions, 241 flow [2024-10-14 19:41:48,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 78.5) internal successors, (785), 10 states have internal predecessors, (785), 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-10-14 19:41:48,711 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:48,711 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-10-14 19:41:48,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 19:41:48,711 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:48,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:48,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1658328098, now seen corresponding path program 1 times [2024-10-14 19:41:48,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:48,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505148173] [2024-10-14 19:41:48,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:48,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:48,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:48,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505148173] [2024-10-14 19:41:48,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505148173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:48,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:48,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:41:48,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892527174] [2024-10-14 19:41:48,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:48,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:41:48,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:48,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:41:48,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:41:48,997 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 134 [2024-10-14 19:41:48,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 84 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 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-10-14 19:41:48,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:48,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 134 [2024-10-14 19:41:48,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:49,124 INFO L124 PetriNetUnfolderBase]: 73/290 cut-off events. [2024-10-14 19:41:49,124 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-10-14 19:41:49,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 290 events. 73/290 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1173 event pairs, 45 based on Foata normal form. 2/246 useless extension candidates. Maximal degree in co-relation 534. Up to 108 conditions per place. [2024-10-14 19:41:49,126 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 48 selfloop transitions, 18 changer transitions 0/91 dead transitions. [2024-10-14 19:41:49,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 91 transitions, 387 flow [2024-10-14 19:41:49,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:41:49,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:41:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 484 transitions. [2024-10-14 19:41:49,128 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6019900497512438 [2024-10-14 19:41:49,128 INFO L175 Difference]: Start difference. First operand has 105 places, 84 transitions, 241 flow. Second operand 6 states and 484 transitions. [2024-10-14 19:41:49,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 91 transitions, 387 flow [2024-10-14 19:41:49,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 91 transitions, 363 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-14 19:41:49,130 INFO L231 Difference]: Finished difference. Result has 101 places, 82 transitions, 249 flow [2024-10-14 19:41:49,130 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=213, 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=249, PETRI_PLACES=101, PETRI_TRANSITIONS=82} [2024-10-14 19:41:49,131 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -35 predicate places. [2024-10-14 19:41:49,131 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 82 transitions, 249 flow [2024-10-14 19:41:49,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 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-10-14 19:41:49,132 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:49,132 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-10-14 19:41:49,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 19:41:49,132 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:49,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:49,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1658328099, now seen corresponding path program 1 times [2024-10-14 19:41:49,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:49,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055667937] [2024-10-14 19:41:49,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:49,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:49,427 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:49,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:49,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055667937] [2024-10-14 19:41:49,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055667937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:49,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:49,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:41:49,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642453007] [2024-10-14 19:41:49,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:49,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:41:49,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:49,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:41:49,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:41:49,626 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 134 [2024-10-14 19:41:49,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 82 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 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-10-14 19:41:49,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:49,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 134 [2024-10-14 19:41:49,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:49,754 INFO L124 PetriNetUnfolderBase]: 73/272 cut-off events. [2024-10-14 19:41:49,754 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-10-14 19:41:49,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 272 events. 73/272 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1064 event pairs, 18 based on Foata normal form. 2/249 useless extension candidates. Maximal degree in co-relation 534. Up to 135 conditions per place. [2024-10-14 19:41:49,756 INFO L140 encePairwiseOnDemand]: 116/134 looper letters, 44 selfloop transitions, 16 changer transitions 0/89 dead transitions. [2024-10-14 19:41:49,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 89 transitions, 383 flow [2024-10-14 19:41:49,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:41:49,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:41:49,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 514 transitions. [2024-10-14 19:41:49,757 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6393034825870647 [2024-10-14 19:41:49,757 INFO L175 Difference]: Start difference. First operand has 101 places, 82 transitions, 249 flow. Second operand 6 states and 514 transitions. [2024-10-14 19:41:49,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 89 transitions, 383 flow [2024-10-14 19:41:49,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 89 transitions, 347 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 19:41:49,760 INFO L231 Difference]: Finished difference. Result has 99 places, 80 transitions, 241 flow [2024-10-14 19:41:49,760 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=99, PETRI_TRANSITIONS=80} [2024-10-14 19:41:49,760 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -37 predicate places. [2024-10-14 19:41:49,760 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 80 transitions, 241 flow [2024-10-14 19:41:49,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 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-10-14 19:41:49,761 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:49,761 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-10-14 19:41:49,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 19:41:49,761 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:49,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:49,761 INFO L85 PathProgramCache]: Analyzing trace with hash 821866613, now seen corresponding path program 1 times [2024-10-14 19:41:49,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:49,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063986648] [2024-10-14 19:41:49,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:49,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:49,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:49,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063986648] [2024-10-14 19:41:49,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063986648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:49,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:49,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:41:49,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922581329] [2024-10-14 19:41:49,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:49,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:41:49,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:49,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:41:49,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:41:50,064 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 134 [2024-10-14 19:41:50,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 80 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-10-14 19:41:50,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:50,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 134 [2024-10-14 19:41:50,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:50,182 INFO L124 PetriNetUnfolderBase]: 64/273 cut-off events. [2024-10-14 19:41:50,182 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-10-14 19:41:50,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 273 events. 64/273 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1100 event pairs, 56 based on Foata normal form. 8/244 useless extension candidates. Maximal degree in co-relation 496. Up to 162 conditions per place. [2024-10-14 19:41:50,183 INFO L140 encePairwiseOnDemand]: 130/134 looper letters, 55 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2024-10-14 19:41:50,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 85 transitions, 367 flow [2024-10-14 19:41:50,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:41:50,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:41:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2024-10-14 19:41:50,186 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8084577114427861 [2024-10-14 19:41:50,186 INFO L175 Difference]: Start difference. First operand has 99 places, 80 transitions, 241 flow. Second operand 3 states and 325 transitions. [2024-10-14 19:41:50,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 85 transitions, 367 flow [2024-10-14 19:41:50,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 85 transitions, 333 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 19:41:50,188 INFO L231 Difference]: Finished difference. Result has 94 places, 78 transitions, 209 flow [2024-10-14 19:41:50,188 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=205, 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=209, PETRI_PLACES=94, PETRI_TRANSITIONS=78} [2024-10-14 19:41:50,189 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -42 predicate places. [2024-10-14 19:41:50,189 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 78 transitions, 209 flow [2024-10-14 19:41:50,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-10-14 19:41:50,189 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:50,189 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-10-14 19:41:50,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 19:41:50,190 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:50,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:50,190 INFO L85 PathProgramCache]: Analyzing trace with hash 821866612, now seen corresponding path program 1 times [2024-10-14 19:41:50,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:50,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562619516] [2024-10-14 19:41:50,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:50,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:50,317 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:50,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:50,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562619516] [2024-10-14 19:41:50,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562619516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:50,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:50,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:41:50,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111656250] [2024-10-14 19:41:50,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:50,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:41:50,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:50,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:41:50,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:41:50,404 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 134 [2024-10-14 19:41:50,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 78 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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-10-14 19:41:50,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:50,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 134 [2024-10-14 19:41:50,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:50,487 INFO L124 PetriNetUnfolderBase]: 71/264 cut-off events. [2024-10-14 19:41:50,487 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-10-14 19:41:50,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 264 events. 71/264 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 986 event pairs, 56 based on Foata normal form. 8/243 useless extension candidates. Maximal degree in co-relation 493. Up to 162 conditions per place. [2024-10-14 19:41:50,488 INFO L140 encePairwiseOnDemand]: 130/134 looper letters, 56 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2024-10-14 19:41:50,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 83 transitions, 335 flow [2024-10-14 19:41:50,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:41:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:41:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2024-10-14 19:41:50,489 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8034825870646766 [2024-10-14 19:41:50,489 INFO L175 Difference]: Start difference. First operand has 94 places, 78 transitions, 209 flow. Second operand 3 states and 323 transitions. [2024-10-14 19:41:50,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 83 transitions, 335 flow [2024-10-14 19:41:50,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 83 transitions, 331 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:41:50,491 INFO L231 Difference]: Finished difference. Result has 92 places, 76 transitions, 205 flow [2024-10-14 19:41:50,491 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=92, PETRI_TRANSITIONS=76} [2024-10-14 19:41:50,492 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -44 predicate places. [2024-10-14 19:41:50,492 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 76 transitions, 205 flow [2024-10-14 19:41:50,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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-10-14 19:41:50,492 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:50,492 INFO L204 CegarLoopForPetriNet]: trace histogram [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-10-14 19:41:50,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 19:41:50,493 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:50,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:50,493 INFO L85 PathProgramCache]: Analyzing trace with hash -415085578, now seen corresponding path program 1 times [2024-10-14 19:41:50,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:50,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363426905] [2024-10-14 19:41:50,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:50,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:51,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:51,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363426905] [2024-10-14 19:41:51,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363426905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:51,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:51,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 19:41:51,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518865150] [2024-10-14 19:41:51,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:51,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 19:41:51,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:51,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 19:41:51,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-14 19:41:51,643 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 134 [2024-10-14 19:41:51,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 76 transitions, 205 flow. Second operand has 8 states, 8 states have (on average 76.0) internal successors, (608), 8 states have internal predecessors, (608), 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-10-14 19:41:51,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:51,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 134 [2024-10-14 19:41:51,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:51,832 INFO L124 PetriNetUnfolderBase]: 85/312 cut-off events. [2024-10-14 19:41:51,832 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-10-14 19:41:51,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 312 events. 85/312 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1291 event pairs, 60 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 579. Up to 157 conditions per place. [2024-10-14 19:41:51,834 INFO L140 encePairwiseOnDemand]: 118/134 looper letters, 57 selfloop transitions, 15 changer transitions 3/95 dead transitions. [2024-10-14 19:41:51,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 95 transitions, 401 flow [2024-10-14 19:41:51,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 19:41:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-14 19:41:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 642 transitions. [2024-10-14 19:41:51,835 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5988805970149254 [2024-10-14 19:41:51,835 INFO L175 Difference]: Start difference. First operand has 92 places, 76 transitions, 205 flow. Second operand 8 states and 642 transitions. [2024-10-14 19:41:51,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 95 transitions, 401 flow [2024-10-14 19:41:51,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 95 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:41:51,838 INFO L231 Difference]: Finished difference. Result has 98 places, 78 transitions, 244 flow [2024-10-14 19:41:51,838 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=244, PETRI_PLACES=98, PETRI_TRANSITIONS=78} [2024-10-14 19:41:51,838 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -38 predicate places. [2024-10-14 19:41:51,838 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 78 transitions, 244 flow [2024-10-14 19:41:51,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.0) internal successors, (608), 8 states have internal predecessors, (608), 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-10-14 19:41:51,839 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:51,839 INFO L204 CegarLoopForPetriNet]: trace histogram [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-10-14 19:41:51,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 19:41:51,839 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:51,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:51,840 INFO L85 PathProgramCache]: Analyzing trace with hash -415085579, now seen corresponding path program 1 times [2024-10-14 19:41:51,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:51,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748489305] [2024-10-14 19:41:51,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:51,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:52,074 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:52,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:52,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748489305] [2024-10-14 19:41:52,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748489305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:52,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:52,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:41:52,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689940444] [2024-10-14 19:41:52,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:52,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:41:52,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:52,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:41:52,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:41:52,367 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 134 [2024-10-14 19:41:52,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 78 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 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-10-14 19:41:52,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:52,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 134 [2024-10-14 19:41:52,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:52,518 INFO L124 PetriNetUnfolderBase]: 79/290 cut-off events. [2024-10-14 19:41:52,518 INFO L125 PetriNetUnfolderBase]: For 86/92 co-relation queries the response was YES. [2024-10-14 19:41:52,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 290 events. 79/290 cut-off events. For 86/92 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1128 event pairs, 54 based on Foata normal form. 17/276 useless extension candidates. Maximal degree in co-relation 593. Up to 139 conditions per place. [2024-10-14 19:41:52,520 INFO L140 encePairwiseOnDemand]: 123/134 looper letters, 60 selfloop transitions, 11 changer transitions 3/94 dead transitions. [2024-10-14 19:41:52,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 94 transitions, 426 flow [2024-10-14 19:41:52,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:41:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:41:52,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 544 transitions. [2024-10-14 19:41:52,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6766169154228856 [2024-10-14 19:41:52,521 INFO L175 Difference]: Start difference. First operand has 98 places, 78 transitions, 244 flow. Second operand 6 states and 544 transitions. [2024-10-14 19:41:52,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 94 transitions, 426 flow [2024-10-14 19:41:52,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 94 transitions, 399 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-14 19:41:52,523 INFO L231 Difference]: Finished difference. Result has 96 places, 77 transitions, 237 flow [2024-10-14 19:41:52,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=96, PETRI_TRANSITIONS=77} [2024-10-14 19:41:52,524 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -40 predicate places. [2024-10-14 19:41:52,524 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 77 transitions, 237 flow [2024-10-14 19:41:52,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 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-10-14 19:41:52,525 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:52,525 INFO L204 CegarLoopForPetriNet]: trace histogram [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-10-14 19:41:52,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 19:41:52,525 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:41:52,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:52,526 INFO L85 PathProgramCache]: Analyzing trace with hash 17249648, now seen corresponding path program 1 times [2024-10-14 19:41:52,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:52,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223192790] [2024-10-14 19:41:52,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:52,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:55,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:55,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223192790] [2024-10-14 19:41:55,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223192790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:55,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:55,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-10-14 19:41:55,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404642068] [2024-10-14 19:41:55,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:55,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-14 19:41:55,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:55,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-14 19:41:55,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2024-10-14 19:42:01,576 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 134 [2024-10-14 19:42:01,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 77 transitions, 237 flow. Second operand has 27 states, 27 states have (on average 57.44444444444444) internal successors, (1551), 27 states have internal predecessors, (1551), 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-10-14 19:42:01,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:42:01,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 134 [2024-10-14 19:42:01,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:42:03,030 INFO L124 PetriNetUnfolderBase]: 111/368 cut-off events. [2024-10-14 19:42:03,030 INFO L125 PetriNetUnfolderBase]: For 148/155 co-relation queries the response was YES. [2024-10-14 19:42:03,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 790 conditions, 368 events. 111/368 cut-off events. For 148/155 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1611 event pairs, 6 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 771. Up to 65 conditions per place. [2024-10-14 19:42:03,032 INFO L140 encePairwiseOnDemand]: 105/134 looper letters, 71 selfloop transitions, 34 changer transitions 3/119 dead transitions. [2024-10-14 19:42:03,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 119 transitions, 555 flow [2024-10-14 19:42:03,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-14 19:42:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-10-14 19:42:03,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1554 transitions. [2024-10-14 19:42:03,035 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4460390355912744 [2024-10-14 19:42:03,036 INFO L175 Difference]: Start difference. First operand has 96 places, 77 transitions, 237 flow. Second operand 26 states and 1554 transitions. [2024-10-14 19:42:03,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 119 transitions, 555 flow [2024-10-14 19:42:03,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 119 transitions, 525 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 19:42:03,041 INFO L231 Difference]: Finished difference. Result has 120 places, 85 transitions, 330 flow [2024-10-14 19:42:03,041 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=330, PETRI_PLACES=120, PETRI_TRANSITIONS=85} [2024-10-14 19:42:03,042 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -16 predicate places. [2024-10-14 19:42:03,042 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 85 transitions, 330 flow [2024-10-14 19:42:03,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 57.44444444444444) internal successors, (1551), 27 states have internal predecessors, (1551), 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-10-14 19:42:03,043 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:42:03,043 INFO L204 CegarLoopForPetriNet]: trace histogram [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-10-14 19:42:03,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 19:42:03,043 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:42:03,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:42:03,043 INFO L85 PathProgramCache]: Analyzing trace with hash 17249649, now seen corresponding path program 1 times [2024-10-14 19:42:03,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:42:03,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132757812] [2024-10-14 19:42:03,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:42:03,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:42:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:42:06,603 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:42:06,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:42:06,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132757812] [2024-10-14 19:42:06,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132757812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:42:06,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:42:06,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-10-14 19:42:06,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875815048] [2024-10-14 19:42:06,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:42:06,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-14 19:42:06,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:42:06,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-14 19:42:06,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2024-10-14 19:42:14,232 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 134 [2024-10-14 19:42:14,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 85 transitions, 330 flow. Second operand has 27 states, 27 states have (on average 40.44444444444444) internal successors, (1092), 27 states have internal predecessors, (1092), 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-10-14 19:42:14,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:42:14,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 134 [2024-10-14 19:42:14,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:42:15,470 INFO L124 PetriNetUnfolderBase]: 139/424 cut-off events. [2024-10-14 19:42:15,470 INFO L125 PetriNetUnfolderBase]: For 226/233 co-relation queries the response was YES. [2024-10-14 19:42:15,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 424 events. 139/424 cut-off events. For 226/233 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1915 event pairs, 6 based on Foata normal form. 12/408 useless extension candidates. Maximal degree in co-relation 996. Up to 98 conditions per place. [2024-10-14 19:42:15,473 INFO L140 encePairwiseOnDemand]: 107/134 looper letters, 76 selfloop transitions, 33 changer transitions 3/122 dead transitions. [2024-10-14 19:42:15,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 122 transitions, 637 flow [2024-10-14 19:42:15,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-14 19:42:15,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2024-10-14 19:42:15,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1233 transitions. [2024-10-14 19:42:15,477 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3172928461142563 [2024-10-14 19:42:15,478 INFO L175 Difference]: Start difference. First operand has 120 places, 85 transitions, 330 flow. Second operand 29 states and 1233 transitions. [2024-10-14 19:42:15,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 122 transitions, 637 flow [2024-10-14 19:42:15,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 122 transitions, 597 flow, removed 0 selfloop flow, removed 18 redundant places. [2024-10-14 19:42:15,481 INFO L231 Difference]: Finished difference. Result has 132 places, 86 transitions, 371 flow [2024-10-14 19:42:15,482 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=371, PETRI_PLACES=132, PETRI_TRANSITIONS=86} [2024-10-14 19:42:15,482 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -4 predicate places. [2024-10-14 19:42:15,482 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 86 transitions, 371 flow [2024-10-14 19:42:15,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 40.44444444444444) internal successors, (1092), 27 states have internal predecessors, (1092), 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-10-14 19:42:15,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:42:15,483 INFO L204 CegarLoopForPetriNet]: trace histogram [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-10-14 19:42:15,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 19:42:15,483 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:42:15,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:42:15,484 INFO L85 PathProgramCache]: Analyzing trace with hash -460145899, now seen corresponding path program 1 times [2024-10-14 19:42:15,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:42:15,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530299230] [2024-10-14 19:42:15,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:42:15,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:42:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:42:16,406 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:42:16,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:42:16,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530299230] [2024-10-14 19:42:16,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530299230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:42:16,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:42:16,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 19:42:16,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684714193] [2024-10-14 19:42:16,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:42:16,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 19:42:16,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:42:16,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 19:42:16,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-14 19:42:17,427 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 134 [2024-10-14 19:42:17,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 86 transitions, 371 flow. Second operand has 12 states, 12 states have (on average 62.75) internal successors, (753), 12 states have internal predecessors, (753), 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-10-14 19:42:17,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:42:17,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 134 [2024-10-14 19:42:17,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:42:17,620 INFO L124 PetriNetUnfolderBase]: 107/353 cut-off events. [2024-10-14 19:42:17,620 INFO L125 PetriNetUnfolderBase]: For 329/337 co-relation queries the response was YES. [2024-10-14 19:42:17,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 919 conditions, 353 events. 107/353 cut-off events. For 329/337 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1531 event pairs, 59 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 892. Up to 222 conditions per place. [2024-10-14 19:42:17,622 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 52 selfloop transitions, 19 changer transitions 0/93 dead transitions. [2024-10-14 19:42:17,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 93 transitions, 550 flow [2024-10-14 19:42:17,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:42:17,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:42:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 414 transitions. [2024-10-14 19:42:17,624 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5149253731343284 [2024-10-14 19:42:17,624 INFO L175 Difference]: Start difference. First operand has 132 places, 86 transitions, 371 flow. Second operand 6 states and 414 transitions. [2024-10-14 19:42:17,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 93 transitions, 550 flow [2024-10-14 19:42:17,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 93 transitions, 481 flow, removed 0 selfloop flow, removed 26 redundant places. [2024-10-14 19:42:17,627 INFO L231 Difference]: Finished difference. Result has 110 places, 85 transitions, 344 flow [2024-10-14 19:42:17,627 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=344, PETRI_PLACES=110, PETRI_TRANSITIONS=85} [2024-10-14 19:42:17,627 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -26 predicate places. [2024-10-14 19:42:17,628 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 85 transitions, 344 flow [2024-10-14 19:42:17,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 62.75) internal successors, (753), 12 states have internal predecessors, (753), 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-10-14 19:42:17,628 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:42:17,628 INFO L204 CegarLoopForPetriNet]: trace histogram [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-10-14 19:42:17,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 19:42:17,628 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-14 19:42:17,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:42:17,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1379620214, now seen corresponding path program 1 times [2024-10-14 19:42:17,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:42:17,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451774373] [2024-10-14 19:42:17,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:42:17,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:42:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:42:17,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 19:42:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:42:17,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 19:42:17,856 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 19:42:17,857 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 92 remaining) [2024-10-14 19:42:17,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 92 remaining) [2024-10-14 19:42:17,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 92 remaining) [2024-10-14 19:42:17,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 92 remaining) [2024-10-14 19:42:17,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 92 remaining) [2024-10-14 19:42:17,860 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 92 remaining) [2024-10-14 19:42:17,861 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 92 remaining) [2024-10-14 19:42:17,861 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 92 remaining) [2024-10-14 19:42:17,861 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 92 remaining) [2024-10-14 19:42:17,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 92 remaining) [2024-10-14 19:42:17,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 92 remaining) [2024-10-14 19:42:17,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 92 remaining) [2024-10-14 19:42:17,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 92 remaining) [2024-10-14 19:42:17,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 92 remaining) [2024-10-14 19:42:17,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 92 remaining) [2024-10-14 19:42:17,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 92 remaining) [2024-10-14 19:42:17,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 92 remaining) [2024-10-14 19:42:17,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 92 remaining) [2024-10-14 19:42:17,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 92 remaining) [2024-10-14 19:42:17,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 92 remaining) [2024-10-14 19:42:17,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 92 remaining) [2024-10-14 19:42:17,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 92 remaining) [2024-10-14 19:42:17,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 92 remaining) [2024-10-14 19:42:17,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 92 remaining) [2024-10-14 19:42:17,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 92 remaining) [2024-10-14 19:42:17,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 92 remaining) [2024-10-14 19:42:17,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 92 remaining) [2024-10-14 19:42:17,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 92 remaining) [2024-10-14 19:42:17,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 92 remaining) [2024-10-14 19:42:17,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 92 remaining) [2024-10-14 19:42:17,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 92 remaining) [2024-10-14 19:42:17,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 92 remaining) [2024-10-14 19:42:17,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 92 remaining) [2024-10-14 19:42:17,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 92 remaining) [2024-10-14 19:42:17,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 92 remaining) [2024-10-14 19:42:17,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 92 remaining) [2024-10-14 19:42:17,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 92 remaining) [2024-10-14 19:42:17,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 92 remaining) [2024-10-14 19:42:17,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 92 remaining) [2024-10-14 19:42:17,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 92 remaining) [2024-10-14 19:42:17,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 92 remaining) [2024-10-14 19:42:17,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 92 remaining) [2024-10-14 19:42:17,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 92 remaining) [2024-10-14 19:42:17,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 92 remaining) [2024-10-14 19:42:17,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 92 remaining) [2024-10-14 19:42:17,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 92 remaining) [2024-10-14 19:42:17,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 92 remaining) [2024-10-14 19:42:17,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 92 remaining) [2024-10-14 19:42:17,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 92 remaining) [2024-10-14 19:42:17,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 92 remaining) [2024-10-14 19:42:17,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 92 remaining) [2024-10-14 19:42:17,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 92 remaining) [2024-10-14 19:42:17,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 92 remaining) [2024-10-14 19:42:17,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 92 remaining) [2024-10-14 19:42:17,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 92 remaining) [2024-10-14 19:42:17,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 92 remaining) [2024-10-14 19:42:17,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 92 remaining) [2024-10-14 19:42:17,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 92 remaining) [2024-10-14 19:42:17,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 92 remaining) [2024-10-14 19:42:17,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 92 remaining) [2024-10-14 19:42:17,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 92 remaining) [2024-10-14 19:42:17,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 92 remaining) [2024-10-14 19:42:17,871 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 92 remaining) [2024-10-14 19:42:17,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 92 remaining) [2024-10-14 19:42:17,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 92 remaining) [2024-10-14 19:42:17,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 92 remaining) [2024-10-14 19:42:17,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 92 remaining) [2024-10-14 19:42:17,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK (24 of 92 remaining) [2024-10-14 19:42:17,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 92 remaining) [2024-10-14 19:42:17,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 92 remaining) [2024-10-14 19:42:17,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 92 remaining) [2024-10-14 19:42:17,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 92 remaining) [2024-10-14 19:42:17,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 92 remaining) [2024-10-14 19:42:17,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 92 remaining) [2024-10-14 19:42:17,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 92 remaining) [2024-10-14 19:42:17,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 92 remaining) [2024-10-14 19:42:17,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 92 remaining) [2024-10-14 19:42:17,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 92 remaining) [2024-10-14 19:42:17,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 92 remaining) [2024-10-14 19:42:17,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 92 remaining) [2024-10-14 19:42:17,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 92 remaining) [2024-10-14 19:42:17,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 92 remaining) [2024-10-14 19:42:17,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 92 remaining) [2024-10-14 19:42:17,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 92 remaining) [2024-10-14 19:42:17,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 92 remaining) [2024-10-14 19:42:17,874 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 92 remaining) [2024-10-14 19:42:17,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 92 remaining) [2024-10-14 19:42:17,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 92 remaining) [2024-10-14 19:42:17,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 92 remaining) [2024-10-14 19:42:17,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 92 remaining) [2024-10-14 19:42:17,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 92 remaining) [2024-10-14 19:42:17,875 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 92 remaining) [2024-10-14 19:42:17,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 19:42:17,876 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-10-14 19:42:17,945 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 19:42:17,946 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 19:42:17,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:42:17 BasicIcfg [2024-10-14 19:42:17,952 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 19:42:17,952 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 19:42:17,952 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 19:42:17,953 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 19:42:17,953 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:41:29" (3/4) ... [2024-10-14 19:42:17,954 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 19:42:18,026 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 19:42:18,029 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 19:42:18,030 INFO L158 Benchmark]: Toolchain (without parser) took 50690.47ms. Allocated memory was 163.6MB in the beginning and 648.0MB in the end (delta: 484.4MB). Free memory was 90.8MB in the beginning and 459.4MB in the end (delta: -368.6MB). Peak memory consumption was 119.0MB. Max. memory is 16.1GB. [2024-10-14 19:42:18,030 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:42:18,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 776.63ms. Allocated memory is still 163.6MB. Free memory was 90.8MB in the beginning and 110.0MB in the end (delta: -19.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-14 19:42:18,031 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.56ms. Allocated memory is still 163.6MB. Free memory was 110.0MB in the beginning and 106.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 19:42:18,031 INFO L158 Benchmark]: Boogie Preprocessor took 104.31ms. Allocated memory is still 163.6MB. Free memory was 106.6MB in the beginning and 102.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 19:42:18,032 INFO L158 Benchmark]: RCFGBuilder took 1026.79ms. Allocated memory is still 163.6MB. Free memory was 102.4MB in the beginning and 79.7MB in the end (delta: 22.7MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2024-10-14 19:42:18,033 INFO L158 Benchmark]: TraceAbstraction took 48616.40ms. Allocated memory was 163.6MB in the beginning and 648.0MB in the end (delta: 484.4MB). Free memory was 78.8MB in the beginning and 468.9MB in the end (delta: -390.1MB). Peak memory consumption was 93.1MB. Max. memory is 16.1GB. [2024-10-14 19:42:18,033 INFO L158 Benchmark]: Witness Printer took 77.11ms. Allocated memory is still 648.0MB. Free memory was 467.8MB in the beginning and 459.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 19:42:18,034 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 121.6MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 776.63ms. Allocated memory is still 163.6MB. Free memory was 90.8MB in the beginning and 110.0MB in the end (delta: -19.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.56ms. Allocated memory is still 163.6MB. Free memory was 110.0MB in the beginning and 106.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.31ms. Allocated memory is still 163.6MB. Free memory was 106.6MB in the beginning and 102.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1026.79ms. Allocated memory is still 163.6MB. Free memory was 102.4MB in the beginning and 79.7MB in the end (delta: 22.7MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * TraceAbstraction took 48616.40ms. Allocated memory was 163.6MB in the beginning and 648.0MB in the end (delta: 484.4MB). Free memory was 78.8MB in the beginning and 468.9MB in the end (delta: -390.1MB). Peak memory consumption was 93.1MB. Max. memory is 16.1GB. * Witness Printer took 77.11ms. Allocated memory is still 648.0MB. Free memory was 467.8MB in the beginning and 459.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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]; [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) [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=8, mutex={1:0}, p={-6: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=7, 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, 159 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: 48.4s, OverallIterations: 28, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 31.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13390 SdHoareTripleChecker+Valid, 27.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10366 mSDsluCounter, 8677 SdHoareTripleChecker+Invalid, 23.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7824 mSDsCounter, 840 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53984 IncrementalHoareTripleChecker+Invalid, 54824 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 840 mSolverCounterUnsat, 853 mSDtfsCounter, 53984 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 295 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=371occurred in iteration=26, InterpolantAutomatonStates: 206, 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, 0.8s SatisfiabilityAnalysisTime, 14.6s InterpolantComputationTime, 822 NumberOfCodeBlocks, 822 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 752 ConstructedInterpolants, 0 QuantifiedInterpolants, 8453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 143 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 31 InterpolantComputations, 25 PerfectInterpolantSequences, 1275/1308 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-10-14 19:42:18,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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)