./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr-deref.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 12bbf3623faa1d8cb0ae406b9406d293839854c20d2fb62622ec841c419248fb --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:39:57,180 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:39:57,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:39:57,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:39:57,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:39:57,294 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:39:57,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:39:57,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:39:57,296 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:39:57,297 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:39:57,297 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:39:57,297 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:39:57,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:39:57,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:39:57,301 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:39:57,301 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:39:57,301 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:39:57,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:39:57,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:39:57,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:39:57,302 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:39:57,306 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:39:57,306 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:39:57,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:39:57,307 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:39:57,307 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:39:57,307 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:39:57,307 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:39:57,308 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:39:57,308 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:39:57,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:39:57,308 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:39:57,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:39:57,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:39:57,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:39:57,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:39:57,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:39:57,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:39:57,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:39:57,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:39:57,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:39:57,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:39:57,314 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 -> 12bbf3623faa1d8cb0ae406b9406d293839854c20d2fb62622ec841c419248fb [2024-11-09 10:39:57,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:39:57,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:39:57,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:39:57,630 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:39:57,631 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:39:57,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr-deref.i [2024-11-09 10:39:59,103 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:39:59,392 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:39:59,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr-deref.i [2024-11-09 10:39:59,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac90ea87/837a8187efd344aab3bfef85a17a1741/FLAG039d163f1 [2024-11-09 10:39:59,667 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac90ea87/837a8187efd344aab3bfef85a17a1741 [2024-11-09 10:39:59,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:39:59,671 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:39:59,672 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:39:59,672 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:39:59,678 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:39:59,679 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:39:59" (1/1) ... [2024-11-09 10:39:59,680 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77bed380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:39:59, skipping insertion in model container [2024-11-09 10:39:59,680 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:39:59" (1/1) ... [2024-11-09 10:39:59,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:40:00,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:40:00,312 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:40:00,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:40:00,431 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:40:00,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:00 WrapperNode [2024-11-09 10:40:00,431 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:40:00,432 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:40:00,432 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:40:00,433 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:40:00,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:00" (1/1) ... [2024-11-09 10:40:00,457 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:00" (1/1) ... [2024-11-09 10:40:00,491 INFO L138 Inliner]: procedures = 372, calls = 87, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 177 [2024-11-09 10:40:00,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:40:00,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:40:00,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:40:00,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:40:00,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:00" (1/1) ... [2024-11-09 10:40:00,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:00" (1/1) ... [2024-11-09 10:40:00,517 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:00" (1/1) ... [2024-11-09 10:40:00,542 INFO L175 MemorySlicer]: Split 78 memory accesses to 2 slices as follows [64, 14]. 82 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [60, 0]. The 11 writes are split as follows [1, 10]. [2024-11-09 10:40:00,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:00" (1/1) ... [2024-11-09 10:40:00,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:00" (1/1) ... [2024-11-09 10:40:00,555 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:00" (1/1) ... [2024-11-09 10:40:00,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:00" (1/1) ... [2024-11-09 10:40:00,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:00" (1/1) ... [2024-11-09 10:40:00,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:00" (1/1) ... [2024-11-09 10:40:00,570 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:40:00,571 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:40:00,571 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:40:00,571 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:40:00,572 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:00" (1/1) ... [2024-11-09 10:40:00,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:40:00,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:40:00,618 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:40:00,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:40:00,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:40:00,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:40:00,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 10:40:00,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 10:40:00,704 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:40:00,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:40:00,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:40:00,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:40:00,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:40:00,705 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:40:00,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:40:00,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:40:00,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:40:00,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:40:00,707 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 10:40:00,707 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 10:40:00,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:40:00,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:40:00,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:40:00,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:40:00,709 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:40:00,938 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:40:00,940 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:40:01,411 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:40:01,414 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:40:01,960 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:40:01,961 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 10:40:01,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:40:01 BoogieIcfgContainer [2024-11-09 10:40:01,962 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:40:01,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:40:01,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:40:01,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:40:01,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:39:59" (1/3) ... [2024-11-09 10:40:01,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1523acad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:40:01, skipping insertion in model container [2024-11-09 10:40:01,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:40:00" (2/3) ... [2024-11-09 10:40:01,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1523acad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:40:01, skipping insertion in model container [2024-11-09 10:40:01,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:40:01" (3/3) ... [2024-11-09 10:40:01,972 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_19-nested_nr-deref.i [2024-11-09 10:40:01,989 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:40:01,989 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-11-09 10:40:01,989 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:40:02,054 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:40:02,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 71 transitions, 146 flow [2024-11-09 10:40:02,139 INFO L124 PetriNetUnfolderBase]: 1/70 cut-off events. [2024-11-09 10:40:02,140 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:40:02,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 70 events. 1/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 163 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2024-11-09 10:40:02,143 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 71 transitions, 146 flow [2024-11-09 10:40:02,147 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 70 transitions, 143 flow [2024-11-09 10:40:02,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:40:02,165 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;@319bd7b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:40:02,166 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-09 10:40:02,171 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:40:02,171 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-09 10:40:02,171 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:40:02,171 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:02,172 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:40:02,173 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-09 10:40:02,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:02,178 INFO L85 PathProgramCache]: Analyzing trace with hash 500310, now seen corresponding path program 1 times [2024-11-09 10:40:02,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:40:02,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797360778] [2024-11-09 10:40:02,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:02,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:40:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:02,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:40:02,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797360778] [2024-11-09 10:40:02,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797360778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:02,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:02,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:40:02,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176230074] [2024-11-09 10:40:02,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:02,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:40:02,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:40:02,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:40:02,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:40:02,623 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2024-11-09 10:40:02,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:02,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:02,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2024-11-09 10:40:02,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:02,802 INFO L124 PetriNetUnfolderBase]: 64/267 cut-off events. [2024-11-09 10:40:02,802 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:40:02,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 267 events. 64/267 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1227 event pairs, 63 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 377. Up to 153 conditions per place. [2024-11-09 10:40:02,810 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 25 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-11-09 10:40:02,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 71 transitions, 199 flow [2024-11-09 10:40:02,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:40:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:40:02,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2024-11-09 10:40:02,826 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7652582159624414 [2024-11-09 10:40:02,828 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 143 flow. Second operand 3 states and 163 transitions. [2024-11-09 10:40:02,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 71 transitions, 199 flow [2024-11-09 10:40:02,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 71 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:40:02,838 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 154 flow [2024-11-09 10:40:02,840 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2024-11-09 10:40:02,844 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 2 predicate places. [2024-11-09 10:40:02,846 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 154 flow [2024-11-09 10:40:02,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:02,847 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:02,847 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-09 10:40:02,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:40:02,848 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 10:40:02,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:02,849 INFO L85 PathProgramCache]: Analyzing trace with hash 15509208, now seen corresponding path program 1 times [2024-11-09 10:40:02,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:40:02,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396914705] [2024-11-09 10:40:02,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:02,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:40:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:02,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:02,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:40:02,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396914705] [2024-11-09 10:40:02,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396914705] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:40:02,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976818558] [2024-11-09 10:40:02,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:02,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:40:02,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:40:02,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:40:02,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 10:40:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:03,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:40:03,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:03,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:03,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:40:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:03,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976818558] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:40:03,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:40:03,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-09 10:40:03,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259651641] [2024-11-09 10:40:03,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:40:03,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:40:03,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:40:03,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:40:03,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:40:03,169 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2024-11-09 10:40:03,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:03,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:03,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2024-11-09 10:40:03,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:03,312 INFO L124 PetriNetUnfolderBase]: 64/270 cut-off events. [2024-11-09 10:40:03,313 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:40:03,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 270 events. 64/270 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1227 event pairs, 63 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 429. Up to 153 conditions per place. [2024-11-09 10:40:03,316 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 25 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2024-11-09 10:40:03,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 226 flow [2024-11-09 10:40:03,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:40:03,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:40:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 303 transitions. [2024-11-09 10:40:03,320 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7112676056338029 [2024-11-09 10:40:03,320 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 154 flow. Second operand 6 states and 303 transitions. [2024-11-09 10:40:03,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 226 flow [2024-11-09 10:40:03,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 74 transitions, 222 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-09 10:40:03,322 INFO L231 Difference]: Finished difference. Result has 82 places, 74 transitions, 186 flow [2024-11-09 10:40:03,323 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=82, PETRI_TRANSITIONS=74} [2024-11-09 10:40:03,323 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 9 predicate places. [2024-11-09 10:40:03,324 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 186 flow [2024-11-09 10:40:03,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:03,324 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:03,324 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2024-11-09 10:40:03,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 10:40:03,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:40:03,526 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 10:40:03,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:03,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1822051626, now seen corresponding path program 2 times [2024-11-09 10:40:03,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:40:03,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809224729] [2024-11-09 10:40:03,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:03,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:40:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:03,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 10:40:03,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:40:03,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809224729] [2024-11-09 10:40:03,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809224729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:03,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:03,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:40:03,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129487904] [2024-11-09 10:40:03,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:03,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:40:03,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:40:03,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:40:03,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:40:03,699 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 71 [2024-11-09 10:40:03,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 74 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:03,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:03,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 71 [2024-11-09 10:40:03,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:03,794 INFO L124 PetriNetUnfolderBase]: 64/266 cut-off events. [2024-11-09 10:40:03,794 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:40:03,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 266 events. 64/266 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1200 event pairs, 63 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 418. Up to 155 conditions per place. [2024-11-09 10:40:03,797 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 28 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2024-11-09 10:40:03,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 70 transitions, 242 flow [2024-11-09 10:40:03,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:40:03,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:40:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2024-11-09 10:40:03,799 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6995305164319249 [2024-11-09 10:40:03,799 INFO L175 Difference]: Start difference. First operand has 82 places, 74 transitions, 186 flow. Second operand 3 states and 149 transitions. [2024-11-09 10:40:03,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 70 transitions, 242 flow [2024-11-09 10:40:03,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 70 transitions, 228 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-09 10:40:03,802 INFO L231 Difference]: Finished difference. Result has 79 places, 70 transitions, 172 flow [2024-11-09 10:40:03,802 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=79, PETRI_TRANSITIONS=70} [2024-11-09 10:40:03,805 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 6 predicate places. [2024-11-09 10:40:03,805 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 70 transitions, 172 flow [2024-11-09 10:40:03,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:03,806 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:03,806 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2024-11-09 10:40:03,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:40:03,807 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 10:40:03,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:03,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1822051625, now seen corresponding path program 1 times [2024-11-09 10:40:03,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:40:03,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259787913] [2024-11-09 10:40:03,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:03,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:40:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:03,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:03,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:40:03,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259787913] [2024-11-09 10:40:03,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259787913] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:40:03,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812451499] [2024-11-09 10:40:03,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:03,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:40:03,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:40:03,934 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:40:03,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 10:40:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:04,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:40:04,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:40:04,055 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:04,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:40:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:40:04,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812451499] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:40:04,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:40:04,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-09 10:40:04,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31774387] [2024-11-09 10:40:04,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:40:04,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:40:04,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:40:04,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:40:04,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:40:04,119 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2024-11-09 10:40:04,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 70 transitions, 172 flow. Second operand has 13 states, 13 states have (on average 46.07692307692308) internal successors, (599), 13 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:04,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:04,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2024-11-09 10:40:04,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:04,271 INFO L124 PetriNetUnfolderBase]: 64/272 cut-off events. [2024-11-09 10:40:04,271 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-09 10:40:04,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 272 events. 64/272 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1196 event pairs, 63 based on Foata normal form. 6/221 useless extension candidates. Maximal degree in co-relation 420. Up to 153 conditions per place. [2024-11-09 10:40:04,273 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 25 selfloop transitions, 11 changer transitions 0/76 dead transitions. [2024-11-09 10:40:04,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 76 transitions, 280 flow [2024-11-09 10:40:04,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:40:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 10:40:04,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 582 transitions. [2024-11-09 10:40:04,278 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6830985915492958 [2024-11-09 10:40:04,278 INFO L175 Difference]: Start difference. First operand has 79 places, 70 transitions, 172 flow. Second operand 12 states and 582 transitions. [2024-11-09 10:40:04,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 76 transitions, 280 flow [2024-11-09 10:40:04,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 76 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:40:04,281 INFO L231 Difference]: Finished difference. Result has 94 places, 76 transitions, 248 flow [2024-11-09 10:40:04,281 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=248, PETRI_PLACES=94, PETRI_TRANSITIONS=76} [2024-11-09 10:40:04,282 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 21 predicate places. [2024-11-09 10:40:04,282 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 76 transitions, 248 flow [2024-11-09 10:40:04,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.07692307692308) internal successors, (599), 13 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:04,283 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:04,283 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2024-11-09 10:40:04,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 10:40:04,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 10:40:04,484 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 10:40:04,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:04,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1014223767, now seen corresponding path program 2 times [2024-11-09 10:40:04,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:40:04,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746547158] [2024-11-09 10:40:04,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:04,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:40:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:04,590 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 10:40:04,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:40:04,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746547158] [2024-11-09 10:40:04,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746547158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:04,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:04,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:40:04,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698220776] [2024-11-09 10:40:04,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:04,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:40:04,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:40:04,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:40:04,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:40:04,647 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 71 [2024-11-09 10:40:04,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 76 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:04,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:04,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 71 [2024-11-09 10:40:04,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:04,750 INFO L124 PetriNetUnfolderBase]: 64/268 cut-off events. [2024-11-09 10:40:04,750 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-09 10:40:04,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 268 events. 64/268 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1194 event pairs, 63 based on Foata normal form. 2/215 useless extension candidates. Maximal degree in co-relation 418. Up to 161 conditions per place. [2024-11-09 10:40:04,752 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 32 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2024-11-09 10:40:04,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 72 transitions, 312 flow [2024-11-09 10:40:04,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:40:04,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:40:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2024-11-09 10:40:04,753 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7183098591549296 [2024-11-09 10:40:04,754 INFO L175 Difference]: Start difference. First operand has 94 places, 76 transitions, 248 flow. Second operand 3 states and 153 transitions. [2024-11-09 10:40:04,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 72 transitions, 312 flow [2024-11-09 10:40:04,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 72 transitions, 264 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-11-09 10:40:04,758 INFO L231 Difference]: Finished difference. Result has 87 places, 72 transitions, 200 flow [2024-11-09 10:40:04,758 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=87, PETRI_TRANSITIONS=72} [2024-11-09 10:40:04,759 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 14 predicate places. [2024-11-09 10:40:04,759 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 72 transitions, 200 flow [2024-11-09 10:40:04,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:04,759 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:04,760 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2024-11-09 10:40:04,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:40:04,760 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 10:40:04,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:04,761 INFO L85 PathProgramCache]: Analyzing trace with hash -288522692, now seen corresponding path program 1 times [2024-11-09 10:40:04,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:40:04,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829547901] [2024-11-09 10:40:04,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:04,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:40:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 10:40:04,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:40:04,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829547901] [2024-11-09 10:40:04,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829547901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:04,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:04,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:40:04,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833070895] [2024-11-09 10:40:04,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:04,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:40:04,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:40:04,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:40:04,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:40:05,142 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2024-11-09 10:40:05,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 72 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:05,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:05,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2024-11-09 10:40:05,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:05,232 INFO L124 PetriNetUnfolderBase]: 73/286 cut-off events. [2024-11-09 10:40:05,232 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-11-09 10:40:05,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 286 events. 73/286 cut-off events. For 56/56 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/238 useless extension candidates. Maximal degree in co-relation 461. Up to 183 conditions per place. [2024-11-09 10:40:05,234 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 38 selfloop transitions, 1 changer transitions 0/68 dead transitions. [2024-11-09 10:40:05,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 68 transitions, 270 flow [2024-11-09 10:40:05,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:40:05,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:40:05,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2024-11-09 10:40:05,238 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6901408450704225 [2024-11-09 10:40:05,239 INFO L175 Difference]: Start difference. First operand has 87 places, 72 transitions, 200 flow. Second operand 3 states and 147 transitions. [2024-11-09 10:40:05,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 68 transitions, 270 flow [2024-11-09 10:40:05,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 68 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:40:05,242 INFO L231 Difference]: Finished difference. Result has 83 places, 68 transitions, 186 flow [2024-11-09 10:40:05,243 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=83, PETRI_TRANSITIONS=68} [2024-11-09 10:40:05,246 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2024-11-09 10:40:05,246 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 68 transitions, 186 flow [2024-11-09 10:40:05,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:05,246 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:05,246 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2024-11-09 10:40:05,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:40:05,247 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 10:40:05,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:05,248 INFO L85 PathProgramCache]: Analyzing trace with hash -288522691, now seen corresponding path program 1 times [2024-11-09 10:40:05,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:40:05,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291493898] [2024-11-09 10:40:05,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:05,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:40:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:05,565 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 10:40:05,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:40:05,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291493898] [2024-11-09 10:40:05,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291493898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:05,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:05,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:40:05,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123430183] [2024-11-09 10:40:05,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:05,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:40:05,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:40:05,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:40:05,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:40:05,767 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2024-11-09 10:40:05,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 68 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:05,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:05,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2024-11-09 10:40:05,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:05,948 INFO L124 PetriNetUnfolderBase]: 64/254 cut-off events. [2024-11-09 10:40:05,949 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-11-09 10:40:05,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 254 events. 64/254 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1108 event pairs, 54 based on Foata normal form. 9/220 useless extension candidates. Maximal degree in co-relation 438. Up to 129 conditions per place. [2024-11-09 10:40:05,950 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 36 selfloop transitions, 6 changer transitions 3/74 dead transitions. [2024-11-09 10:40:05,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 74 transitions, 288 flow [2024-11-09 10:40:05,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:40:05,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:40:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2024-11-09 10:40:05,952 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6422535211267606 [2024-11-09 10:40:05,952 INFO L175 Difference]: Start difference. First operand has 83 places, 68 transitions, 186 flow. Second operand 5 states and 228 transitions. [2024-11-09 10:40:05,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 74 transitions, 288 flow [2024-11-09 10:40:05,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 74 transitions, 287 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:40:05,954 INFO L231 Difference]: Finished difference. Result has 83 places, 65 transitions, 191 flow [2024-11-09 10:40:05,954 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=83, PETRI_TRANSITIONS=65} [2024-11-09 10:40:05,955 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2024-11-09 10:40:05,955 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 191 flow [2024-11-09 10:40:05,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:05,955 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:05,955 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:05,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:40:05,956 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 10:40:05,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:05,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1271829195, now seen corresponding path program 1 times [2024-11-09 10:40:05,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:40:05,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563523644] [2024-11-09 10:40:05,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:05,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:40:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:06,306 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 10:40:06,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:40:06,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563523644] [2024-11-09 10:40:06,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563523644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:06,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:06,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:40:06,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183863209] [2024-11-09 10:40:06,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:06,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:40:06,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:40:06,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:40:06,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:40:06,577 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 71 [2024-11-09 10:40:06,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 191 flow. Second operand has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:06,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:06,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 71 [2024-11-09 10:40:06,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:06,723 INFO L124 PetriNetUnfolderBase]: 64/252 cut-off events. [2024-11-09 10:40:06,724 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-09 10:40:06,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 252 events. 64/252 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1100 event pairs, 54 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 453. Up to 126 conditions per place. [2024-11-09 10:40:06,726 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 38 selfloop transitions, 7 changer transitions 3/72 dead transitions. [2024-11-09 10:40:06,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 72 transitions, 301 flow [2024-11-09 10:40:06,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:40:06,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:40:06,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 292 transitions. [2024-11-09 10:40:06,727 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5875251509054326 [2024-11-09 10:40:06,727 INFO L175 Difference]: Start difference. First operand has 83 places, 65 transitions, 191 flow. Second operand 7 states and 292 transitions. [2024-11-09 10:40:06,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 72 transitions, 301 flow [2024-11-09 10:40:06,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 72 transitions, 289 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:40:06,730 INFO L231 Difference]: Finished difference. Result has 83 places, 63 transitions, 189 flow [2024-11-09 10:40:06,730 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=189, PETRI_PLACES=83, PETRI_TRANSITIONS=63} [2024-11-09 10:40:06,731 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2024-11-09 10:40:06,731 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 63 transitions, 189 flow [2024-11-09 10:40:06,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:06,731 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:06,732 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:06,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:40:06,732 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 10:40:06,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:06,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1271829194, now seen corresponding path program 1 times [2024-11-09 10:40:06,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:40:06,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835698561] [2024-11-09 10:40:06,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:06,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:40:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:07,146 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 10:40:07,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:40:07,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835698561] [2024-11-09 10:40:07,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835698561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:07,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:07,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:40:07,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574258034] [2024-11-09 10:40:07,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:07,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:40:07,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:40:07,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:40:07,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:40:07,493 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 71 [2024-11-09 10:40:07,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 63 transitions, 189 flow. Second operand has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:07,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:07,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 71 [2024-11-09 10:40:07,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:07,657 INFO L124 PetriNetUnfolderBase]: 64/250 cut-off events. [2024-11-09 10:40:07,657 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-11-09 10:40:07,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 250 events. 64/250 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1095 event pairs, 54 based on Foata normal form. 1/211 useless extension candidates. Maximal degree in co-relation 452. Up to 126 conditions per place. [2024-11-09 10:40:07,659 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 37 selfloop transitions, 7 changer transitions 3/70 dead transitions. [2024-11-09 10:40:07,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 70 transitions, 297 flow [2024-11-09 10:40:07,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:40:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:40:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 270 transitions. [2024-11-09 10:40:07,661 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5432595573440644 [2024-11-09 10:40:07,661 INFO L175 Difference]: Start difference. First operand has 83 places, 63 transitions, 189 flow. Second operand 7 states and 270 transitions. [2024-11-09 10:40:07,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 70 transitions, 297 flow [2024-11-09 10:40:07,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 70 transitions, 283 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 10:40:07,664 INFO L231 Difference]: Finished difference. Result has 81 places, 61 transitions, 185 flow [2024-11-09 10:40:07,664 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=185, PETRI_PLACES=81, PETRI_TRANSITIONS=61} [2024-11-09 10:40:07,666 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 8 predicate places. [2024-11-09 10:40:07,666 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 61 transitions, 185 flow [2024-11-09 10:40:07,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:07,666 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:07,666 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:07,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:40:07,667 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 10:40:07,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:07,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1837841232, now seen corresponding path program 1 times [2024-11-09 10:40:07,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:40:07,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908256331] [2024-11-09 10:40:07,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:07,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:40:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:07,918 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 10:40:07,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:40:07,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908256331] [2024-11-09 10:40:07,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908256331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:07,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:07,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:40:07,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886205768] [2024-11-09 10:40:07,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:07,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:40:07,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:40:07,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:40:07,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:40:08,033 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 71 [2024-11-09 10:40:08,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 61 transitions, 185 flow. Second operand has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:08,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:08,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 71 [2024-11-09 10:40:08,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:08,139 INFO L124 PetriNetUnfolderBase]: 64/249 cut-off events. [2024-11-09 10:40:08,139 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2024-11-09 10:40:08,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 249 events. 64/249 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1097 event pairs, 63 based on Foata normal form. 1/211 useless extension candidates. Maximal degree in co-relation 449. Up to 158 conditions per place. [2024-11-09 10:40:08,141 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 30 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2024-11-09 10:40:08,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 60 transitions, 255 flow [2024-11-09 10:40:08,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:40:08,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:40:08,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2024-11-09 10:40:08,143 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6394366197183099 [2024-11-09 10:40:08,143 INFO L175 Difference]: Start difference. First operand has 81 places, 61 transitions, 185 flow. Second operand 5 states and 227 transitions. [2024-11-09 10:40:08,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 60 transitions, 255 flow [2024-11-09 10:40:08,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 60 transitions, 241 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 10:40:08,146 INFO L231 Difference]: Finished difference. Result has 78 places, 60 transitions, 181 flow [2024-11-09 10:40:08,146 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=78, PETRI_TRANSITIONS=60} [2024-11-09 10:40:08,147 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2024-11-09 10:40:08,147 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 60 transitions, 181 flow [2024-11-09 10:40:08,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:08,147 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:08,147 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:08,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:40:08,148 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 10:40:08,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:08,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1837841231, now seen corresponding path program 1 times [2024-11-09 10:40:08,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:40:08,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520031474] [2024-11-09 10:40:08,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:08,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:40:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:08,254 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 10:40:08,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:40:08,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520031474] [2024-11-09 10:40:08,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520031474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:08,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:08,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:40:08,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059541350] [2024-11-09 10:40:08,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:08,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:40:08,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:40:08,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:40:08,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:40:08,390 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2024-11-09 10:40:08,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 60 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:08,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:08,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2024-11-09 10:40:08,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:08,497 INFO L124 PetriNetUnfolderBase]: 64/248 cut-off events. [2024-11-09 10:40:08,497 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-11-09 10:40:08,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 248 events. 64/248 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1089 event pairs, 63 based on Foata normal form. 1/210 useless extension candidates. Maximal degree in co-relation 440. Up to 158 conditions per place. [2024-11-09 10:40:08,499 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 32 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2024-11-09 10:40:08,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 59 transitions, 255 flow [2024-11-09 10:40:08,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:40:08,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:40:08,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2024-11-09 10:40:08,500 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6169014084507042 [2024-11-09 10:40:08,500 INFO L175 Difference]: Start difference. First operand has 78 places, 60 transitions, 181 flow. Second operand 5 states and 219 transitions. [2024-11-09 10:40:08,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 59 transitions, 255 flow [2024-11-09 10:40:08,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 59 transitions, 243 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:40:08,502 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 179 flow [2024-11-09 10:40:08,503 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2024-11-09 10:40:08,503 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 4 predicate places. [2024-11-09 10:40:08,504 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 179 flow [2024-11-09 10:40:08,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:08,504 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:08,504 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:08,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:40:08,504 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 10:40:08,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:08,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1470077069, now seen corresponding path program 1 times [2024-11-09 10:40:08,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:40:08,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092853729] [2024-11-09 10:40:08,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:08,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:40:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:08,636 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 10:40:08,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:40:08,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092853729] [2024-11-09 10:40:08,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092853729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:08,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:08,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:40:08,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062903090] [2024-11-09 10:40:08,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:08,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:40:08,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:40:08,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:40:08,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:40:08,688 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 71 [2024-11-09 10:40:08,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 59 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:08,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:08,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 71 [2024-11-09 10:40:08,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:08,794 INFO L124 PetriNetUnfolderBase]: 64/251 cut-off events. [2024-11-09 10:40:08,795 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-11-09 10:40:08,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 251 events. 64/251 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1092 event pairs, 56 based on Foata normal form. 8/225 useless extension candidates. Maximal degree in co-relation 441. Up to 148 conditions per place. [2024-11-09 10:40:08,797 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 41 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-11-09 10:40:08,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 64 transitions, 275 flow [2024-11-09 10:40:08,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:40:08,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:40:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2024-11-09 10:40:08,798 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7699530516431925 [2024-11-09 10:40:08,798 INFO L175 Difference]: Start difference. First operand has 77 places, 59 transitions, 179 flow. Second operand 3 states and 164 transitions. [2024-11-09 10:40:08,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 64 transitions, 275 flow [2024-11-09 10:40:08,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 64 transitions, 263 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:40:08,800 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 167 flow [2024-11-09 10:40:08,801 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2024-11-09 10:40:08,801 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2024-11-09 10:40:08,801 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 167 flow [2024-11-09 10:40:08,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:08,802 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:08,802 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:08,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:40:08,802 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 10:40:08,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:08,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1470077070, now seen corresponding path program 1 times [2024-11-09 10:40:08,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:40:08,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606532117] [2024-11-09 10:40:08,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:08,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:40:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:08,924 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 10:40:08,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:40:08,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606532117] [2024-11-09 10:40:08,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606532117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:08,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:08,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:40:08,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891118621] [2024-11-09 10:40:08,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:08,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:40:08,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:40:08,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:40:08,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:40:08,975 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 71 [2024-11-09 10:40:08,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:08,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:08,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 71 [2024-11-09 10:40:08,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:09,060 INFO L124 PetriNetUnfolderBase]: 71/242 cut-off events. [2024-11-09 10:40:09,061 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-11-09 10:40:09,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 242 events. 71/242 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 994 event pairs, 56 based on Foata normal form. 8/223 useless extension candidates. Maximal degree in co-relation 457. Up to 148 conditions per place. [2024-11-09 10:40:09,062 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 42 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2024-11-09 10:40:09,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 62 transitions, 265 flow [2024-11-09 10:40:09,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:40:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:40:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2024-11-09 10:40:09,064 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7605633802816901 [2024-11-09 10:40:09,064 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 167 flow. Second operand 3 states and 162 transitions. [2024-11-09 10:40:09,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 62 transitions, 265 flow [2024-11-09 10:40:09,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 62 transitions, 261 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:40:09,066 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 163 flow [2024-11-09 10:40:09,066 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2024-11-09 10:40:09,067 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2024-11-09 10:40:09,067 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 163 flow [2024-11-09 10:40:09,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:09,068 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:09,068 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:09,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 10:40:09,068 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 10:40:09,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:09,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1662582269, now seen corresponding path program 1 times [2024-11-09 10:40:09,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:40:09,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290521302] [2024-11-09 10:40:09,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:09,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:40:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 10:40:09,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:40:09,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290521302] [2024-11-09 10:40:09,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290521302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:09,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:09,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:40:09,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517767478] [2024-11-09 10:40:09,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:09,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 10:40:09,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:40:09,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 10:40:09,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 10:40:09,876 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 71 [2024-11-09 10:40:09,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 163 flow. Second operand has 9 states, 9 states have (on average 41.666666666666664) internal successors, (375), 9 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:09,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:09,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 71 [2024-11-09 10:40:09,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:10,105 INFO L124 PetriNetUnfolderBase]: 85/287 cut-off events. [2024-11-09 10:40:10,106 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2024-11-09 10:40:10,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 287 events. 85/287 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1277 event pairs, 60 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 537. Up to 152 conditions per place. [2024-11-09 10:40:10,107 INFO L140 encePairwiseOnDemand]: 59/71 looper letters, 44 selfloop transitions, 11 changer transitions 3/74 dead transitions. [2024-11-09 10:40:10,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 325 flow [2024-11-09 10:40:10,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:40:10,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:40:10,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 449 transitions. [2024-11-09 10:40:10,109 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6323943661971831 [2024-11-09 10:40:10,109 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 163 flow. Second operand 10 states and 449 transitions. [2024-11-09 10:40:10,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 325 flow [2024-11-09 10:40:10,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 74 transitions, 313 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:40:10,111 INFO L231 Difference]: Finished difference. Result has 79 places, 57 transitions, 194 flow [2024-11-09 10:40:10,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=194, PETRI_PLACES=79, PETRI_TRANSITIONS=57} [2024-11-09 10:40:10,113 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 6 predicate places. [2024-11-09 10:40:10,113 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 57 transitions, 194 flow [2024-11-09 10:40:10,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 41.666666666666664) internal successors, (375), 9 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:10,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:10,113 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:10,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 10:40:10,114 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 10:40:10,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:10,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1662582268, now seen corresponding path program 1 times [2024-11-09 10:40:10,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:40:10,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183174911] [2024-11-09 10:40:10,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:10,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:40:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:10,249 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 10:40:10,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:40:10,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183174911] [2024-11-09 10:40:10,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183174911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:10,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:10,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:40:10,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036007334] [2024-11-09 10:40:10,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:10,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:40:10,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:40:10,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:40:10,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:40:10,390 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 71 [2024-11-09 10:40:10,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 57 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 42.5) internal successors, (255), 6 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:10,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:10,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 71 [2024-11-09 10:40:10,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:10,532 INFO L124 PetriNetUnfolderBase]: 79/265 cut-off events. [2024-11-09 10:40:10,532 INFO L125 PetriNetUnfolderBase]: For 101/109 co-relation queries the response was YES. [2024-11-09 10:40:10,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 265 events. 79/265 cut-off events. For 101/109 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1112 event pairs, 54 based on Foata normal form. 17/254 useless extension candidates. Maximal degree in co-relation 547. Up to 132 conditions per place. [2024-11-09 10:40:10,534 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 47 selfloop transitions, 7 changer transitions 3/73 dead transitions. [2024-11-09 10:40:10,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 73 transitions, 342 flow [2024-11-09 10:40:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:40:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:40:10,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 287 transitions. [2024-11-09 10:40:10,536 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6737089201877934 [2024-11-09 10:40:10,536 INFO L175 Difference]: Start difference. First operand has 79 places, 57 transitions, 194 flow. Second operand 6 states and 287 transitions. [2024-11-09 10:40:10,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 73 transitions, 342 flow [2024-11-09 10:40:10,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 73 transitions, 323 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-09 10:40:10,538 INFO L231 Difference]: Finished difference. Result has 75 places, 56 transitions, 187 flow [2024-11-09 10:40:10,538 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=75, PETRI_TRANSITIONS=56} [2024-11-09 10:40:10,539 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 2 predicate places. [2024-11-09 10:40:10,539 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 56 transitions, 187 flow [2024-11-09 10:40:10,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.5) internal successors, (255), 6 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:10,539 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:10,539 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:10,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 10:40:10,540 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 10:40:10,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash 300192051, now seen corresponding path program 1 times [2024-11-09 10:40:10,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:40:10,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473648794] [2024-11-09 10:40:10,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:10,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:40:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:10,950 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 10:40:10,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:40:10,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473648794] [2024-11-09 10:40:10,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473648794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:10,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:10,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:40:10,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626883914] [2024-11-09 10:40:10,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:10,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:40:10,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:40:10,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:40:10,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:40:11,260 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 71 [2024-11-09 10:40:11,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 56 transitions, 187 flow. Second operand has 7 states, 7 states have (on average 41.142857142857146) internal successors, (288), 7 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:11,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:11,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 71 [2024-11-09 10:40:11,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:11,369 INFO L124 PetriNetUnfolderBase]: 79/281 cut-off events. [2024-11-09 10:40:11,369 INFO L125 PetriNetUnfolderBase]: For 124/130 co-relation queries the response was YES. [2024-11-09 10:40:11,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 281 events. 79/281 cut-off events. For 124/130 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1267 event pairs, 6 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 574. Up to 166 conditions per place. [2024-11-09 10:40:11,371 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 45 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-11-09 10:40:11,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 63 transitions, 305 flow [2024-11-09 10:40:11,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:40:11,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:40:11,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2024-11-09 10:40:11,373 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.676056338028169 [2024-11-09 10:40:11,373 INFO L175 Difference]: Start difference. First operand has 75 places, 56 transitions, 187 flow. Second operand 4 states and 192 transitions. [2024-11-09 10:40:11,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 63 transitions, 305 flow [2024-11-09 10:40:11,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 63 transitions, 285 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 10:40:11,375 INFO L231 Difference]: Finished difference. Result has 72 places, 55 transitions, 175 flow [2024-11-09 10:40:11,375 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=72, PETRI_TRANSITIONS=55} [2024-11-09 10:40:11,376 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -1 predicate places. [2024-11-09 10:40:11,376 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 55 transitions, 175 flow [2024-11-09 10:40:11,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 41.142857142857146) internal successors, (288), 7 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:11,376 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:11,376 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:11,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 10:40:11,377 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 10:40:11,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:11,377 INFO L85 PathProgramCache]: Analyzing trace with hash 443335, now seen corresponding path program 1 times [2024-11-09 10:40:11,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:40:11,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105703265] [2024-11-09 10:40:11,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:11,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:40:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 10:40:12,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:40:12,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105703265] [2024-11-09 10:40:12,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105703265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:12,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:12,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 10:40:12,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605808283] [2024-11-09 10:40:12,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:12,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:40:12,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:40:12,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:40:12,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:40:13,468 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 71 [2024-11-09 10:40:13,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 55 transitions, 175 flow. Second operand has 13 states, 13 states have (on average 30.384615384615383) internal successors, (395), 13 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:13,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:13,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 71 [2024-11-09 10:40:13,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:13,968 INFO L124 PetriNetUnfolderBase]: 132/387 cut-off events. [2024-11-09 10:40:13,968 INFO L125 PetriNetUnfolderBase]: For 84/93 co-relation queries the response was YES. [2024-11-09 10:40:13,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 387 events. 132/387 cut-off events. For 84/93 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1766 event pairs, 55 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 771. Up to 190 conditions per place. [2024-11-09 10:40:13,971 INFO L140 encePairwiseOnDemand]: 58/71 looper letters, 60 selfloop transitions, 16 changer transitions 0/86 dead transitions. [2024-11-09 10:40:13,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 86 transitions, 405 flow [2024-11-09 10:40:13,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:40:13,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-09 10:40:13,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 443 transitions. [2024-11-09 10:40:13,973 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4799566630552546 [2024-11-09 10:40:13,974 INFO L175 Difference]: Start difference. First operand has 72 places, 55 transitions, 175 flow. Second operand 13 states and 443 transitions. [2024-11-09 10:40:13,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 86 transitions, 405 flow [2024-11-09 10:40:13,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 86 transitions, 399 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:40:13,976 INFO L231 Difference]: Finished difference. Result has 86 places, 63 transitions, 253 flow [2024-11-09 10:40:13,976 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=253, PETRI_PLACES=86, PETRI_TRANSITIONS=63} [2024-11-09 10:40:13,977 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 13 predicate places. [2024-11-09 10:40:13,977 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 63 transitions, 253 flow [2024-11-09 10:40:13,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 30.384615384615383) internal successors, (395), 13 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:13,977 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:13,978 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:13,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 10:40:13,978 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 10:40:13,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:13,979 INFO L85 PathProgramCache]: Analyzing trace with hash 443334, now seen corresponding path program 1 times [2024-11-09 10:40:13,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:40:13,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937539336] [2024-11-09 10:40:13,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:13,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:40:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:40:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 10:40:14,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:40:14,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937539336] [2024-11-09 10:40:14,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937539336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:40:14,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:40:14,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 10:40:14,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028776585] [2024-11-09 10:40:14,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:40:14,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:40:14,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:40:14,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:40:14,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:40:15,745 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 71 [2024-11-09 10:40:15,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 63 transitions, 253 flow. Second operand has 14 states, 14 states have (on average 34.285714285714285) internal successors, (480), 14 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:15,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:40:15,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 71 [2024-11-09 10:40:15,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:40:16,153 INFO L124 PetriNetUnfolderBase]: 132/383 cut-off events. [2024-11-09 10:40:16,153 INFO L125 PetriNetUnfolderBase]: For 176/185 co-relation queries the response was YES. [2024-11-09 10:40:16,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 901 conditions, 383 events. 132/383 cut-off events. For 176/185 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1734 event pairs, 34 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 877. Up to 145 conditions per place. [2024-11-09 10:40:16,156 INFO L140 encePairwiseOnDemand]: 57/71 looper letters, 56 selfloop transitions, 18 changer transitions 0/84 dead transitions. [2024-11-09 10:40:16,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 84 transitions, 450 flow [2024-11-09 10:40:16,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:40:16,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-09 10:40:16,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 492 transitions. [2024-11-09 10:40:16,159 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5330444203683641 [2024-11-09 10:40:16,159 INFO L175 Difference]: Start difference. First operand has 86 places, 63 transitions, 253 flow. Second operand 13 states and 492 transitions. [2024-11-09 10:40:16,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 84 transitions, 450 flow [2024-11-09 10:40:16,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 84 transitions, 437 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-09 10:40:16,163 INFO L231 Difference]: Finished difference. Result has 94 places, 64 transitions, 300 flow [2024-11-09 10:40:16,163 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=300, PETRI_PLACES=94, PETRI_TRANSITIONS=64} [2024-11-09 10:40:16,164 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 21 predicate places. [2024-11-09 10:40:16,164 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 64 transitions, 300 flow [2024-11-09 10:40:16,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 34.285714285714285) internal successors, (480), 14 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:40:16,167 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:40:16,167 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:16,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 10:40:16,168 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 10:40:16,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:40:16,168 INFO L85 PathProgramCache]: Analyzing trace with hash 716019552, now seen corresponding path program 1 times [2024-11-09 10:40:16,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:40:16,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600523894] [2024-11-09 10:40:16,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:40:16,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:40:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:40:16,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:40:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:40:16,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:40:16,344 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:40:16,345 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 50 remaining) [2024-11-09 10:40:16,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2024-11-09 10:40:16,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2024-11-09 10:40:16,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2024-11-09 10:40:16,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2024-11-09 10:40:16,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2024-11-09 10:40:16,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2024-11-09 10:40:16,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2024-11-09 10:40:16,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2024-11-09 10:40:16,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2024-11-09 10:40:16,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2024-11-09 10:40:16,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2024-11-09 10:40:16,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2024-11-09 10:40:16,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2024-11-09 10:40:16,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2024-11-09 10:40:16,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2024-11-09 10:40:16,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2024-11-09 10:40:16,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2024-11-09 10:40:16,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2024-11-09 10:40:16,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2024-11-09 10:40:16,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2024-11-09 10:40:16,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2024-11-09 10:40:16,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2024-11-09 10:40:16,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2024-11-09 10:40:16,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2024-11-09 10:40:16,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (24 of 50 remaining) [2024-11-09 10:40:16,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 50 remaining) [2024-11-09 10:40:16,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2024-11-09 10:40:16,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2024-11-09 10:40:16,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2024-11-09 10:40:16,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2024-11-09 10:40:16,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2024-11-09 10:40:16,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2024-11-09 10:40:16,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2024-11-09 10:40:16,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2024-11-09 10:40:16,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2024-11-09 10:40:16,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2024-11-09 10:40:16,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2024-11-09 10:40:16,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2024-11-09 10:40:16,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2024-11-09 10:40:16,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2024-11-09 10:40:16,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2024-11-09 10:40:16,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2024-11-09 10:40:16,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2024-11-09 10:40:16,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2024-11-09 10:40:16,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2024-11-09 10:40:16,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2024-11-09 10:40:16,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2024-11-09 10:40:16,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2024-11-09 10:40:16,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 50 remaining) [2024-11-09 10:40:16,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 10:40:16,355 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:40:16,402 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:40:16,402 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:40:16,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:40:16 BasicIcfg [2024-11-09 10:40:16,409 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:40:16,410 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:40:16,410 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:40:16,410 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:40:16,410 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:40:01" (3/4) ... [2024-11-09 10:40:16,411 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 10:40:16,466 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 10:40:16,466 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:40:16,467 INFO L158 Benchmark]: Toolchain (without parser) took 16795.63ms. Allocated memory was 178.3MB in the beginning and 432.0MB in the end (delta: 253.8MB). Free memory was 145.9MB in the beginning and 258.9MB in the end (delta: -113.0MB). Peak memory consumption was 139.6MB. Max. memory is 16.1GB. [2024-11-09 10:40:16,467 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 178.3MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:40:16,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 759.45ms. Allocated memory is still 178.3MB. Free memory was 145.9MB in the beginning and 101.9MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-09 10:40:16,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.20ms. Allocated memory is still 178.3MB. Free memory was 101.9MB in the beginning and 98.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:40:16,468 INFO L158 Benchmark]: Boogie Preprocessor took 78.19ms. Allocated memory is still 178.3MB. Free memory was 98.6MB in the beginning and 94.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:40:16,468 INFO L158 Benchmark]: RCFGBuilder took 1390.83ms. Allocated memory was 178.3MB in the beginning and 222.3MB in the end (delta: 44.0MB). Free memory was 94.7MB in the beginning and 124.0MB in the end (delta: -29.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 10:40:16,468 INFO L158 Benchmark]: TraceAbstraction took 14445.28ms. Allocated memory was 222.3MB in the beginning and 432.0MB in the end (delta: 209.7MB). Free memory was 122.9MB in the beginning and 264.1MB in the end (delta: -141.2MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB. [2024-11-09 10:40:16,468 INFO L158 Benchmark]: Witness Printer took 56.75ms. Allocated memory is still 432.0MB. Free memory was 264.1MB in the beginning and 258.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:40:16,474 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.25ms. Allocated memory is still 178.3MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 759.45ms. Allocated memory is still 178.3MB. Free memory was 145.9MB in the beginning and 101.9MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.20ms. Allocated memory is still 178.3MB. Free memory was 101.9MB in the beginning and 98.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.19ms. Allocated memory is still 178.3MB. Free memory was 98.6MB in the beginning and 94.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1390.83ms. Allocated memory was 178.3MB in the beginning and 222.3MB in the end (delta: 44.0MB). Free memory was 94.7MB in the beginning and 124.0MB in the end (delta: -29.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14445.28ms. Allocated memory was 222.3MB in the beginning and 432.0MB in the end (delta: 209.7MB). Free memory was 122.9MB in the beginning and 264.1MB in the end (delta: -141.2MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB. * Witness Printer took 56.75ms. Allocated memory is still 432.0MB. Free memory was 264.1MB in the beginning and 258.9MB in the end (delta: 5.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: [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1256] 0 int i = 0; VAL [c={1:0}, i=0] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=1] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=2] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=3] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=4] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=5] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=6] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=7] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=8] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=9] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=10] [L1256] COND FALSE 0 !(i < 10) [L1258] 0 int j = __VERIFIER_nondet_int(); [L1259] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1259] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1260] 0 struct s *p; [L1261] 0 pthread_t t1; [L1262] CALL, EXPR 0 new(1) [L1237] 0 struct s *p = malloc(sizeof(struct s)); [L1238] 0 p->datum = x VAL [c={1:0}] [L1239] 0 p->next = ((void *)0) [L1240] 0 return p; [L1262] RET, EXPR 0 new(1) [L1262] 0 c.slots[j] = new(1) [L1263] CALL, EXPR 0 new(2) [L1237] 0 struct s *p = malloc(sizeof(struct s)); [L1238] 0 p->datum = x VAL [c={1:0}] [L1239] 0 p->next = ((void *)0) [L1240] 0 return p; [L1263] RET, EXPR 0 new(2) [L1263] EXPR 0 c.slots[j] [L1263] CALL 0 list_add(new(2), c.slots[j]) [L1243] EXPR 0 list->next [L1243] 0 struct s *temp = list->next; [L1244] 0 list->next = node VAL [c={1:0}] [L1245] 0 node->next = temp [L1263] RET 0 list_add(new(2), c.slots[j]) [L1264] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [c={1:0}, j=9, t1=-1] [L1248] 1 int i = __VERIFIER_nondet_int(); [L1249] CALL 1 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 1 !(!cond) [L1249] RET 1 assume_abort_if_not(0 <= i && i < 10) [L1251] CALL, EXPR 1 new(3) [L1237] 1 struct s *p = malloc(sizeof(struct s)); [L1238] 1 p->datum = x VAL [\old(arg)={0:0}, arg={0:0}, c={1:0}, i=0] [L1239] 1 p->next = ((void *)0) [L1240] 1 return p; [L1251] RET, EXPR 1 new(3) [L1251] EXPR 1 c.slots[i] [L1251] CALL 1 list_add(new(3), c.slots[i]) [L1243] 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: 1255]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1264]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 96 locations, 50 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.3s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3351 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2453 mSDsluCounter, 1762 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1679 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9358 IncrementalHoareTripleChecker+Invalid, 9480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 83 mSDtfsCounter, 9358 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=300occurred in iteration=18, InterpolantAutomatonStates: 111, 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.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 334 ConstructedInterpolants, 0 QuantifiedInterpolants, 2722 SizeOfPredicates, 0 NumberOfNonLiveVariables, 389 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 780/813 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 10:40:16,510 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)