./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-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_09-arraylist-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 531fb1e21d8f5a9631a3764359a014fcdd0042558e9afceaf1b553fa03cda562 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:37:56,034 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:37:56,118 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:56,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:37:56,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:37:56,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:37:56,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:37:56,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:37:56,153 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:37:56,156 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:37:56,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:37:56,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:37:56,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:37:56,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:37:56,160 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:37:56,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:37:56,161 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:37:56,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:37:56,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:37:56,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:37:56,162 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:37:56,163 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:37:56,163 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:37:56,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:37:56,164 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:37:56,164 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:37:56,165 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:37:56,165 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:37:56,165 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:37:56,166 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:37:56,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:37:56,166 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:37:56,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:37:56,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:37:56,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:37:56,168 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:37:56,168 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:37:56,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:37:56,169 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:37:56,169 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:37:56,169 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:37:56,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:37:56,170 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 -> 531fb1e21d8f5a9631a3764359a014fcdd0042558e9afceaf1b553fa03cda562 [2024-11-19 09:37:56,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:37:56,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:37:56,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:37:56,455 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:37:56,455 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:37:56,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.i [2024-11-19 09:37:57,943 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:37:58,226 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:37:58,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.i [2024-11-19 09:37:58,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53fc92b6e/18cc804a111f47ffb53f52bdadd718b5/FLAG70b56e2cf [2024-11-19 09:37:58,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53fc92b6e/18cc804a111f47ffb53f52bdadd718b5 [2024-11-19 09:37:58,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:37:58,266 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:37:58,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:37:58,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:37:58,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:37:58,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:37:58" (1/1) ... [2024-11-19 09:37:58,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@465fdf53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:58, skipping insertion in model container [2024-11-19 09:37:58,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:37:58" (1/1) ... [2024-11-19 09:37:58,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:37:58,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:37:58,868 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:37:58,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:37:59,070 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:37:59,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:59 WrapperNode [2024-11-19 09:37:59,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:37:59,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:37:59,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:37:59,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:37:59,079 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:37:59" (1/1) ... [2024-11-19 09:37:59,106 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:37:59" (1/1) ... [2024-11-19 09:37:59,148 INFO L138 Inliner]: procedures = 372, calls = 43, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 124 [2024-11-19 09:37:59,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:37:59,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:37:59,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:37:59,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:37:59,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:59" (1/1) ... [2024-11-19 09:37:59,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:59" (1/1) ... [2024-11-19 09:37:59,174 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:59" (1/1) ... [2024-11-19 09:37:59,208 INFO L175 MemorySlicer]: Split 33 memory accesses to 3 slices as follows [5, 14, 14]. 42 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [5, 10, 0]. The 11 writes are split as follows [0, 1, 10]. [2024-11-19 09:37:59,208 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:59" (1/1) ... [2024-11-19 09:37:59,208 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:59" (1/1) ... [2024-11-19 09:37:59,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:59" (1/1) ... [2024-11-19 09:37:59,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:59" (1/1) ... [2024-11-19 09:37:59,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:59" (1/1) ... [2024-11-19 09:37:59,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:59" (1/1) ... [2024-11-19 09:37:59,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:37:59,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:37:59,243 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:37:59,243 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:37:59,244 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:59" (1/1) ... [2024-11-19 09:37:59,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:37:59,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:37:59,280 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:37:59,286 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:37:59,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:37:59,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:37:59,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 09:37:59,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 09:37:59,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 09:37:59,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 09:37:59,330 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 09:37:59,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 09:37:59,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 09:37:59,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 09:37:59,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 09:37:59,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 09:37:59,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 09:37:59,331 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 09:37:59,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:37:59,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:37:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:37:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:37:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 09:37:59,332 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-19 09:37:59,332 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-19 09:37:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:37:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 09:37:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 09:37:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:37:59,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:37:59,336 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:37:59,521 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:37:59,523 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:37:59,866 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:37:59,866 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:38:00,144 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:38:00,146 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 09:38:00,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:38:00 BoogieIcfgContainer [2024-11-19 09:38:00,146 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:38:00,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:38:00,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:38:00,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:38:00,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:37:58" (1/3) ... [2024-11-19 09:38:00,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d21904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:38:00, skipping insertion in model container [2024-11-19 09:38:00,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:59" (2/3) ... [2024-11-19 09:38:00,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d21904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:38:00, skipping insertion in model container [2024-11-19 09:38:00,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:38:00" (3/3) ... [2024-11-19 09:38:00,156 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_09-arraylist-deref.i [2024-11-19 09:38:00,174 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:38:00,175 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-11-19 09:38:00,175 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:38:00,248 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 09:38:00,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 69 transitions, 142 flow [2024-11-19 09:38:00,333 INFO L124 PetriNetUnfolderBase]: 0/68 cut-off events. [2024-11-19 09:38:00,334 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:38:00,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 68 events. 0/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 164 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-11-19 09:38:00,338 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 69 transitions, 142 flow [2024-11-19 09:38:00,343 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 68 transitions, 139 flow [2024-11-19 09:38:00,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:38:00,365 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;@fb569c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:38:00,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-19 09:38:00,370 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:38:00,373 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2024-11-19 09:38:00,374 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:38:00,374 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:00,375 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-11-19 09:38:00,376 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:00,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:00,381 INFO L85 PathProgramCache]: Analyzing trace with hash 12649, now seen corresponding path program 1 times [2024-11-19 09:38:00,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:00,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080217215] [2024-11-19 09:38:00,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:00,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:00,726 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:00,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:00,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080217215] [2024-11-19 09:38:00,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080217215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:00,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:00,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:38:00,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910355860] [2024-11-19 09:38:00,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:00,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:38:00,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:00,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:38:00,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:38:00,858 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 69 [2024-11-19 09:38:00,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 68 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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:00,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:00,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 69 [2024-11-19 09:38:00,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:01,000 INFO L124 PetriNetUnfolderBase]: 63/260 cut-off events. [2024-11-19 09:38:01,003 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:38:01,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 260 events. 63/260 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1223 event pairs, 63 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 377. Up to 149 conditions per place. [2024-11-19 09:38:01,011 INFO L140 encePairwiseOnDemand]: 61/69 looper letters, 22 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2024-11-19 09:38:01,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 183 flow [2024-11-19 09:38:01,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:01,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:01,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2024-11-19 09:38:01,025 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7101449275362319 [2024-11-19 09:38:01,027 INFO L175 Difference]: Start difference. First operand has 72 places, 68 transitions, 139 flow. Second operand 3 states and 147 transitions. [2024-11-19 09:38:01,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 183 flow [2024-11-19 09:38:01,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 64 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:38:01,034 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 138 flow [2024-11-19 09:38:01,037 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2024-11-19 09:38:01,041 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2024-11-19 09:38:01,044 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 138 flow [2024-11-19 09:38:01,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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,044 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:01,044 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-11-19 09:38:01,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:38:01,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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:01,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:01,046 INFO L85 PathProgramCache]: Analyzing trace with hash 12650, now seen corresponding path program 1 times [2024-11-19 09:38:01,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:01,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916422742] [2024-11-19 09:38:01,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:01,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:01,184 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,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:01,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916422742] [2024-11-19 09:38:01,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916422742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:01,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:01,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:38:01,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920354053] [2024-11-19 09:38:01,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:01,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:38:01,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:01,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:38:01,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:38:01,265 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 69 [2024-11-19 09:38:01,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:01,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 69 [2024-11-19 09:38:01,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:01,414 INFO L124 PetriNetUnfolderBase]: 63/256 cut-off events. [2024-11-19 09:38:01,414 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:38:01,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 256 events. 63/256 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1205 event pairs, 63 based on Foata normal form. 4/205 useless extension candidates. Maximal degree in co-relation 396. Up to 149 conditions per place. [2024-11-19 09:38:01,418 INFO L140 encePairwiseOnDemand]: 61/69 looper letters, 20 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2024-11-19 09:38:01,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 60 transitions, 178 flow [2024-11-19 09:38:01,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2024-11-19 09:38:01,421 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7294685990338164 [2024-11-19 09:38:01,421 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 138 flow. Second operand 3 states and 151 transitions. [2024-11-19 09:38:01,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 60 transitions, 178 flow [2024-11-19 09:38:01,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 60 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:38:01,425 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 130 flow [2024-11-19 09:38:01,425 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2024-11-19 09:38:01,426 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -7 predicate places. [2024-11-19 09:38:01,426 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 130 flow [2024-11-19 09:38:01,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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,427 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:01,428 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-19 09:38:01,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:38:01,429 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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:01,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:01,431 INFO L85 PathProgramCache]: Analyzing trace with hash 12166573, now seen corresponding path program 1 times [2024-11-19 09:38:01,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:01,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856556378] [2024-11-19 09:38:01,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:01,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:01,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:01,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:01,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856556378] [2024-11-19 09:38:01,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856556378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:01,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:01,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:38:01,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233461922] [2024-11-19 09:38:01,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:01,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:38:01,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:01,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:38:01,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:38:01,729 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 69 [2024-11-19 09:38:01,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 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,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:01,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 69 [2024-11-19 09:38:01,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:01,830 INFO L124 PetriNetUnfolderBase]: 72/274 cut-off events. [2024-11-19 09:38:01,830 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:38:01,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 274 events. 72/274 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1285 event pairs, 72 based on Foata normal form. 1/226 useless extension candidates. Maximal degree in co-relation 434. Up to 169 conditions per place. [2024-11-19 09:38:01,832 INFO L140 encePairwiseOnDemand]: 63/69 looper letters, 25 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2024-11-19 09:38:01,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 176 flow [2024-11-19 09:38:01,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:38:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:38:01,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2024-11-19 09:38:01,835 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6630434782608695 [2024-11-19 09:38:01,835 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 130 flow. Second operand 4 states and 183 transitions. [2024-11-19 09:38:01,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 176 flow [2024-11-19 09:38:01,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 56 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:38:01,837 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 118 flow [2024-11-19 09:38:01,837 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2024-11-19 09:38:01,838 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2024-11-19 09:38:01,838 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 118 flow [2024-11-19 09:38:01,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 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,838 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:01,839 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-19 09:38:01,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:38:01,839 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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:01,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:01,839 INFO L85 PathProgramCache]: Analyzing trace with hash 12166574, now seen corresponding path program 1 times [2024-11-19 09:38:01,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:01,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340395701] [2024-11-19 09:38:01,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:01,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:02,047 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:02,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:02,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340395701] [2024-11-19 09:38:02,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340395701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:02,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:02,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:38:02,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949264753] [2024-11-19 09:38:02,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:02,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:38:02,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:02,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:38:02,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:38:02,157 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 69 [2024-11-19 09:38:02,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 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,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:02,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 69 [2024-11-19 09:38:02,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:02,283 INFO L124 PetriNetUnfolderBase]: 69/291 cut-off events. [2024-11-19 09:38:02,284 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:38:02,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 291 events. 69/291 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1530 event pairs, 24 based on Foata normal form. 3/231 useless extension candidates. Maximal degree in co-relation 451. Up to 124 conditions per place. [2024-11-19 09:38:02,286 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 31 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2024-11-19 09:38:02,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 204 flow [2024-11-19 09:38:02,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:38:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:38:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 206 transitions. [2024-11-19 09:38:02,292 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7463768115942029 [2024-11-19 09:38:02,292 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 118 flow. Second operand 4 states and 206 transitions. [2024-11-19 09:38:02,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 204 flow [2024-11-19 09:38:02,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 64 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:38:02,296 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 132 flow [2024-11-19 09:38:02,297 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2024-11-19 09:38:02,298 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2024-11-19 09:38:02,298 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 132 flow [2024-11-19 09:38:02,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 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,299 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:02,299 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:02,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:38:02,299 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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:02,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:02,300 INFO L85 PathProgramCache]: Analyzing trace with hash 464111316, now seen corresponding path program 1 times [2024-11-19 09:38:02,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:02,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834557171] [2024-11-19 09:38:02,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:02,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:02,692 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:02,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:02,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834557171] [2024-11-19 09:38:02,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834557171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:02,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:02,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:38:02,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929528815] [2024-11-19 09:38:02,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:02,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:38:02,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:02,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:38:02,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:38:03,116 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 69 [2024-11-19 09:38:03,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 132 flow. Second operand has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:03,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:03,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 69 [2024-11-19 09:38:03,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:03,289 INFO L124 PetriNetUnfolderBase]: 63/241 cut-off events. [2024-11-19 09:38:03,289 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-19 09:38:03,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 241 events. 63/241 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1113 event pairs, 54 based on Foata normal form. 1/201 useless extension candidates. Maximal degree in co-relation 418. Up to 126 conditions per place. [2024-11-19 09:38:03,292 INFO L140 encePairwiseOnDemand]: 60/69 looper letters, 25 selfloop transitions, 8 changer transitions 3/62 dead transitions. [2024-11-19 09:38:03,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 216 flow [2024-11-19 09:38:03,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:38:03,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:38:03,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 268 transitions. [2024-11-19 09:38:03,294 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5548654244306418 [2024-11-19 09:38:03,294 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 132 flow. Second operand 7 states and 268 transitions. [2024-11-19 09:38:03,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 216 flow [2024-11-19 09:38:03,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 211 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:38:03,296 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 139 flow [2024-11-19 09:38:03,296 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=139, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-11-19 09:38:03,299 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2024-11-19 09:38:03,300 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 139 flow [2024-11-19 09:38:03,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:03,300 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:03,300 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:03,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:38:03,303 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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:03,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:03,303 INFO L85 PathProgramCache]: Analyzing trace with hash 464111315, now seen corresponding path program 1 times [2024-11-19 09:38:03,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:03,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676647198] [2024-11-19 09:38:03,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:03,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:03,554 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:03,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:03,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676647198] [2024-11-19 09:38:03,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676647198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:03,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:03,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:38:03,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343407627] [2024-11-19 09:38:03,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:03,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:38:03,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:03,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:38:03,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:38:03,873 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 69 [2024-11-19 09:38:03,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 139 flow. Second operand has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 7 states have internal predecessors, (260), 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,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:03,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 69 [2024-11-19 09:38:03,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:04,027 INFO L124 PetriNetUnfolderBase]: 63/239 cut-off events. [2024-11-19 09:38:04,028 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-19 09:38:04,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 239 events. 63/239 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1110 event pairs, 54 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 421. Up to 126 conditions per place. [2024-11-19 09:38:04,029 INFO L140 encePairwiseOnDemand]: 60/69 looper letters, 26 selfloop transitions, 8 changer transitions 3/60 dead transitions. [2024-11-19 09:38:04,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 60 transitions, 225 flow [2024-11-19 09:38:04,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:38:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:38:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 290 transitions. [2024-11-19 09:38:04,031 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6004140786749482 [2024-11-19 09:38:04,031 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 139 flow. Second operand 7 states and 290 transitions. [2024-11-19 09:38:04,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 60 transitions, 225 flow [2024-11-19 09:38:04,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 60 transitions, 209 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 09:38:04,034 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 135 flow [2024-11-19 09:38:04,034 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=135, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2024-11-19 09:38:04,035 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2024-11-19 09:38:04,035 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 135 flow [2024-11-19 09:38:04,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 7 states have internal predecessors, (260), 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,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:04,035 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:04,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:38:04,036 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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:04,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:04,036 INFO L85 PathProgramCache]: Analyzing trace with hash -665610695, now seen corresponding path program 1 times [2024-11-19 09:38:04,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:04,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695218097] [2024-11-19 09:38:04,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:04,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:04,225 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:04,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:04,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695218097] [2024-11-19 09:38:04,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695218097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:04,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:04,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:38:04,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891379533] [2024-11-19 09:38:04,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:04,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:38:04,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:04,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:38:04,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:38:04,351 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 69 [2024-11-19 09:38:04,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 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,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:04,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 69 [2024-11-19 09:38:04,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:04,455 INFO L124 PetriNetUnfolderBase]: 63/238 cut-off events. [2024-11-19 09:38:04,455 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-11-19 09:38:04,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 238 events. 63/238 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1095 event pairs, 62 based on Foata normal form. 1/200 useless extension candidates. Maximal degree in co-relation 418. Up to 146 conditions per place. [2024-11-19 09:38:04,457 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 20 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2024-11-19 09:38:04,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 51 transitions, 185 flow [2024-11-19 09:38:04,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:38:04,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:38:04,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2024-11-19 09:38:04,459 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2024-11-19 09:38:04,459 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 135 flow. Second operand 5 states and 225 transitions. [2024-11-19 09:38:04,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 51 transitions, 185 flow [2024-11-19 09:38:04,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 169 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 09:38:04,461 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 129 flow [2024-11-19 09:38:04,461 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2024-11-19 09:38:04,462 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2024-11-19 09:38:04,462 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 129 flow [2024-11-19 09:38:04,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 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,463 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:04,463 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:04,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:38:04,463 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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:04,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:04,464 INFO L85 PathProgramCache]: Analyzing trace with hash -665610696, now seen corresponding path program 1 times [2024-11-19 09:38:04,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:04,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075859878] [2024-11-19 09:38:04,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:04,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:04,577 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:04,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:04,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075859878] [2024-11-19 09:38:04,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075859878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:04,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:04,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:38:04,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441923330] [2024-11-19 09:38:04,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:04,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:38:04,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:04,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:38:04,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:38:04,681 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 69 [2024-11-19 09:38:04,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 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,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:04,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 69 [2024-11-19 09:38:04,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:04,774 INFO L124 PetriNetUnfolderBase]: 63/237 cut-off events. [2024-11-19 09:38:04,774 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-19 09:38:04,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 237 events. 63/237 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1106 event pairs, 62 based on Foata normal form. 1/199 useless extension candidates. Maximal degree in co-relation 408. Up to 146 conditions per place. [2024-11-19 09:38:04,775 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 22 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2024-11-19 09:38:04,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 50 transitions, 183 flow [2024-11-19 09:38:04,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:38:04,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:38:04,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 217 transitions. [2024-11-19 09:38:04,778 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6289855072463768 [2024-11-19 09:38:04,778 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 129 flow. Second operand 5 states and 217 transitions. [2024-11-19 09:38:04,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 50 transitions, 183 flow [2024-11-19 09:38:04,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 171 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:38:04,780 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 127 flow [2024-11-19 09:38:04,780 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2024-11-19 09:38:04,781 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -14 predicate places. [2024-11-19 09:38:04,781 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 127 flow [2024-11-19 09:38:04,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 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,781 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:04,781 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:04,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 09:38:04,781 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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:04,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:04,782 INFO L85 PathProgramCache]: Analyzing trace with hash -705953288, now seen corresponding path program 1 times [2024-11-19 09:38:04,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:04,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103354464] [2024-11-19 09:38:04,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:04,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:04,882 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:04,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:04,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103354464] [2024-11-19 09:38:04,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103354464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:04,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:04,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:38:04,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902001518] [2024-11-19 09:38:04,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:04,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:38:04,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:04,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:38:04,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:38:04,926 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 69 [2024-11-19 09:38:04,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:04,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 69 [2024-11-19 09:38:04,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:05,006 INFO L124 PetriNetUnfolderBase]: 70/253 cut-off events. [2024-11-19 09:38:05,006 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-19 09:38:05,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 253 events. 70/253 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1172 event pairs, 51 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 439. Up to 136 conditions per place. [2024-11-19 09:38:05,008 INFO L140 encePairwiseOnDemand]: 65/69 looper letters, 31 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2024-11-19 09:38:05,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 207 flow [2024-11-19 09:38:05,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:05,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:05,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2024-11-19 09:38:05,009 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7729468599033816 [2024-11-19 09:38:05,009 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 127 flow. Second operand 3 states and 160 transitions. [2024-11-19 09:38:05,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 207 flow [2024-11-19 09:38:05,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 55 transitions, 195 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:38:05,011 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 117 flow [2024-11-19 09:38:05,011 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2024-11-19 09:38:05,012 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -18 predicate places. [2024-11-19 09:38:05,013 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 117 flow [2024-11-19 09:38:05,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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,013 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:05,013 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:05,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:38:05,013 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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:05,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:05,015 INFO L85 PathProgramCache]: Analyzing trace with hash -705953287, now seen corresponding path program 1 times [2024-11-19 09:38:05,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:05,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377190501] [2024-11-19 09:38:05,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:05,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:05,118 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:05,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:05,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377190501] [2024-11-19 09:38:05,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377190501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:05,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:05,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:38:05,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191166436] [2024-11-19 09:38:05,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:05,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:38:05,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:05,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:38:05,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:38:05,167 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 69 [2024-11-19 09:38:05,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:05,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 69 [2024-11-19 09:38:05,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:05,266 INFO L124 PetriNetUnfolderBase]: 63/231 cut-off events. [2024-11-19 09:38:05,266 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-19 09:38:05,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 231 events. 63/231 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1031 event pairs, 50 based on Foata normal form. 16/217 useless extension candidates. Maximal degree in co-relation 413. Up to 136 conditions per place. [2024-11-19 09:38:05,268 INFO L140 encePairwiseOnDemand]: 65/69 looper letters, 30 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2024-11-19 09:38:05,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 195 flow [2024-11-19 09:38:05,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:05,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2024-11-19 09:38:05,269 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.782608695652174 [2024-11-19 09:38:05,269 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 117 flow. Second operand 3 states and 162 transitions. [2024-11-19 09:38:05,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 195 flow [2024-11-19 09:38:05,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:38:05,271 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 113 flow [2024-11-19 09:38:05,271 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2024-11-19 09:38:05,271 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -20 predicate places. [2024-11-19 09:38:05,272 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 113 flow [2024-11-19 09:38:05,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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,272 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:05,272 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:05,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:38:05,273 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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:05,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:05,273 INFO L85 PathProgramCache]: Analyzing trace with hash -464357448, now seen corresponding path program 1 times [2024-11-19 09:38:05,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:05,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646932808] [2024-11-19 09:38:05,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:05,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:05,542 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:05,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:05,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646932808] [2024-11-19 09:38:05,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646932808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:05,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:05,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 09:38:05,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029718474] [2024-11-19 09:38:05,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:05,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:38:05,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:05,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:38:05,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:38:05,866 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 69 [2024-11-19 09:38:05,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 113 flow. Second operand has 9 states, 9 states have (on average 41.44444444444444) internal successors, (373), 9 states have internal predecessors, (373), 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,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:05,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 69 [2024-11-19 09:38:05,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:06,084 INFO L124 PetriNetUnfolderBase]: 72/241 cut-off events. [2024-11-19 09:38:06,084 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-11-19 09:38:06,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 241 events. 72/241 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1042 event pairs, 54 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 446. Up to 125 conditions per place. [2024-11-19 09:38:06,086 INFO L140 encePairwiseOnDemand]: 58/69 looper letters, 31 selfloop transitions, 11 changer transitions 3/62 dead transitions. [2024-11-19 09:38:06,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 243 flow [2024-11-19 09:38:06,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:38:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:38:06,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 405 transitions. [2024-11-19 09:38:06,088 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2024-11-19 09:38:06,088 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 113 flow. Second operand 9 states and 405 transitions. [2024-11-19 09:38:06,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 243 flow [2024-11-19 09:38:06,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 62 transitions, 231 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:38:06,091 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 127 flow [2024-11-19 09:38:06,091 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=127, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2024-11-19 09:38:06,092 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -15 predicate places. [2024-11-19 09:38:06,092 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 127 flow [2024-11-19 09:38:06,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 41.44444444444444) internal successors, (373), 9 states have internal predecessors, (373), 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,093 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:06,093 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:06,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 09:38:06,093 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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:06,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:06,094 INFO L85 PathProgramCache]: Analyzing trace with hash -464357449, now seen corresponding path program 1 times [2024-11-19 09:38:06,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:06,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010829804] [2024-11-19 09:38:06,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:06,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:06,199 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:06,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:06,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010829804] [2024-11-19 09:38:06,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010829804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:06,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:06,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:38:06,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43829677] [2024-11-19 09:38:06,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:06,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:38:06,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:06,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:38:06,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:38:06,352 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 69 [2024-11-19 09:38:06,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 127 flow. Second operand has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 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,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:06,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 69 [2024-11-19 09:38:06,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:06,475 INFO L124 PetriNetUnfolderBase]: 72/231 cut-off events. [2024-11-19 09:38:06,475 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-19 09:38:06,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 231 events. 72/231 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 963 event pairs, 54 based on Foata normal form. 10/217 useless extension candidates. Maximal degree in co-relation 453. Up to 125 conditions per place. [2024-11-19 09:38:06,477 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 35 selfloop transitions, 7 changer transitions 3/61 dead transitions. [2024-11-19 09:38:06,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 61 transitions, 251 flow [2024-11-19 09:38:06,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:38:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:38:06,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 285 transitions. [2024-11-19 09:38:06,479 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6884057971014492 [2024-11-19 09:38:06,479 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 127 flow. Second operand 6 states and 285 transitions. [2024-11-19 09:38:06,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 61 transitions, 251 flow [2024-11-19 09:38:06,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 229 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-19 09:38:06,480 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 117 flow [2024-11-19 09:38:06,481 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=117, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2024-11-19 09:38:06,482 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -19 predicate places. [2024-11-19 09:38:06,483 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 117 flow [2024-11-19 09:38:06,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 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,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:06,483 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:06,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 09:38:06,484 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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:06,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:06,484 INFO L85 PathProgramCache]: Analyzing trace with hash 183735321, now seen corresponding path program 1 times [2024-11-19 09:38:06,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:06,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653165597] [2024-11-19 09:38:06,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:06,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:06,819 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:06,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:06,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653165597] [2024-11-19 09:38:06,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653165597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:06,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:06,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:38:06,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113697405] [2024-11-19 09:38:06,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:06,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:38:06,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:06,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:38:06,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:38:07,079 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 69 [2024-11-19 09:38:07,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 117 flow. Second operand has 7 states, 7 states have (on average 38.857142857142854) internal successors, (272), 7 states have internal predecessors, (272), 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,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:07,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 69 [2024-11-19 09:38:07,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:07,213 INFO L124 PetriNetUnfolderBase]: 72/244 cut-off events. [2024-11-19 09:38:07,214 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-11-19 09:38:07,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 244 events. 72/244 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1070 event pairs, 36 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 463. Up to 136 conditions per place. [2024-11-19 09:38:07,215 INFO L140 encePairwiseOnDemand]: 64/69 looper letters, 38 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2024-11-19 09:38:07,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 249 flow [2024-11-19 09:38:07,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:38:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:38:07,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2024-11-19 09:38:07,217 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6579710144927536 [2024-11-19 09:38:07,217 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 117 flow. Second operand 5 states and 227 transitions. [2024-11-19 09:38:07,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 249 flow [2024-11-19 09:38:07,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 59 transitions, 223 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 09:38:07,218 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 111 flow [2024-11-19 09:38:07,219 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2024-11-19 09:38:07,219 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -21 predicate places. [2024-11-19 09:38:07,219 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 111 flow [2024-11-19 09:38:07,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.857142857142854) internal successors, (272), 7 states have internal predecessors, (272), 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,219 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:07,220 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:07,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 09:38:07,220 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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:07,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:07,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1510178621, now seen corresponding path program 1 times [2024-11-19 09:38:07,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:07,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033576604] [2024-11-19 09:38:07,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:07,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:08,003 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:08,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:08,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033576604] [2024-11-19 09:38:08,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033576604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:08,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:08,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 09:38:08,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046151541] [2024-11-19 09:38:08,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:08,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 09:38:08,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:08,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 09:38:08,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:38:08,832 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 69 [2024-11-19 09:38:08,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 111 flow. Second operand has 12 states, 12 states have (on average 30.333333333333332) internal successors, (364), 12 states have internal predecessors, (364), 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,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:08,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 69 [2024-11-19 09:38:08,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:09,241 INFO L124 PetriNetUnfolderBase]: 123/352 cut-off events. [2024-11-19 09:38:09,242 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2024-11-19 09:38:09,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 352 events. 123/352 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1589 event pairs, 55 based on Foata normal form. 0/320 useless extension candidates. Maximal degree in co-relation 691. Up to 163 conditions per place. [2024-11-19 09:38:09,244 INFO L140 encePairwiseOnDemand]: 57/69 looper letters, 48 selfloop transitions, 15 changer transitions 0/73 dead transitions. [2024-11-19 09:38:09,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 317 flow [2024-11-19 09:38:09,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:38:09,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:38:09,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 383 transitions. [2024-11-19 09:38:09,246 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5046113306982872 [2024-11-19 09:38:09,246 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 111 flow. Second operand 11 states and 383 transitions. [2024-11-19 09:38:09,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 317 flow [2024-11-19 09:38:09,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 295 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:38:09,248 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 173 flow [2024-11-19 09:38:09,248 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=173, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2024-11-19 09:38:09,249 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2024-11-19 09:38:09,249 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 173 flow [2024-11-19 09:38:09,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 30.333333333333332) internal successors, (364), 12 states have internal predecessors, (364), 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,250 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:09,250 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:09,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 09:38:09,250 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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:09,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:09,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1510178622, now seen corresponding path program 1 times [2024-11-19 09:38:09,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:09,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132861079] [2024-11-19 09:38:09,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:09,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:09,903 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:09,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:09,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132861079] [2024-11-19 09:38:09,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132861079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:09,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:09,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 09:38:09,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845502722] [2024-11-19 09:38:09,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:09,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:38:09,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:09,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:38:09,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:38:10,675 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 69 [2024-11-19 09:38:10,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 173 flow. Second operand has 13 states, 13 states have (on average 34.23076923076923) internal successors, (445), 13 states have internal predecessors, (445), 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,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:10,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 69 [2024-11-19 09:38:10,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:11,047 INFO L124 PetriNetUnfolderBase]: 123/348 cut-off events. [2024-11-19 09:38:11,047 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-11-19 09:38:11,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 348 events. 123/348 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1571 event pairs, 34 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 751. Up to 118 conditions per place. [2024-11-19 09:38:11,049 INFO L140 encePairwiseOnDemand]: 56/69 looper letters, 44 selfloop transitions, 17 changer transitions 0/71 dead transitions. [2024-11-19 09:38:11,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 71 transitions, 341 flow [2024-11-19 09:38:11,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:38:11,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:38:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 424 transitions. [2024-11-19 09:38:11,051 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5586297760210803 [2024-11-19 09:38:11,051 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 173 flow. Second operand 11 states and 424 transitions. [2024-11-19 09:38:11,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 71 transitions, 341 flow [2024-11-19 09:38:11,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 71 transitions, 327 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-19 09:38:11,054 INFO L231 Difference]: Finished difference. Result has 69 places, 51 transitions, 217 flow [2024-11-19 09:38:11,054 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=217, PETRI_PLACES=69, PETRI_TRANSITIONS=51} [2024-11-19 09:38:11,055 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2024-11-19 09:38:11,055 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 51 transitions, 217 flow [2024-11-19 09:38:11,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 34.23076923076923) internal successors, (445), 13 states have internal predecessors, (445), 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,055 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:11,056 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:11,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 09:38:11,056 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:11,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:11,056 INFO L85 PathProgramCache]: Analyzing trace with hash -262651708, now seen corresponding path program 1 times [2024-11-19 09:38:11,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:11,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065348668] [2024-11-19 09:38:11,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:11,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:11,133 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:11,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:11,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065348668] [2024-11-19 09:38:11,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065348668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:11,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:11,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:38:11,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683291624] [2024-11-19 09:38:11,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:11,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:38:11,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:11,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:38:11,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:38:11,135 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 69 [2024-11-19 09:38:11,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 51 transitions, 217 flow. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:11,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 69 [2024-11-19 09:38:11,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:11,199 INFO L124 PetriNetUnfolderBase]: 39/166 cut-off events. [2024-11-19 09:38:11,199 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2024-11-19 09:38:11,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 166 events. 39/166 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 591 event pairs, 15 based on Foata normal form. 9/159 useless extension candidates. Maximal degree in co-relation 389. Up to 67 conditions per place. [2024-11-19 09:38:11,201 INFO L140 encePairwiseOnDemand]: 65/69 looper letters, 30 selfloop transitions, 4 changer transitions 2/56 dead transitions. [2024-11-19 09:38:11,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 56 transitions, 309 flow [2024-11-19 09:38:11,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:11,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:11,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2024-11-19 09:38:11,202 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8019323671497585 [2024-11-19 09:38:11,202 INFO L175 Difference]: Start difference. First operand has 69 places, 51 transitions, 217 flow. Second operand 3 states and 166 transitions. [2024-11-19 09:38:11,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 56 transitions, 309 flow [2024-11-19 09:38:11,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 56 transitions, 273 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-11-19 09:38:11,206 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 177 flow [2024-11-19 09:38:11,206 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2024-11-19 09:38:11,207 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2024-11-19 09:38:11,209 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 177 flow [2024-11-19 09:38:11,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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,209 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:11,209 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:11,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 09:38:11,209 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-19 09:38:11,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:11,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1400828105, now seen corresponding path program 1 times [2024-11-19 09:38:11,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:11,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191102127] [2024-11-19 09:38:11,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:11,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:38:11,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:38:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:38:11,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 09:38:11,331 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:38:11,332 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 50 remaining) [2024-11-19 09:38:11,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2024-11-19 09:38:11,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2024-11-19 09:38:11,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2024-11-19 09:38:11,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2024-11-19 09:38:11,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2024-11-19 09:38:11,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2024-11-19 09:38:11,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2024-11-19 09:38:11,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2024-11-19 09:38:11,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2024-11-19 09:38:11,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2024-11-19 09:38:11,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2024-11-19 09:38:11,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2024-11-19 09:38:11,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2024-11-19 09:38:11,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2024-11-19 09:38:11,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2024-11-19 09:38:11,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2024-11-19 09:38:11,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2024-11-19 09:38:11,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2024-11-19 09:38:11,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2024-11-19 09:38:11,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2024-11-19 09:38:11,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2024-11-19 09:38:11,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2024-11-19 09:38:11,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2024-11-19 09:38:11,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2024-11-19 09:38:11,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (24 of 50 remaining) [2024-11-19 09:38:11,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 50 remaining) [2024-11-19 09:38:11,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2024-11-19 09:38:11,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2024-11-19 09:38:11,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2024-11-19 09:38:11,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2024-11-19 09:38:11,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2024-11-19 09:38:11,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2024-11-19 09:38:11,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2024-11-19 09:38:11,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2024-11-19 09:38:11,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2024-11-19 09:38:11,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2024-11-19 09:38:11,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2024-11-19 09:38:11,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2024-11-19 09:38:11,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2024-11-19 09:38:11,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2024-11-19 09:38:11,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2024-11-19 09:38:11,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2024-11-19 09:38:11,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2024-11-19 09:38:11,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2024-11-19 09:38:11,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2024-11-19 09:38:11,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2024-11-19 09:38:11,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2024-11-19 09:38:11,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2024-11-19 09:38:11,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 50 remaining) [2024-11-19 09:38:11,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 09:38:11,343 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:11,381 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:38:11,381 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:38:11,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:38:11 BasicIcfg [2024-11-19 09:38:11,385 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:38:11,386 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:38:11,386 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:38:11,386 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:38:11,386 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:00" (3/4) ... [2024-11-19 09:38:11,387 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 09:38:11,443 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 09:38:11,443 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:38:11,443 INFO L158 Benchmark]: Toolchain (without parser) took 13178.08ms. Allocated memory was 140.5MB in the beginning and 339.7MB in the end (delta: 199.2MB). Free memory was 84.1MB in the beginning and 198.8MB in the end (delta: -114.7MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. [2024-11-19 09:38:11,444 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 140.5MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:38:11,444 INFO L158 Benchmark]: CACSL2BoogieTranslator took 803.51ms. Allocated memory is still 140.5MB. Free memory was 83.7MB in the beginning and 91.7MB in the end (delta: -8.0MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2024-11-19 09:38:11,444 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.44ms. Allocated memory is still 140.5MB. Free memory was 91.7MB in the beginning and 88.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:38:11,444 INFO L158 Benchmark]: Boogie Preprocessor took 89.56ms. Allocated memory is still 140.5MB. Free memory was 88.1MB in the beginning and 84.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:38:11,444 INFO L158 Benchmark]: RCFGBuilder took 906.89ms. Allocated memory was 140.5MB in the beginning and 195.0MB in the end (delta: 54.5MB). Free memory was 84.8MB in the beginning and 139.8MB in the end (delta: -55.1MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. [2024-11-19 09:38:11,445 INFO L158 Benchmark]: TraceAbstraction took 11236.36ms. Allocated memory was 195.0MB in the beginning and 339.7MB in the end (delta: 144.7MB). Free memory was 138.8MB in the beginning and 203.0MB in the end (delta: -64.2MB). Peak memory consumption was 80.5MB. Max. memory is 16.1GB. [2024-11-19 09:38:11,445 INFO L158 Benchmark]: Witness Printer took 57.50ms. Allocated memory is still 339.7MB. Free memory was 203.0MB in the beginning and 198.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:38:11,447 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.21ms. Allocated memory is still 140.5MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 803.51ms. Allocated memory is still 140.5MB. Free memory was 83.7MB in the beginning and 91.7MB in the end (delta: -8.0MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.44ms. Allocated memory is still 140.5MB. Free memory was 91.7MB in the beginning and 88.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.56ms. Allocated memory is still 140.5MB. Free memory was 88.1MB in the beginning and 84.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 906.89ms. Allocated memory was 140.5MB in the beginning and 195.0MB in the end (delta: 54.5MB). Free memory was 84.8MB in the beginning and 139.8MB in the end (delta: -55.1MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11236.36ms. Allocated memory was 195.0MB in the beginning and 339.7MB in the end (delta: 144.7MB). Free memory was 138.8MB in the beginning and 203.0MB in the end (delta: -64.2MB). Peak memory consumption was 80.5MB. Max. memory is 16.1GB. * Witness Printer took 57.50ms. Allocated memory is still 339.7MB. Free memory was 203.0MB in the beginning and 198.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [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 j = __VERIFIER_nondet_int(); [L1255] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1255] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1256] 0 pthread_t t1; [L1257] 0 struct s *p; [L1258] 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; [L1258] RET, EXPR 0 new(1) [L1258] 0 slot[j] = new(1) [L1259] 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; [L1259] RET, EXPR 0 new(2) [L1259] EXPR 0 slot[j] [L1259] 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 [L1259] RET 0 list_add(new(2), slot[j]) [L1260] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [j=9, 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: 1260]: 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, 95 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: 11.1s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3009 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2162 mSDsluCounter, 1266 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1191 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8442 IncrementalHoareTripleChecker+Invalid, 8562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 75 mSDtfsCounter, 8442 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=15, InterpolantAutomatonStates: 89, 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.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 163 ConstructedInterpolants, 0 QuantifiedInterpolants, 1928 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 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:11,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)