./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_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 c488feb98493d291286969cd9fdbd15fc14c729caece3fe94bd3c70430190936 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:37:57,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:37:57,441 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:37:57,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:37:57,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:37:57,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:37:57,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:37:57,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:37:57,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:37:57,490 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:37:57,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:37:57,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:37:57,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:37:57,491 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:37:57,492 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:37:57,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:37:57,493 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:37:57,493 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:37:57,493 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:37:57,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:37:57,494 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:37:57,497 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:37:57,497 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:37:57,498 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:37:57,498 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:37:57,498 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:37:57,498 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:37:57,498 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:37:57,498 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:37:57,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:37:57,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:37:57,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:37:57,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:37:57,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:37:57,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:37:57,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:37:57,499 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:37:57,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:37:57,500 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:37:57,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:37:57,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:37:57,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:37:57,502 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 -> c488feb98493d291286969cd9fdbd15fc14c729caece3fe94bd3c70430190936 [2024-11-19 09:37:57,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:37:57,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:37:57,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:37:57,771 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:37:57,772 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:37:57,773 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr-deref.i [2024-11-19 09:37:59,096 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:37:59,311 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:37:59,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr-deref.i [2024-11-19 09:37:59,337 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7df4a883/ebb8e08049dc405296e3d8b509bd8b87/FLAGe3131c11e [2024-11-19 09:37:59,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7df4a883/ebb8e08049dc405296e3d8b509bd8b87 [2024-11-19 09:37:59,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:37:59,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:37:59,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:37:59,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:37:59,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:37:59,360 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:37:59" (1/1) ... [2024-11-19 09:37:59,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@355fd0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:59, skipping insertion in model container [2024-11-19 09:37:59,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:37:59" (1/1) ... [2024-11-19 09:37:59,401 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:37:59,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:38:00,030 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:38:00,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:38:00,140 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:38:00,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:00 WrapperNode [2024-11-19 09:38:00,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:38:00,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:38:00,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:38:00,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:38:00,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:00" (1/1) ... [2024-11-19 09:38:00,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:00" (1/1) ... [2024-11-19 09:38:00,203 INFO L138 Inliner]: procedures = 372, calls = 88, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 179 [2024-11-19 09:38:00,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:38:00,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:38:00,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:38:00,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:38:00,217 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:00" (1/1) ... [2024-11-19 09:38:00,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:00" (1/1) ... [2024-11-19 09:38:00,224 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:00" (1/1) ... [2024-11-19 09:38:00,251 INFO L175 MemorySlicer]: Split 78 memory accesses to 3 slices as follows [50, 14, 14]. 64 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 11 writes are split as follows [0, 1, 10]. [2024-11-19 09:38:00,255 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:00" (1/1) ... [2024-11-19 09:38:00,255 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:00" (1/1) ... [2024-11-19 09:38:00,273 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:00" (1/1) ... [2024-11-19 09:38:00,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:00" (1/1) ... [2024-11-19 09:38:00,282 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:00" (1/1) ... [2024-11-19 09:38:00,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:00" (1/1) ... [2024-11-19 09:38:00,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:38:00,295 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:38:00,295 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:38:00,295 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:38:00,296 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:00" (1/1) ... [2024-11-19 09:38:00,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:38:00,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:38:00,330 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:38:00,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:38:00,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:38:00,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:38:00,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 09:38:00,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 09:38:00,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 09:38:00,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 09:38:00,402 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 09:38:00,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 09:38:00,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 09:38:00,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 09:38:00,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 09:38:00,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 09:38:00,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 09:38:00,403 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 09:38:00,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:38:00,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:38:00,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:38:00,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:38:00,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 09:38:00,405 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-19 09:38:00,406 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-19 09:38:00,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:38:00,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 09:38:00,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 09:38:00,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:38:00,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:38:00,408 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:38:00,535 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:38:00,537 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:38:00,914 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:38:00,915 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:38:01,243 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:38:01,244 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 09:38:01,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:38:01 BoogieIcfgContainer [2024-11-19 09:38:01,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:38:01,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:38:01,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:38:01,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:38:01,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:37:59" (1/3) ... [2024-11-19 09:38:01,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da56a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:38:01, skipping insertion in model container [2024-11-19 09:38:01,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:00" (2/3) ... [2024-11-19 09:38:01,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da56a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:38:01, skipping insertion in model container [2024-11-19 09:38:01,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:38:01" (3/3) ... [2024-11-19 09:38:01,253 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_11-arraylist_nr-deref.i [2024-11-19 09:38:01,267 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:38:01,267 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-11-19 09:38:01,267 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:38:01,314 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 09:38:01,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 71 transitions, 146 flow [2024-11-19 09:38:01,393 INFO L124 PetriNetUnfolderBase]: 1/70 cut-off events. [2024-11-19 09:38:01,393 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:38:01,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 70 events. 1/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 163 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2024-11-19 09:38:01,395 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 71 transitions, 146 flow [2024-11-19 09:38:01,399 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 70 transitions, 143 flow [2024-11-19 09:38:01,409 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:38:01,416 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;@620ce89d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:38:01,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-19 09:38:01,421 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:38:01,421 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-19 09:38:01,422 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:38:01,422 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:01,423 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:38:01,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:01,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:01,428 INFO L85 PathProgramCache]: Analyzing trace with hash 499156, now seen corresponding path program 1 times [2024-11-19 09:38:01,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:01,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637875929] [2024-11-19 09:38:01,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:01,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:01,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:01,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:01,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637875929] [2024-11-19 09:38:01,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637875929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:01,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:01,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:38:01,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711173741] [2024-11-19 09:38:01,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:01,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:38:01,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:01,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:38:01,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:38:01,759 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2024-11-19 09:38:01,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:01,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:01,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2024-11-19 09:38:01,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:01,884 INFO L124 PetriNetUnfolderBase]: 64/266 cut-off events. [2024-11-19 09:38:01,885 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:38:01,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 266 events. 64/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1213 event pairs, 63 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 376. Up to 153 conditions per place. [2024-11-19 09:38:01,889 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 25 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-11-19 09:38:01,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 71 transitions, 199 flow [2024-11-19 09:38:01,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:01,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:01,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2024-11-19 09:38:01,901 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7652582159624414 [2024-11-19 09:38:01,906 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 143 flow. Second operand 3 states and 163 transitions. [2024-11-19 09:38:01,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 71 transitions, 199 flow [2024-11-19 09:38:01,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 71 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:38:01,911 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 154 flow [2024-11-19 09:38:01,913 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2024-11-19 09:38:01,917 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 2 predicate places. [2024-11-19 09:38:01,917 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 154 flow [2024-11-19 09:38:01,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:01,918 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:01,918 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-19 09:38:01,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:38:01,919 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:01,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:01,919 INFO L85 PathProgramCache]: Analyzing trace with hash 15471536, now seen corresponding path program 1 times [2024-11-19 09:38:01,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:01,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732372012] [2024-11-19 09:38:01,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:01,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:02,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:02,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732372012] [2024-11-19 09:38:02,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732372012] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:38:02,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825334864] [2024-11-19 09:38:02,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:02,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:38:02,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:38:02,026 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:38:02,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 09:38:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:02,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:38:02,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:02,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:02,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:38:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:02,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825334864] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:38:02,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:38:02,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-19 09:38:02,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784014754] [2024-11-19 09:38:02,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:38:02,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:38:02,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:02,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:38:02,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:38:02,168 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2024-11-19 09:38:02,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:02,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:02,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2024-11-19 09:38:02,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:02,251 INFO L124 PetriNetUnfolderBase]: 64/269 cut-off events. [2024-11-19 09:38:02,252 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:38:02,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 269 events. 64/269 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1213 event pairs, 63 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 428. Up to 153 conditions per place. [2024-11-19 09:38:02,254 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 25 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2024-11-19 09:38:02,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 226 flow [2024-11-19 09:38:02,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:38:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:38:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 303 transitions. [2024-11-19 09:38:02,256 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7112676056338029 [2024-11-19 09:38:02,257 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 154 flow. Second operand 6 states and 303 transitions. [2024-11-19 09:38:02,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 226 flow [2024-11-19 09:38:02,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 74 transitions, 222 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-19 09:38:02,259 INFO L231 Difference]: Finished difference. Result has 82 places, 74 transitions, 186 flow [2024-11-19 09:38:02,259 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=82, PETRI_TRANSITIONS=74} [2024-11-19 09:38:02,259 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 9 predicate places. [2024-11-19 09:38:02,260 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 186 flow [2024-11-19 09:38:02,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:02,260 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:02,260 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2024-11-19 09:38:02,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 09:38:02,464 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-11-19 09:38:02,465 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:02,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:02,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1348744404, now seen corresponding path program 2 times [2024-11-19 09:38:02,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:02,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512109471] [2024-11-19 09:38:02,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:38:02,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:02,478 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:38:02,479 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:38:02,520 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 09:38:02,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:02,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512109471] [2024-11-19 09:38:02,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512109471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:02,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:02,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:38:02,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210308908] [2024-11-19 09:38:02,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:02,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:38:02,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:02,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:38:02,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:38:02,562 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 71 [2024-11-19 09:38:02,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 74 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:02,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:02,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 71 [2024-11-19 09:38:02,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:02,650 INFO L124 PetriNetUnfolderBase]: 64/265 cut-off events. [2024-11-19 09:38:02,651 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:38:02,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 265 events. 64/265 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1196 event pairs, 63 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 417. Up to 155 conditions per place. [2024-11-19 09:38:02,652 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 28 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2024-11-19 09:38:02,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 70 transitions, 242 flow [2024-11-19 09:38:02,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:02,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2024-11-19 09:38:02,654 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6995305164319249 [2024-11-19 09:38:02,654 INFO L175 Difference]: Start difference. First operand has 82 places, 74 transitions, 186 flow. Second operand 3 states and 149 transitions. [2024-11-19 09:38:02,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 70 transitions, 242 flow [2024-11-19 09:38:02,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 70 transitions, 228 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-19 09:38:02,660 INFO L231 Difference]: Finished difference. Result has 79 places, 70 transitions, 172 flow [2024-11-19 09:38:02,660 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=79, PETRI_TRANSITIONS=70} [2024-11-19 09:38:02,661 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 6 predicate places. [2024-11-19 09:38:02,661 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 70 transitions, 172 flow [2024-11-19 09:38:02,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:02,662 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:02,662 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2024-11-19 09:38:02,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:38:02,662 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:02,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:02,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1348744405, now seen corresponding path program 1 times [2024-11-19 09:38:02,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:02,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525097403] [2024-11-19 09:38:02,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:02,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:02,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:02,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:02,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525097403] [2024-11-19 09:38:02,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525097403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:38:02,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778182089] [2024-11-19 09:38:02,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:02,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:38:02,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:38:02,778 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:38:02,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 09:38:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:02,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:38:02,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:02,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:38:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:02,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778182089] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:38:02,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:38:02,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-19 09:38:02,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040018015] [2024-11-19 09:38:02,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:38:02,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:38:02,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:02,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:38:02,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:38:02,930 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2024-11-19 09:38:02,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 70 transitions, 172 flow. Second operand has 13 states, 13 states have (on average 46.07692307692308) internal successors, (599), 13 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:02,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:02,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2024-11-19 09:38:02,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:03,039 INFO L124 PetriNetUnfolderBase]: 64/271 cut-off events. [2024-11-19 09:38:03,039 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-19 09:38:03,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 271 events. 64/271 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1199 event pairs, 63 based on Foata normal form. 6/219 useless extension candidates. Maximal degree in co-relation 419. Up to 153 conditions per place. [2024-11-19 09:38:03,043 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 25 selfloop transitions, 11 changer transitions 0/76 dead transitions. [2024-11-19 09:38:03,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 76 transitions, 280 flow [2024-11-19 09:38:03,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:38:03,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 09:38:03,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 582 transitions. [2024-11-19 09:38:03,046 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6830985915492958 [2024-11-19 09:38:03,046 INFO L175 Difference]: Start difference. First operand has 79 places, 70 transitions, 172 flow. Second operand 12 states and 582 transitions. [2024-11-19 09:38:03,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 76 transitions, 280 flow [2024-11-19 09:38:03,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 76 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:38:03,051 INFO L231 Difference]: Finished difference. Result has 94 places, 76 transitions, 248 flow [2024-11-19 09:38:03,051 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=248, PETRI_PLACES=94, PETRI_TRANSITIONS=76} [2024-11-19 09:38:03,052 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 21 predicate places. [2024-11-19 09:38:03,052 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 76 transitions, 248 flow [2024-11-19 09:38:03,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.07692307692308) internal successors, (599), 13 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:03,053 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:03,053 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2024-11-19 09:38:03,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 09:38:03,257 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-11-19 09:38:03,258 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:03,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:03,259 INFO L85 PathProgramCache]: Analyzing trace with hash 813205333, now seen corresponding path program 2 times [2024-11-19 09:38:03,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:03,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395530087] [2024-11-19 09:38:03,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:38:03,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:03,273 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:38:03,274 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:38:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-19 09:38:03,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:03,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395530087] [2024-11-19 09:38:03,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395530087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:03,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:03,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:38:03,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747881536] [2024-11-19 09:38:03,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:03,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:38:03,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:03,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:38:03,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:38:03,352 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 71 [2024-11-19 09:38:03,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 76 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:03,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:03,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 71 [2024-11-19 09:38:03,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:03,417 INFO L124 PetriNetUnfolderBase]: 64/267 cut-off events. [2024-11-19 09:38:03,418 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-19 09:38:03,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 267 events. 64/267 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1178 event pairs, 63 based on Foata normal form. 2/213 useless extension candidates. Maximal degree in co-relation 417. Up to 161 conditions per place. [2024-11-19 09:38:03,420 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 32 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2024-11-19 09:38:03,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 72 transitions, 312 flow [2024-11-19 09:38:03,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:03,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:03,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2024-11-19 09:38:03,422 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7183098591549296 [2024-11-19 09:38:03,422 INFO L175 Difference]: Start difference. First operand has 94 places, 76 transitions, 248 flow. Second operand 3 states and 153 transitions. [2024-11-19 09:38:03,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 72 transitions, 312 flow [2024-11-19 09:38:03,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 72 transitions, 264 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-11-19 09:38:03,427 INFO L231 Difference]: Finished difference. Result has 87 places, 72 transitions, 200 flow [2024-11-19 09:38:03,427 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=87, PETRI_TRANSITIONS=72} [2024-11-19 09:38:03,428 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 14 predicate places. [2024-11-19 09:38:03,429 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 72 transitions, 200 flow [2024-11-19 09:38:03,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:03,429 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:03,430 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2024-11-19 09:38:03,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:38:03,430 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:03,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:03,430 INFO L85 PathProgramCache]: Analyzing trace with hash -193709291, now seen corresponding path program 1 times [2024-11-19 09:38:03,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:03,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278156596] [2024-11-19 09:38:03,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:03,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:03,595 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-19 09:38:03,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:03,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278156596] [2024-11-19 09:38:03,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278156596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:03,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:03,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:38:03,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973803850] [2024-11-19 09:38:03,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:03,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:38:03,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:03,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:38:03,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:38:03,737 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2024-11-19 09:38:03,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 72 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:03,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:03,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2024-11-19 09:38:03,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:03,791 INFO L124 PetriNetUnfolderBase]: 73/289 cut-off events. [2024-11-19 09:38:03,792 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-11-19 09:38:03,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 289 events. 73/289 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1306 event pairs, 72 based on Foata normal form. 1/238 useless extension candidates. Maximal degree in co-relation 464. Up to 183 conditions per place. [2024-11-19 09:38:03,793 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 38 selfloop transitions, 1 changer transitions 0/68 dead transitions. [2024-11-19 09:38:03,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 68 transitions, 270 flow [2024-11-19 09:38:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:03,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:03,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2024-11-19 09:38:03,794 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6901408450704225 [2024-11-19 09:38:03,794 INFO L175 Difference]: Start difference. First operand has 87 places, 72 transitions, 200 flow. Second operand 3 states and 147 transitions. [2024-11-19 09:38:03,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 68 transitions, 270 flow [2024-11-19 09:38:03,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 68 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:38:03,796 INFO L231 Difference]: Finished difference. Result has 83 places, 68 transitions, 186 flow [2024-11-19 09:38:03,796 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=83, PETRI_TRANSITIONS=68} [2024-11-19 09:38:03,797 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2024-11-19 09:38:03,797 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 68 transitions, 186 flow [2024-11-19 09:38:03,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:03,798 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:03,798 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2024-11-19 09:38:03,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:38:03,798 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:03,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:03,798 INFO L85 PathProgramCache]: Analyzing trace with hash -193709290, now seen corresponding path program 1 times [2024-11-19 09:38:03,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:03,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548773501] [2024-11-19 09:38:03,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:03,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:03,951 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-19 09:38:03,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:03,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548773501] [2024-11-19 09:38:03,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548773501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:03,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:03,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:38:03,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837964066] [2024-11-19 09:38:03,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:03,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:38:03,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:03,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:38:03,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:38:04,116 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 71 [2024-11-19 09:38:04,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 68 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:04,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:04,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 71 [2024-11-19 09:38:04,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:04,240 INFO L124 PetriNetUnfolderBase]: 73/285 cut-off events. [2024-11-19 09:38:04,241 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-11-19 09:38:04,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 285 events. 73/285 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1291 event pairs, 63 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 488. Up to 148 conditions per place. [2024-11-19 09:38:04,243 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 37 selfloop transitions, 6 changer transitions 3/74 dead transitions. [2024-11-19 09:38:04,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 74 transitions, 290 flow [2024-11-19 09:38:04,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:38:04,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:38:04,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2024-11-19 09:38:04,244 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6309859154929578 [2024-11-19 09:38:04,244 INFO L175 Difference]: Start difference. First operand has 83 places, 68 transitions, 186 flow. Second operand 5 states and 224 transitions. [2024-11-19 09:38:04,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 74 transitions, 290 flow [2024-11-19 09:38:04,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 74 transitions, 289 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:38:04,246 INFO L231 Difference]: Finished difference. Result has 83 places, 65 transitions, 191 flow [2024-11-19 09:38:04,246 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=83, PETRI_TRANSITIONS=65} [2024-11-19 09:38:04,247 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2024-11-19 09:38:04,247 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 191 flow [2024-11-19 09:38:04,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:04,247 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:04,249 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:04,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:38:04,250 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:04,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:04,253 INFO L85 PathProgramCache]: Analyzing trace with hash -604059660, now seen corresponding path program 1 times [2024-11-19 09:38:04,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:04,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505122131] [2024-11-19 09:38:04,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:04,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-19 09:38:04,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:04,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505122131] [2024-11-19 09:38:04,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505122131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:04,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:04,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:38:04,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893443189] [2024-11-19 09:38:04,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:04,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:38:04,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:04,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:38:04,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:38:04,757 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 71 [2024-11-19 09:38:04,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 191 flow. Second operand has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:04,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:04,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 71 [2024-11-19 09:38:04,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:04,928 INFO L124 PetriNetUnfolderBase]: 64/253 cut-off events. [2024-11-19 09:38:04,929 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-19 09:38:04,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 253 events. 64/253 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1094 event pairs, 54 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 454. Up to 126 conditions per place. [2024-11-19 09:38:04,930 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 38 selfloop transitions, 7 changer transitions 3/72 dead transitions. [2024-11-19 09:38:04,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 72 transitions, 301 flow [2024-11-19 09:38:04,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:38:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:38:04,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 292 transitions. [2024-11-19 09:38:04,931 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5875251509054326 [2024-11-19 09:38:04,931 INFO L175 Difference]: Start difference. First operand has 83 places, 65 transitions, 191 flow. Second operand 7 states and 292 transitions. [2024-11-19 09:38:04,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 72 transitions, 301 flow [2024-11-19 09:38:04,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 72 transitions, 289 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:38:04,933 INFO L231 Difference]: Finished difference. Result has 83 places, 63 transitions, 189 flow [2024-11-19 09:38:04,934 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=189, PETRI_PLACES=83, PETRI_TRANSITIONS=63} [2024-11-19 09:38:04,934 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2024-11-19 09:38:04,934 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 63 transitions, 189 flow [2024-11-19 09:38:04,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:04,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:04,935 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:04,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 09:38:04,935 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:04,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:04,935 INFO L85 PathProgramCache]: Analyzing trace with hash -604059659, now seen corresponding path program 1 times [2024-11-19 09:38:04,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:04,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422457505] [2024-11-19 09:38:04,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:04,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-19 09:38:05,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:05,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422457505] [2024-11-19 09:38:05,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422457505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:05,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:05,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:38:05,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374752249] [2024-11-19 09:38:05,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:05,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:38:05,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:05,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:38:05,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:38:05,632 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 71 [2024-11-19 09:38:05,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 63 transitions, 189 flow. Second operand has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:05,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:05,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 71 [2024-11-19 09:38:05,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:05,763 INFO L124 PetriNetUnfolderBase]: 64/251 cut-off events. [2024-11-19 09:38:05,763 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-11-19 09:38:05,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 251 events. 64/251 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1090 event pairs, 54 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 453. Up to 126 conditions per place. [2024-11-19 09:38:05,765 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 37 selfloop transitions, 7 changer transitions 3/70 dead transitions. [2024-11-19 09:38:05,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 70 transitions, 297 flow [2024-11-19 09:38:05,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:38:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:38:05,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 270 transitions. [2024-11-19 09:38:05,766 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5432595573440644 [2024-11-19 09:38:05,766 INFO L175 Difference]: Start difference. First operand has 83 places, 63 transitions, 189 flow. Second operand 7 states and 270 transitions. [2024-11-19 09:38:05,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 70 transitions, 297 flow [2024-11-19 09:38:05,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 70 transitions, 283 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 09:38:05,768 INFO L231 Difference]: Finished difference. Result has 81 places, 61 transitions, 185 flow [2024-11-19 09:38:05,768 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=185, PETRI_PLACES=81, PETRI_TRANSITIONS=61} [2024-11-19 09:38:05,768 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 8 predicate places. [2024-11-19 09:38:05,769 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 61 transitions, 185 flow [2024-11-19 09:38:05,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:05,769 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:05,769 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:05,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:38:05,769 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:05,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:05,769 INFO L85 PathProgramCache]: Analyzing trace with hash -680730190, now seen corresponding path program 1 times [2024-11-19 09:38:05,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:05,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666079041] [2024-11-19 09:38:05,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:05,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-19 09:38:05,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:05,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666079041] [2024-11-19 09:38:05,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666079041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:05,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:05,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:38:05,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235550095] [2024-11-19 09:38:05,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:05,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:38:05,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:05,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:38:05,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:38:06,003 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 71 [2024-11-19 09:38:06,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 61 transitions, 185 flow. Second operand has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:06,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:06,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 71 [2024-11-19 09:38:06,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:06,086 INFO L124 PetriNetUnfolderBase]: 64/250 cut-off events. [2024-11-19 09:38:06,086 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2024-11-19 09:38:06,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 250 events. 64/250 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1094 event pairs, 63 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 450. Up to 158 conditions per place. [2024-11-19 09:38:06,088 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 30 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2024-11-19 09:38:06,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 60 transitions, 255 flow [2024-11-19 09:38:06,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:38:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:38:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 247 transitions. [2024-11-19 09:38:06,089 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6957746478873239 [2024-11-19 09:38:06,089 INFO L175 Difference]: Start difference. First operand has 81 places, 61 transitions, 185 flow. Second operand 5 states and 247 transitions. [2024-11-19 09:38:06,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 60 transitions, 255 flow [2024-11-19 09:38:06,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 60 transitions, 241 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 09:38:06,091 INFO L231 Difference]: Finished difference. Result has 78 places, 60 transitions, 181 flow [2024-11-19 09:38:06,091 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=78, PETRI_TRANSITIONS=60} [2024-11-19 09:38:06,091 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2024-11-19 09:38:06,091 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 60 transitions, 181 flow [2024-11-19 09:38:06,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:06,092 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:06,092 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:06,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:38:06,092 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:06,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:06,093 INFO L85 PathProgramCache]: Analyzing trace with hash -680730191, now seen corresponding path program 1 times [2024-11-19 09:38:06,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:06,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364058221] [2024-11-19 09:38:06,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:06,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-19 09:38:06,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:06,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364058221] [2024-11-19 09:38:06,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364058221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:06,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:06,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:38:06,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644359562] [2024-11-19 09:38:06,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:06,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:38:06,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:06,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:38:06,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:38:06,296 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2024-11-19 09:38:06,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 60 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:06,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:06,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2024-11-19 09:38:06,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:06,377 INFO L124 PetriNetUnfolderBase]: 64/249 cut-off events. [2024-11-19 09:38:06,377 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-11-19 09:38:06,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 249 events. 64/249 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1096 event pairs, 63 based on Foata normal form. 1/208 useless extension candidates. Maximal degree in co-relation 441. Up to 158 conditions per place. [2024-11-19 09:38:06,379 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 32 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2024-11-19 09:38:06,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 59 transitions, 255 flow [2024-11-19 09:38:06,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:38:06,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:38:06,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2024-11-19 09:38:06,380 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6169014084507042 [2024-11-19 09:38:06,380 INFO L175 Difference]: Start difference. First operand has 78 places, 60 transitions, 181 flow. Second operand 5 states and 219 transitions. [2024-11-19 09:38:06,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 59 transitions, 255 flow [2024-11-19 09:38:06,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 59 transitions, 243 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:38:06,382 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 179 flow [2024-11-19 09:38:06,382 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2024-11-19 09:38:06,382 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 4 predicate places. [2024-11-19 09:38:06,383 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 179 flow [2024-11-19 09:38:06,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:06,383 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:06,383 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:06,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 09:38:06,384 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:06,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:06,384 INFO L85 PathProgramCache]: Analyzing trace with hash 789294420, now seen corresponding path program 1 times [2024-11-19 09:38:06,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:06,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362989314] [2024-11-19 09:38:06,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:06,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-19 09:38:06,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:06,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362989314] [2024-11-19 09:38:06,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362989314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:06,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:06,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:38:06,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766499141] [2024-11-19 09:38:06,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:06,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:38:06,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:06,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:38:06,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:38:06,495 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 71 [2024-11-19 09:38:06,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 59 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:06,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:06,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 71 [2024-11-19 09:38:06,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:06,559 INFO L124 PetriNetUnfolderBase]: 71/259 cut-off events. [2024-11-19 09:38:06,559 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-11-19 09:38:06,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 259 events. 71/259 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1124 event pairs, 56 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 464. Up to 148 conditions per place. [2024-11-19 09:38:06,560 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 42 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-11-19 09:38:06,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 64 transitions, 277 flow [2024-11-19 09:38:06,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:06,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:06,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2024-11-19 09:38:06,562 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7605633802816901 [2024-11-19 09:38:06,562 INFO L175 Difference]: Start difference. First operand has 77 places, 59 transitions, 179 flow. Second operand 3 states and 162 transitions. [2024-11-19 09:38:06,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 64 transitions, 277 flow [2024-11-19 09:38:06,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 64 transitions, 265 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:38:06,563 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 167 flow [2024-11-19 09:38:06,563 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2024-11-19 09:38:06,564 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2024-11-19 09:38:06,564 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 167 flow [2024-11-19 09:38:06,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:06,564 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:06,564 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:06,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 09:38:06,565 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:06,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:06,565 INFO L85 PathProgramCache]: Analyzing trace with hash 789294421, now seen corresponding path program 1 times [2024-11-19 09:38:06,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:06,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213330798] [2024-11-19 09:38:06,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:06,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:06,685 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-19 09:38:06,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:06,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213330798] [2024-11-19 09:38:06,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213330798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:06,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:06,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:38:06,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939087546] [2024-11-19 09:38:06,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:06,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:38:06,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:06,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:38:06,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:38:06,725 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 71 [2024-11-19 09:38:06,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:06,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:06,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 71 [2024-11-19 09:38:06,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:06,798 INFO L124 PetriNetUnfolderBase]: 64/236 cut-off events. [2024-11-19 09:38:06,799 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-19 09:38:06,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 236 events. 64/236 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 970 event pairs, 56 based on Foata normal form. 16/223 useless extension candidates. Maximal degree in co-relation 436. Up to 148 conditions per place. [2024-11-19 09:38:06,800 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 41 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2024-11-19 09:38:06,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 62 transitions, 263 flow [2024-11-19 09:38:06,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2024-11-19 09:38:06,801 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7699530516431925 [2024-11-19 09:38:06,802 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 167 flow. Second operand 3 states and 164 transitions. [2024-11-19 09:38:06,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 62 transitions, 263 flow [2024-11-19 09:38:06,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 62 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:38:06,803 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 163 flow [2024-11-19 09:38:06,803 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2024-11-19 09:38:06,804 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2024-11-19 09:38:06,804 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 163 flow [2024-11-19 09:38:06,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:06,804 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:06,805 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:06,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 09:38:06,805 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:06,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:06,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1333559426, now seen corresponding path program 1 times [2024-11-19 09:38:06,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:06,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378613384] [2024-11-19 09:38:06,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:06,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:07,047 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-19 09:38:07,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:07,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378613384] [2024-11-19 09:38:07,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378613384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:07,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:07,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:38:07,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284200486] [2024-11-19 09:38:07,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:07,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:38:07,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:07,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:38:07,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:38:07,352 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 71 [2024-11-19 09:38:07,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 163 flow. Second operand has 9 states, 9 states have (on average 41.666666666666664) internal successors, (375), 9 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:07,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:07,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 71 [2024-11-19 09:38:07,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:07,523 INFO L124 PetriNetUnfolderBase]: 85/291 cut-off events. [2024-11-19 09:38:07,523 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-11-19 09:38:07,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 291 events. 85/291 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1292 event pairs, 60 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 541. Up to 152 conditions per place. [2024-11-19 09:38:07,525 INFO L140 encePairwiseOnDemand]: 59/71 looper letters, 44 selfloop transitions, 11 changer transitions 3/74 dead transitions. [2024-11-19 09:38:07,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 325 flow [2024-11-19 09:38:07,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:38:07,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:38:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 449 transitions. [2024-11-19 09:38:07,526 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6323943661971831 [2024-11-19 09:38:07,526 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 163 flow. Second operand 10 states and 449 transitions. [2024-11-19 09:38:07,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 325 flow [2024-11-19 09:38:07,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 74 transitions, 313 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:38:07,528 INFO L231 Difference]: Finished difference. Result has 79 places, 57 transitions, 194 flow [2024-11-19 09:38:07,528 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=194, PETRI_PLACES=79, PETRI_TRANSITIONS=57} [2024-11-19 09:38:07,528 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 6 predicate places. [2024-11-19 09:38:07,529 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 57 transitions, 194 flow [2024-11-19 09:38:07,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 41.666666666666664) internal successors, (375), 9 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:07,529 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:07,529 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:07,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 09:38:07,529 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:07,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:07,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1333559427, now seen corresponding path program 1 times [2024-11-19 09:38:07,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:07,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598395051] [2024-11-19 09:38:07,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:07,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:07,715 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-19 09:38:07,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:07,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598395051] [2024-11-19 09:38:07,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598395051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:07,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:07,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:38:07,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017108650] [2024-11-19 09:38:07,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:07,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:38:07,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:07,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:38:07,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:38:07,890 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 71 [2024-11-19 09:38:07,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 57 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 42.5) internal successors, (255), 6 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:07,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:07,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 71 [2024-11-19 09:38:07,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:08,067 INFO L124 PetriNetUnfolderBase]: 79/269 cut-off events. [2024-11-19 09:38:08,068 INFO L125 PetriNetUnfolderBase]: For 98/104 co-relation queries the response was YES. [2024-11-19 09:38:08,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 269 events. 79/269 cut-off events. For 98/104 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1132 event pairs, 54 based on Foata normal form. 17/255 useless extension candidates. Maximal degree in co-relation 551. Up to 132 conditions per place. [2024-11-19 09:38:08,069 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 47 selfloop transitions, 7 changer transitions 3/73 dead transitions. [2024-11-19 09:38:08,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 73 transitions, 342 flow [2024-11-19 09:38:08,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:38:08,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:38:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 287 transitions. [2024-11-19 09:38:08,070 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6737089201877934 [2024-11-19 09:38:08,071 INFO L175 Difference]: Start difference. First operand has 79 places, 57 transitions, 194 flow. Second operand 6 states and 287 transitions. [2024-11-19 09:38:08,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 73 transitions, 342 flow [2024-11-19 09:38:08,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 73 transitions, 323 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-19 09:38:08,072 INFO L231 Difference]: Finished difference. Result has 75 places, 56 transitions, 187 flow [2024-11-19 09:38:08,073 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=75, PETRI_TRANSITIONS=56} [2024-11-19 09:38:08,073 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 2 predicate places. [2024-11-19 09:38:08,073 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 56 transitions, 187 flow [2024-11-19 09:38:08,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.5) internal successors, (255), 6 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:08,073 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:08,073 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-11-19 09:38:08,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 09:38:08,074 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:08,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:08,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1609331277, now seen corresponding path program 1 times [2024-11-19 09:38:08,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:08,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905421307] [2024-11-19 09:38:08,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:08,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:09,064 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-19 09:38:09,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:09,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905421307] [2024-11-19 09:38:09,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905421307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:09,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:09,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 09:38:09,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070849092] [2024-11-19 09:38:09,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:09,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:38:09,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:09,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:38:09,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:38:09,861 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 71 [2024-11-19 09:38:09,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 56 transitions, 187 flow. Second operand has 14 states, 14 states have (on average 34.285714285714285) internal successors, (480), 14 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-11-19 09:38:09,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:09,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 71 [2024-11-19 09:38:09,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:10,199 INFO L124 PetriNetUnfolderBase]: 111/351 cut-off events. [2024-11-19 09:38:10,199 INFO L125 PetriNetUnfolderBase]: For 155/162 co-relation queries the response was YES. [2024-11-19 09:38:10,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 351 events. 111/351 cut-off events. For 155/162 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1620 event pairs, 20 based on Foata normal form. 0/312 useless extension candidates. Maximal degree in co-relation 729. Up to 137 conditions per place. [2024-11-19 09:38:10,201 INFO L140 encePairwiseOnDemand]: 57/71 looper letters, 56 selfloop transitions, 17 changer transitions 0/84 dead transitions. [2024-11-19 09:38:10,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 84 transitions, 407 flow [2024-11-19 09:38:10,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 09:38:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-19 09:38:10,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 492 transitions. [2024-11-19 09:38:10,228 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5330444203683641 [2024-11-19 09:38:10,228 INFO L175 Difference]: Start difference. First operand has 75 places, 56 transitions, 187 flow. Second operand 13 states and 492 transitions. [2024-11-19 09:38:10,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 84 transitions, 407 flow [2024-11-19 09:38:10,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 84 transitions, 385 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 09:38:10,230 INFO L231 Difference]: Finished difference. Result has 87 places, 64 transitions, 264 flow [2024-11-19 09:38:10,234 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=264, PETRI_PLACES=87, PETRI_TRANSITIONS=64} [2024-11-19 09:38:10,235 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 14 predicate places. [2024-11-19 09:38:10,235 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 64 transitions, 264 flow [2024-11-19 09:38:10,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 34.285714285714285) internal successors, (480), 14 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-11-19 09:38:10,235 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:10,235 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-11-19 09:38:10,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 09:38:10,236 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:10,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:10,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1609331278, now seen corresponding path program 1 times [2024-11-19 09:38:10,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:10,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175937016] [2024-11-19 09:38:10,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:10,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:10,991 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-19 09:38:10,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:10,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175937016] [2024-11-19 09:38:10,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175937016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:10,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:10,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 09:38:10,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758018054] [2024-11-19 09:38:10,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:10,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:38:10,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:10,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:38:10,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:38:11,716 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 71 [2024-11-19 09:38:11,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 64 transitions, 264 flow. Second operand has 13 states, 13 states have (on average 30.384615384615383) internal successors, (395), 13 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:11,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:11,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 71 [2024-11-19 09:38:11,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:12,112 INFO L124 PetriNetUnfolderBase]: 132/400 cut-off events. [2024-11-19 09:38:12,112 INFO L125 PetriNetUnfolderBase]: For 240/249 co-relation queries the response was YES. [2024-11-19 09:38:12,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 400 events. 132/400 cut-off events. For 240/249 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1918 event pairs, 41 based on Foata normal form. 12/381 useless extension candidates. Maximal degree in co-relation 922. Up to 190 conditions per place. [2024-11-19 09:38:12,114 INFO L140 encePairwiseOnDemand]: 58/71 looper letters, 60 selfloop transitions, 16 changer transitions 0/87 dead transitions. [2024-11-19 09:38:12,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 87 transitions, 472 flow [2024-11-19 09:38:12,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 09:38:12,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-19 09:38:12,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 443 transitions. [2024-11-19 09:38:12,116 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4799566630552546 [2024-11-19 09:38:12,116 INFO L175 Difference]: Start difference. First operand has 87 places, 64 transitions, 264 flow. Second operand 13 states and 443 transitions. [2024-11-19 09:38:12,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 87 transitions, 472 flow [2024-11-19 09:38:12,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 87 transitions, 459 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-19 09:38:12,119 INFO L231 Difference]: Finished difference. Result has 94 places, 65 transitions, 301 flow [2024-11-19 09:38:12,119 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=301, PETRI_PLACES=94, PETRI_TRANSITIONS=65} [2024-11-19 09:38:12,120 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 21 predicate places. [2024-11-19 09:38:12,120 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 65 transitions, 301 flow [2024-11-19 09:38:12,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 30.384615384615383) internal successors, (395), 13 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:12,120 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:12,120 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-11-19 09:38:12,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 09:38:12,120 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:12,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:12,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1697257707, now seen corresponding path program 1 times [2024-11-19 09:38:12,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:12,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39388403] [2024-11-19 09:38:12,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:12,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-19 09:38:12,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:12,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39388403] [2024-11-19 09:38:12,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39388403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:12,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:12,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 09:38:12,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559451482] [2024-11-19 09:38:12,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:12,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:38:12,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:12,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:38:12,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:38:13,055 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 71 [2024-11-19 09:38:13,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 65 transitions, 301 flow. Second operand has 9 states, 9 states have (on average 36.666666666666664) internal successors, (330), 9 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:13,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:13,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 71 [2024-11-19 09:38:13,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:13,205 INFO L124 PetriNetUnfolderBase]: 107/332 cut-off events. [2024-11-19 09:38:13,206 INFO L125 PetriNetUnfolderBase]: For 309/318 co-relation queries the response was YES. [2024-11-19 09:38:13,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 332 events. 107/332 cut-off events. For 309/318 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1536 event pairs, 59 based on Foata normal form. 1/304 useless extension candidates. Maximal degree in co-relation 830. Up to 222 conditions per place. [2024-11-19 09:38:13,207 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 47 selfloop transitions, 6 changer transitions 0/72 dead transitions. [2024-11-19 09:38:13,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 72 transitions, 447 flow [2024-11-19 09:38:13,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:38:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:38:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2024-11-19 09:38:13,208 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5943661971830986 [2024-11-19 09:38:13,209 INFO L175 Difference]: Start difference. First operand has 94 places, 65 transitions, 301 flow. Second operand 5 states and 211 transitions. [2024-11-19 09:38:13,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 72 transitions, 447 flow [2024-11-19 09:38:13,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 72 transitions, 411 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-11-19 09:38:13,211 INFO L231 Difference]: Finished difference. Result has 86 places, 64 transitions, 281 flow [2024-11-19 09:38:13,211 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=281, PETRI_PLACES=86, PETRI_TRANSITIONS=64} [2024-11-19 09:38:13,212 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 13 predicate places. [2024-11-19 09:38:13,212 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 64 transitions, 281 flow [2024-11-19 09:38:13,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.666666666666664) internal successors, (330), 9 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:13,213 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:13,213 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] [2024-11-19 09:38:13,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 09:38:13,213 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:13,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:13,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1075380797, now seen corresponding path program 1 times [2024-11-19 09:38:13,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:13,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221126580] [2024-11-19 09:38:13,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:13,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:38:13,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:38:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:38:13,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 09:38:13,518 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:38:13,519 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 50 remaining) [2024-11-19 09:38:13,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2024-11-19 09:38:13,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2024-11-19 09:38:13,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2024-11-19 09:38:13,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2024-11-19 09:38:13,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2024-11-19 09:38:13,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2024-11-19 09:38:13,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2024-11-19 09:38:13,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2024-11-19 09:38:13,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2024-11-19 09:38:13,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2024-11-19 09:38:13,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2024-11-19 09:38:13,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2024-11-19 09:38:13,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2024-11-19 09:38:13,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2024-11-19 09:38:13,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2024-11-19 09:38:13,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2024-11-19 09:38:13,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2024-11-19 09:38:13,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2024-11-19 09:38:13,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2024-11-19 09:38:13,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2024-11-19 09:38:13,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2024-11-19 09:38:13,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2024-11-19 09:38:13,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2024-11-19 09:38:13,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2024-11-19 09:38:13,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (24 of 50 remaining) [2024-11-19 09:38:13,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 50 remaining) [2024-11-19 09:38:13,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2024-11-19 09:38:13,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2024-11-19 09:38:13,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2024-11-19 09:38:13,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2024-11-19 09:38:13,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2024-11-19 09:38:13,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2024-11-19 09:38:13,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2024-11-19 09:38:13,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2024-11-19 09:38:13,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2024-11-19 09:38:13,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2024-11-19 09:38:13,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2024-11-19 09:38:13,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2024-11-19 09:38:13,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2024-11-19 09:38:13,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2024-11-19 09:38:13,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2024-11-19 09:38:13,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2024-11-19 09:38:13,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2024-11-19 09:38:13,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2024-11-19 09:38:13,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2024-11-19 09:38:13,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2024-11-19 09:38:13,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2024-11-19 09:38:13,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2024-11-19 09:38:13,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 50 remaining) [2024-11-19 09:38:13,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 09:38:13,526 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:13,570 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:38:13,570 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:38:13,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:38:13 BasicIcfg [2024-11-19 09:38:13,576 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:38:13,577 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:38:13,577 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:38:13,577 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:38:13,577 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:38:01" (3/4) ... [2024-11-19 09:38:13,578 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 09:38:13,628 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 09:38:13,628 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:38:13,629 INFO L158 Benchmark]: Toolchain (without parser) took 14274.91ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 106.7MB in the beginning and 281.2MB in the end (delta: -174.5MB). Peak memory consumption was 87.3MB. Max. memory is 16.1GB. [2024-11-19 09:38:13,629 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 131.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:38:13,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 786.06ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 62.6MB in the end (delta: 44.1MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-19 09:38:13,629 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.10ms. Allocated memory is still 167.8MB. Free memory was 62.6MB in the beginning and 59.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:38:13,630 INFO L158 Benchmark]: Boogie Preprocessor took 86.38ms. Allocated memory is still 167.8MB. Free memory was 59.2MB in the beginning and 55.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:38:13,630 INFO L158 Benchmark]: RCFGBuilder took 949.41ms. Allocated memory was 167.8MB in the beginning and 232.8MB in the end (delta: 65.0MB). Free memory was 55.6MB in the beginning and 100.2MB in the end (delta: -44.6MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2024-11-19 09:38:13,630 INFO L158 Benchmark]: TraceAbstraction took 12329.66ms. Allocated memory was 232.8MB in the beginning and 427.8MB in the end (delta: 195.0MB). Free memory was 100.2MB in the beginning and 286.4MB in the end (delta: -186.2MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2024-11-19 09:38:13,631 INFO L158 Benchmark]: Witness Printer took 51.72ms. Allocated memory is still 427.8MB. Free memory was 286.4MB in the beginning and 281.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 09:38:13,632 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 167.8MB. Free memory is still 131.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 786.06ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 62.6MB in the end (delta: 44.1MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.10ms. Allocated memory is still 167.8MB. Free memory was 62.6MB in the beginning and 59.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.38ms. Allocated memory is still 167.8MB. Free memory was 59.2MB in the beginning and 55.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 949.41ms. Allocated memory was 167.8MB in the beginning and 232.8MB in the end (delta: 65.0MB). Free memory was 55.6MB in the beginning and 100.2MB in the end (delta: -44.6MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12329.66ms. Allocated memory was 232.8MB in the beginning and 427.8MB in the end (delta: 195.0MB). Free memory was 100.2MB in the beginning and 286.4MB in the end (delta: -186.2MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Witness Printer took 51.72ms. Allocated memory is still 427.8MB. Free memory was 286.4MB in the beginning and 281.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1254] 0 int i = 0; VAL [i=0, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=1, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=2, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=3, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=4, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=5, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=6, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=7, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=8, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=9, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=10, mutex={1:0}, slot={2:0}] [L1254] COND FALSE 0 !(i < 10) [L1256] 0 int j = __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] 0 struct s *p; [L1259] 0 pthread_t t1; [L1260] 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; [L1260] RET, EXPR 0 new(1) [L1260] 0 slot[j] = new(1) [L1261] 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; [L1261] RET, EXPR 0 new(2) [L1261] EXPR 0 slot[j] [L1261] 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 [L1261] RET 0 list_add(new(2), slot[j]) [L1262] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [j=5, mutex={1: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=8, 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: 1253]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1262]: 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, 96 locations, 50 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: 12.2s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3421 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2528 mSDsluCounter, 1725 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1595 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9452 IncrementalHoareTripleChecker+Invalid, 9582 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 130 mSDtfsCounter, 9452 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=17, InterpolantAutomatonStates: 112, 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.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 374 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 334 ConstructedInterpolants, 0 QuantifiedInterpolants, 2680 SizeOfPredicates, 0 NumberOfNonLiveVariables, 405 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 780/813 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-19 09:38:13,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)