./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-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 573c853979782f78b60122afde2824ab47c3f9d6394b4ee74285d458320f7321 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 19:08:20,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:08:20,336 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 19:08:20,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:08:20,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:08:20,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:08:20,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:08:20,386 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:08:20,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:08:20,388 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:08:20,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:08:20,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:08:20,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:08:20,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:08:20,390 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:08:20,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:08:20,392 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:08:20,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:08:20,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:08:20,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:08:20,393 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 19:08:20,397 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 19:08:20,397 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 19:08:20,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:08:20,397 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 19:08:20,398 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:08:20,398 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:08:20,398 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:08:20,398 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:08:20,399 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:08:20,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:08:20,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:08:20,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:08:20,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:08:20,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:08:20,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:08:20,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 19:08:20,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 19:08:20,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:08:20,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:08:20,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:08:20,401 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:08:20,401 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 -> 573c853979782f78b60122afde2824ab47c3f9d6394b4ee74285d458320f7321 [2024-10-24 19:08:20,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:08:20,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:08:20,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:08:20,689 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:08:20,689 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:08:20,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.i [2024-10-24 19:08:22,205 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:08:22,494 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:08:22,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.i [2024-10-24 19:08:22,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f299ab23/28bbf97a1e72471f9265c0d4c1a7d803/FLAG2105c5348 [2024-10-24 19:08:22,533 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f299ab23/28bbf97a1e72471f9265c0d4c1a7d803 [2024-10-24 19:08:22,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:08:22,536 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:08:22,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:08:22,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:08:22,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:08:22,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:08:22" (1/1) ... [2024-10-24 19:08:22,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a418f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:22, skipping insertion in model container [2024-10-24 19:08:22,548 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:08:22" (1/1) ... [2024-10-24 19:08:22,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:08:23,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:08:23,248 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 19:08:23,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:08:23,393 INFO L204 MainTranslator]: Completed translation [2024-10-24 19:08:23,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:23 WrapperNode [2024-10-24 19:08:23,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:08:23,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 19:08:23,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 19:08:23,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 19:08:23,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:23" (1/1) ... [2024-10-24 19:08:23,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:23" (1/1) ... [2024-10-24 19:08:23,493 INFO L138 Inliner]: procedures = 370, calls = 39, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 191 [2024-10-24 19:08:23,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 19:08:23,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 19:08:23,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 19:08:23,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 19:08:23,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:23" (1/1) ... [2024-10-24 19:08:23,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:23" (1/1) ... [2024-10-24 19:08:23,514 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:23" (1/1) ... [2024-10-24 19:08:23,538 INFO L175 MemorySlicer]: Split 39 memory accesses to 3 slices as follows [1, 9, 29]. 74 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 26 writes are split as follows [1, 3, 22]. [2024-10-24 19:08:23,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:23" (1/1) ... [2024-10-24 19:08:23,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:23" (1/1) ... [2024-10-24 19:08:23,554 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:23" (1/1) ... [2024-10-24 19:08:23,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:23" (1/1) ... [2024-10-24 19:08:23,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:23" (1/1) ... [2024-10-24 19:08:23,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:23" (1/1) ... [2024-10-24 19:08:23,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 19:08:23,567 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 19:08:23,567 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 19:08:23,567 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 19:08:23,568 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:23" (1/1) ... [2024-10-24 19:08:23,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:08:23,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:08:23,602 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 19:08:23,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 19:08:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 19:08:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 19:08:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 19:08:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-24 19:08:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 19:08:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 19:08:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 19:08:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 19:08:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 19:08:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 19:08:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-24 19:08:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 19:08:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 19:08:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 19:08:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 19:08:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 19:08:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-24 19:08:23,643 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-24 19:08:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 19:08:23,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 19:08:23,645 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 19:08:23,802 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 19:08:23,804 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 19:08:24,275 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 19:08:24,276 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 19:08:24,558 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 19:08:24,558 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 19:08:24,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:08:24 BoogieIcfgContainer [2024-10-24 19:08:24,559 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 19:08:24,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 19:08:24,562 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 19:08:24,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 19:08:24,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:08:22" (1/3) ... [2024-10-24 19:08:24,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd35e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:08:24, skipping insertion in model container [2024-10-24 19:08:24,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:23" (2/3) ... [2024-10-24 19:08:24,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd35e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:08:24, skipping insertion in model container [2024-10-24 19:08:24,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:08:24" (3/3) ... [2024-10-24 19:08:24,570 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_12-arraycollapse_rc-deref.i [2024-10-24 19:08:24,587 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 19:08:24,588 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 75 error locations. [2024-10-24 19:08:24,588 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 19:08:24,650 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 19:08:24,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 128 transitions, 260 flow [2024-10-24 19:08:24,746 INFO L124 PetriNetUnfolderBase]: 1/127 cut-off events. [2024-10-24 19:08:24,747 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:08:24,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 127 events. 1/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 248 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2024-10-24 19:08:24,749 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 128 transitions, 260 flow [2024-10-24 19:08:24,755 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 127 transitions, 257 flow [2024-10-24 19:08:24,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 19:08:24,775 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;@26a287ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 19:08:24,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2024-10-24 19:08:24,780 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 19:08:24,782 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-10-24 19:08:24,782 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:08:24,782 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:24,783 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-24 19:08:24,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:24,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:24,790 INFO L85 PathProgramCache]: Analyzing trace with hash 612188, now seen corresponding path program 1 times [2024-10-24 19:08:24,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:24,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129364540] [2024-10-24 19:08:24,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:24,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:08:25,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:25,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129364540] [2024-10-24 19:08:25,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129364540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:25,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:25,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:08:25,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769930928] [2024-10-24 19:08:25,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:25,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:08:25,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:25,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:08:25,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:08:25,134 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 128 [2024-10-24 19:08:25,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 127 transitions, 257 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:25,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:25,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 128 [2024-10-24 19:08:25,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:25,342 INFO L124 PetriNetUnfolderBase]: 64/324 cut-off events. [2024-10-24 19:08:25,342 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:08:25,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 324 events. 64/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1329 event pairs, 63 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 377. Up to 166 conditions per place. [2024-10-24 19:08:25,348 INFO L140 encePairwiseOnDemand]: 125/128 looper letters, 38 selfloop transitions, 2 changer transitions 0/128 dead transitions. [2024-10-24 19:08:25,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 128 transitions, 339 flow [2024-10-24 19:08:25,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:08:25,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:08:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2024-10-24 19:08:25,367 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8020833333333334 [2024-10-24 19:08:25,369 INFO L175 Difference]: Start difference. First operand has 130 places, 127 transitions, 257 flow. Second operand 3 states and 308 transitions. [2024-10-24 19:08:25,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 128 transitions, 339 flow [2024-10-24 19:08:25,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 128 transitions, 338 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:08:25,378 INFO L231 Difference]: Finished difference. Result has 132 places, 128 transitions, 268 flow [2024-10-24 19:08:25,381 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=132, PETRI_TRANSITIONS=128} [2024-10-24 19:08:25,386 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2024-10-24 19:08:25,386 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 128 transitions, 268 flow [2024-10-24 19:08:25,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:25,387 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:25,387 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-24 19:08:25,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 19:08:25,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:25,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:25,388 INFO L85 PathProgramCache]: Analyzing trace with hash 18974015, now seen corresponding path program 1 times [2024-10-24 19:08:25,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:25,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242101316] [2024-10-24 19:08:25,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:25,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:08:25,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:25,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242101316] [2024-10-24 19:08:25,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242101316] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:08:25,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053875212] [2024-10-24 19:08:25,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:25,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:08:25,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:08:25,495 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 19:08:25,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 19:08:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:25,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:08:25,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:08:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:08:25,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:08:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:08:25,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053875212] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:08:25,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:08:25,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-24 19:08:25,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229998495] [2024-10-24 19:08:25,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:08:25,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 19:08:25,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:25,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 19:08:25,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-24 19:08:25,661 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 128 [2024-10-24 19:08:25,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 128 transitions, 268 flow. Second operand has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:25,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:25,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 128 [2024-10-24 19:08:25,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:25,931 INFO L124 PetriNetUnfolderBase]: 64/327 cut-off events. [2024-10-24 19:08:25,934 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:08:25,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 327 events. 64/327 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1318 event pairs, 63 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 499. Up to 166 conditions per place. [2024-10-24 19:08:25,939 INFO L140 encePairwiseOnDemand]: 125/128 looper letters, 38 selfloop transitions, 5 changer transitions 0/131 dead transitions. [2024-10-24 19:08:25,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 131 transitions, 366 flow [2024-10-24 19:08:25,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:08:25,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:08:25,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 580 transitions. [2024-10-24 19:08:25,946 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7552083333333334 [2024-10-24 19:08:25,947 INFO L175 Difference]: Start difference. First operand has 132 places, 128 transitions, 268 flow. Second operand 6 states and 580 transitions. [2024-10-24 19:08:25,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 131 transitions, 366 flow [2024-10-24 19:08:25,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 131 transitions, 362 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-24 19:08:25,952 INFO L231 Difference]: Finished difference. Result has 139 places, 131 transitions, 300 flow [2024-10-24 19:08:25,953 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=139, PETRI_TRANSITIONS=131} [2024-10-24 19:08:25,954 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, 9 predicate places. [2024-10-24 19:08:25,954 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 131 transitions, 300 flow [2024-10-24 19:08:25,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:25,955 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:25,955 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2024-10-24 19:08:25,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 19:08:26,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:08:26,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:26,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:26,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1684588516, now seen corresponding path program 2 times [2024-10-24 19:08:26,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:26,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328863247] [2024-10-24 19:08:26,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:26,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:26,265 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 19:08:26,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:26,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328863247] [2024-10-24 19:08:26,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328863247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:26,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:26,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:08:26,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852261061] [2024-10-24 19:08:26,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:26,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:08:26,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:26,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:08:26,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:08:26,386 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 128 [2024-10-24 19:08:26,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 131 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:26,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:26,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 128 [2024-10-24 19:08:26,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:26,517 INFO L124 PetriNetUnfolderBase]: 64/317 cut-off events. [2024-10-24 19:08:26,518 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-24 19:08:26,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 317 events. 64/317 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1276 event pairs, 63 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 485. Up to 165 conditions per place. [2024-10-24 19:08:26,520 INFO L140 encePairwiseOnDemand]: 108/128 looper letters, 38 selfloop transitions, 10 changer transitions 0/121 dead transitions. [2024-10-24 19:08:26,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 121 transitions, 376 flow [2024-10-24 19:08:26,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:08:26,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:08:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2024-10-24 19:08:26,523 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.71875 [2024-10-24 19:08:26,523 INFO L175 Difference]: Start difference. First operand has 139 places, 131 transitions, 300 flow. Second operand 3 states and 276 transitions. [2024-10-24 19:08:26,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 121 transitions, 376 flow [2024-10-24 19:08:26,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 121 transitions, 362 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-10-24 19:08:26,527 INFO L231 Difference]: Finished difference. Result has 130 places, 121 transitions, 286 flow [2024-10-24 19:08:26,527 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=130, PETRI_TRANSITIONS=121} [2024-10-24 19:08:26,528 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, 0 predicate places. [2024-10-24 19:08:26,528 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 121 transitions, 286 flow [2024-10-24 19:08:26,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:26,528 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:26,529 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2024-10-24 19:08:26,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 19:08:26,529 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:26,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:26,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1684588515, now seen corresponding path program 1 times [2024-10-24 19:08:26,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:26,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028063342] [2024-10-24 19:08:26,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:26,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:08:26,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:26,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028063342] [2024-10-24 19:08:26,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028063342] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:08:26,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457005098] [2024-10-24 19:08:26,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:26,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:08:26,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:08:26,628 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 19:08:26,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 19:08:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:26,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 19:08:26,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:08:26,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:08:26,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:08:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:08:26,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457005098] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:08:26,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:08:26,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-24 19:08:26,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014714269] [2024-10-24 19:08:26,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:08:26,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 19:08:26,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:26,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 19:08:26,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-24 19:08:26,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 128 [2024-10-24 19:08:26,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 121 transitions, 286 flow. Second operand has 13 states, 13 states have (on average 90.07692307692308) internal successors, (1171), 13 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:26,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:26,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 128 [2024-10-24 19:08:26,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:26,995 INFO L124 PetriNetUnfolderBase]: 64/323 cut-off events. [2024-10-24 19:08:26,995 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2024-10-24 19:08:26,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 323 events. 64/323 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1265 event pairs, 63 based on Foata normal form. 6/253 useless extension candidates. Maximal degree in co-relation 490. Up to 166 conditions per place. [2024-10-24 19:08:26,998 INFO L140 encePairwiseOnDemand]: 125/128 looper letters, 38 selfloop transitions, 11 changer transitions 0/127 dead transitions. [2024-10-24 19:08:26,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 127 transitions, 420 flow [2024-10-24 19:08:26,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 19:08:26,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-24 19:08:27,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1123 transitions. [2024-10-24 19:08:27,001 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7311197916666666 [2024-10-24 19:08:27,001 INFO L175 Difference]: Start difference. First operand has 130 places, 121 transitions, 286 flow. Second operand 12 states and 1123 transitions. [2024-10-24 19:08:27,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 127 transitions, 420 flow [2024-10-24 19:08:27,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 127 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:08:27,006 INFO L231 Difference]: Finished difference. Result has 145 places, 127 transitions, 350 flow [2024-10-24 19:08:27,006 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=350, PETRI_PLACES=145, PETRI_TRANSITIONS=127} [2024-10-24 19:08:27,007 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, 15 predicate places. [2024-10-24 19:08:27,007 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 127 transitions, 350 flow [2024-10-24 19:08:27,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 90.07692307692308) internal successors, (1171), 13 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:27,008 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:27,009 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2024-10-24 19:08:27,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 19:08:27,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-24 19:08:27,214 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:27,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:27,214 INFO L85 PathProgramCache]: Analyzing trace with hash 821695805, now seen corresponding path program 2 times [2024-10-24 19:08:27,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:27,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202677633] [2024-10-24 19:08:27,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:27,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 19:08:27,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:27,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202677633] [2024-10-24 19:08:27,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202677633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:27,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:27,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:08:27,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068892025] [2024-10-24 19:08:27,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:27,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:08:27,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:27,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:08:27,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:08:27,476 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 128 [2024-10-24 19:08:27,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 127 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 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-10-24 19:08:27,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:27,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 128 [2024-10-24 19:08:27,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:27,608 INFO L124 PetriNetUnfolderBase]: 64/313 cut-off events. [2024-10-24 19:08:27,609 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-10-24 19:08:27,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 313 events. 64/313 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1255 event pairs, 63 based on Foata normal form. 5/247 useless extension candidates. Maximal degree in co-relation 476. Up to 171 conditions per place. [2024-10-24 19:08:27,612 INFO L140 encePairwiseOnDemand]: 108/128 looper letters, 39 selfloop transitions, 10 changer transitions 0/117 dead transitions. [2024-10-24 19:08:27,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 117 transitions, 428 flow [2024-10-24 19:08:27,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:08:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:08:27,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2024-10-24 19:08:27,614 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7447916666666666 [2024-10-24 19:08:27,614 INFO L175 Difference]: Start difference. First operand has 145 places, 127 transitions, 350 flow. Second operand 3 states and 286 transitions. [2024-10-24 19:08:27,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 117 transitions, 428 flow [2024-10-24 19:08:27,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 117 transitions, 380 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-10-24 19:08:27,620 INFO L231 Difference]: Finished difference. Result has 132 places, 117 transitions, 302 flow [2024-10-24 19:08:27,620 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=132, PETRI_TRANSITIONS=117} [2024-10-24 19:08:27,621 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2024-10-24 19:08:27,621 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 117 transitions, 302 flow [2024-10-24 19:08:27,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 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-10-24 19:08:27,621 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:27,622 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2024-10-24 19:08:27,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 19:08:27,622 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:27,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:27,622 INFO L85 PathProgramCache]: Analyzing trace with hash -624295012, now seen corresponding path program 1 times [2024-10-24 19:08:27,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:27,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465491877] [2024-10-24 19:08:27,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:27,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:27,807 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 19:08:27,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:27,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465491877] [2024-10-24 19:08:27,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465491877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:27,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:27,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:08:27,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274964768] [2024-10-24 19:08:27,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:27,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:08:27,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:27,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:08:27,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:08:28,174 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 128 [2024-10-24 19:08:28,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 117 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:28,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:28,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 128 [2024-10-24 19:08:28,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:28,298 INFO L124 PetriNetUnfolderBase]: 73/327 cut-off events. [2024-10-24 19:08:28,298 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-10-24 19:08:28,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 327 events. 73/327 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1339 event pairs, 72 based on Foata normal form. 2/268 useless extension candidates. Maximal degree in co-relation 524. Up to 199 conditions per place. [2024-10-24 19:08:28,300 INFO L140 encePairwiseOnDemand]: 119/128 looper letters, 54 selfloop transitions, 1 changer transitions 0/109 dead transitions. [2024-10-24 19:08:28,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 109 transitions, 396 flow [2024-10-24 19:08:28,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:08:28,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:08:28,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2024-10-24 19:08:28,302 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7239583333333334 [2024-10-24 19:08:28,302 INFO L175 Difference]: Start difference. First operand has 132 places, 117 transitions, 302 flow. Second operand 3 states and 278 transitions. [2024-10-24 19:08:28,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 109 transitions, 396 flow [2024-10-24 19:08:28,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 109 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:08:28,307 INFO L231 Difference]: Finished difference. Result has 124 places, 109 transitions, 268 flow [2024-10-24 19:08:28,308 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=124, PETRI_TRANSITIONS=109} [2024-10-24 19:08:28,309 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -6 predicate places. [2024-10-24 19:08:28,310 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 109 transitions, 268 flow [2024-10-24 19:08:28,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:28,311 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:28,311 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2024-10-24 19:08:28,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 19:08:28,312 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:28,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:28,312 INFO L85 PathProgramCache]: Analyzing trace with hash -624295011, now seen corresponding path program 1 times [2024-10-24 19:08:28,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:28,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836266317] [2024-10-24 19:08:28,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:28,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:28,538 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 19:08:28,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:28,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836266317] [2024-10-24 19:08:28,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836266317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:28,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:28,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:08:28,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273127970] [2024-10-24 19:08:28,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:28,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:08:28,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:28,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:08:28,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:08:28,787 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 128 [2024-10-24 19:08:28,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 109 transitions, 268 flow. Second operand has 5 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:28,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:28,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 128 [2024-10-24 19:08:28,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:28,946 INFO L124 PetriNetUnfolderBase]: 73/321 cut-off events. [2024-10-24 19:08:28,946 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-10-24 19:08:28,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 321 events. 73/321 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1306 event pairs, 63 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 537. Up to 158 conditions per place. [2024-10-24 19:08:28,949 INFO L140 encePairwiseOnDemand]: 112/128 looper letters, 44 selfloop transitions, 12 changer transitions 3/114 dead transitions. [2024-10-24 19:08:28,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 114 transitions, 396 flow [2024-10-24 19:08:28,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:08:28,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:08:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2024-10-24 19:08:28,950 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6765625 [2024-10-24 19:08:28,951 INFO L175 Difference]: Start difference. First operand has 124 places, 109 transitions, 268 flow. Second operand 5 states and 433 transitions. [2024-10-24 19:08:28,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 114 transitions, 396 flow [2024-10-24 19:08:28,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 114 transitions, 395 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:08:28,954 INFO L231 Difference]: Finished difference. Result has 123 places, 105 transitions, 283 flow [2024-10-24 19:08:28,954 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=283, PETRI_PLACES=123, PETRI_TRANSITIONS=105} [2024-10-24 19:08:28,954 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -7 predicate places. [2024-10-24 19:08:28,955 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 105 transitions, 283 flow [2024-10-24 19:08:28,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:28,955 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:28,955 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:28,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 19:08:28,956 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:28,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:28,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1714080942, now seen corresponding path program 1 times [2024-10-24 19:08:28,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:28,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107702862] [2024-10-24 19:08:28,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:28,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:29,225 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 19:08:29,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:29,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107702862] [2024-10-24 19:08:29,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107702862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:29,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:29,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 19:08:29,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124993382] [2024-10-24 19:08:29,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:29,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 19:08:29,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:29,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 19:08:29,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 19:08:29,631 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 128 [2024-10-24 19:08:29,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 105 transitions, 283 flow. Second operand has 7 states, 7 states have (on average 63.42857142857143) internal successors, (444), 7 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:29,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:29,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 128 [2024-10-24 19:08:29,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:29,860 INFO L124 PetriNetUnfolderBase]: 64/289 cut-off events. [2024-10-24 19:08:29,860 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-10-24 19:08:29,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 289 events. 64/289 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1122 event pairs, 63 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 518. Up to 166 conditions per place. [2024-10-24 19:08:29,862 INFO L140 encePairwiseOnDemand]: 107/128 looper letters, 45 selfloop transitions, 16 changer transitions 0/100 dead transitions. [2024-10-24 19:08:29,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 100 transitions, 395 flow [2024-10-24 19:08:29,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 19:08:29,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-24 19:08:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 552 transitions. [2024-10-24 19:08:29,864 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5390625 [2024-10-24 19:08:29,864 INFO L175 Difference]: Start difference. First operand has 123 places, 105 transitions, 283 flow. Second operand 8 states and 552 transitions. [2024-10-24 19:08:29,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 100 transitions, 395 flow [2024-10-24 19:08:29,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 100 transitions, 371 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 19:08:29,867 INFO L231 Difference]: Finished difference. Result has 121 places, 100 transitions, 281 flow [2024-10-24 19:08:29,868 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=281, PETRI_PLACES=121, PETRI_TRANSITIONS=100} [2024-10-24 19:08:29,870 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -9 predicate places. [2024-10-24 19:08:29,870 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 100 transitions, 281 flow [2024-10-24 19:08:29,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 63.42857142857143) internal successors, (444), 7 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:29,871 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:29,871 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:29,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 19:08:29,871 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:29,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:29,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1714080941, now seen corresponding path program 1 times [2024-10-24 19:08:29,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:29,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816600672] [2024-10-24 19:08:29,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:29,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:30,278 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 19:08:30,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:30,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816600672] [2024-10-24 19:08:30,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816600672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:30,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:30,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 19:08:30,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763710385] [2024-10-24 19:08:30,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:30,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 19:08:30,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:30,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 19:08:30,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 19:08:30,996 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 128 [2024-10-24 19:08:30,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 100 transitions, 281 flow. Second operand has 7 states, 7 states have (on average 57.42857142857143) internal successors, (402), 7 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:30,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:30,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 128 [2024-10-24 19:08:30,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:31,192 INFO L124 PetriNetUnfolderBase]: 64/287 cut-off events. [2024-10-24 19:08:31,193 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-10-24 19:08:31,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 287 events. 64/287 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1125 event pairs, 63 based on Foata normal form. 1/245 useless extension candidates. Maximal degree in co-relation 511. Up to 172 conditions per place. [2024-10-24 19:08:31,195 INFO L140 encePairwiseOnDemand]: 115/128 looper letters, 49 selfloop transitions, 11 changer transitions 0/98 dead transitions. [2024-10-24 19:08:31,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 98 transitions, 397 flow [2024-10-24 19:08:31,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 19:08:31,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-24 19:08:31,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 444 transitions. [2024-10-24 19:08:31,197 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4955357142857143 [2024-10-24 19:08:31,197 INFO L175 Difference]: Start difference. First operand has 121 places, 100 transitions, 281 flow. Second operand 7 states and 444 transitions. [2024-10-24 19:08:31,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 98 transitions, 397 flow [2024-10-24 19:08:31,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 98 transitions, 365 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-24 19:08:31,200 INFO L231 Difference]: Finished difference. Result has 118 places, 98 transitions, 267 flow [2024-10-24 19:08:31,201 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=267, PETRI_PLACES=118, PETRI_TRANSITIONS=98} [2024-10-24 19:08:31,202 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -12 predicate places. [2024-10-24 19:08:31,202 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 98 transitions, 267 flow [2024-10-24 19:08:31,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 57.42857142857143) internal successors, (402), 7 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:31,203 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:31,203 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:31,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 19:08:31,204 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:31,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:31,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2035677726, now seen corresponding path program 1 times [2024-10-24 19:08:31,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:31,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120409338] [2024-10-24 19:08:31,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:31,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:31,443 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 19:08:31,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:31,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120409338] [2024-10-24 19:08:31,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120409338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:31,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:31,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:08:31,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762451127] [2024-10-24 19:08:31,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:31,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:08:31,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:31,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:08:31,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:08:31,680 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 128 [2024-10-24 19:08:31,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 98 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:31,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:31,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 128 [2024-10-24 19:08:31,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:31,838 INFO L124 PetriNetUnfolderBase]: 64/286 cut-off events. [2024-10-24 19:08:31,839 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-10-24 19:08:31,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 286 events. 64/286 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1124 event pairs, 63 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 497. Up to 171 conditions per place. [2024-10-24 19:08:31,841 INFO L140 encePairwiseOnDemand]: 116/128 looper letters, 41 selfloop transitions, 11 changer transitions 0/97 dead transitions. [2024-10-24 19:08:31,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 97 transitions, 369 flow [2024-10-24 19:08:31,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:08:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:08:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 418 transitions. [2024-10-24 19:08:31,844 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.653125 [2024-10-24 19:08:31,844 INFO L175 Difference]: Start difference. First operand has 118 places, 98 transitions, 267 flow. Second operand 5 states and 418 transitions. [2024-10-24 19:08:31,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 97 transitions, 369 flow [2024-10-24 19:08:31,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 97 transitions, 347 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-24 19:08:31,848 INFO L231 Difference]: Finished difference. Result has 115 places, 97 transitions, 265 flow [2024-10-24 19:08:31,848 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=265, PETRI_PLACES=115, PETRI_TRANSITIONS=97} [2024-10-24 19:08:31,849 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -15 predicate places. [2024-10-24 19:08:31,849 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 97 transitions, 265 flow [2024-10-24 19:08:31,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:31,849 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:31,849 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:31,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 19:08:31,850 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:31,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:31,850 INFO L85 PathProgramCache]: Analyzing trace with hash 2035677725, now seen corresponding path program 1 times [2024-10-24 19:08:31,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:31,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748987227] [2024-10-24 19:08:31,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:31,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:31,978 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 19:08:31,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:31,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748987227] [2024-10-24 19:08:31,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748987227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:31,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:31,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:08:31,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911304805] [2024-10-24 19:08:31,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:31,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:08:31,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:31,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:08:31,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:08:32,247 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 128 [2024-10-24 19:08:32,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 97 transitions, 265 flow. Second operand has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:32,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:32,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 128 [2024-10-24 19:08:32,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:32,384 INFO L124 PetriNetUnfolderBase]: 64/285 cut-off events. [2024-10-24 19:08:32,385 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-10-24 19:08:32,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 285 events. 64/285 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1132 event pairs, 63 based on Foata normal form. 1/239 useless extension candidates. Maximal degree in co-relation 501. Up to 171 conditions per place. [2024-10-24 19:08:32,386 INFO L140 encePairwiseOnDemand]: 116/128 looper letters, 46 selfloop transitions, 11 changer transitions 0/96 dead transitions. [2024-10-24 19:08:32,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 96 transitions, 377 flow [2024-10-24 19:08:32,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:08:32,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:08:32,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 398 transitions. [2024-10-24 19:08:32,388 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.621875 [2024-10-24 19:08:32,388 INFO L175 Difference]: Start difference. First operand has 115 places, 97 transitions, 265 flow. Second operand 5 states and 398 transitions. [2024-10-24 19:08:32,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 96 transitions, 377 flow [2024-10-24 19:08:32,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 96 transitions, 355 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 19:08:32,391 INFO L231 Difference]: Finished difference. Result has 114 places, 96 transitions, 263 flow [2024-10-24 19:08:32,391 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=114, PETRI_TRANSITIONS=96} [2024-10-24 19:08:32,391 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -16 predicate places. [2024-10-24 19:08:32,392 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 96 transitions, 263 flow [2024-10-24 19:08:32,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:32,392 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:32,392 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:32,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 19:08:32,393 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:32,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:32,393 INFO L85 PathProgramCache]: Analyzing trace with hash -62430991, now seen corresponding path program 1 times [2024-10-24 19:08:32,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:32,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777999976] [2024-10-24 19:08:32,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:32,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:32,817 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 19:08:32,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:32,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777999976] [2024-10-24 19:08:32,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777999976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:32,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:32,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:08:32,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401976872] [2024-10-24 19:08:32,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:32,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 19:08:32,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:32,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 19:08:32,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 19:08:33,428 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 128 [2024-10-24 19:08:33,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 96 transitions, 263 flow. Second operand has 7 states, 7 states have (on average 68.57142857142857) internal successors, (480), 7 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:33,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:33,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 128 [2024-10-24 19:08:33,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:33,612 INFO L124 PetriNetUnfolderBase]: 73/309 cut-off events. [2024-10-24 19:08:33,613 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-10-24 19:08:33,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 309 events. 73/309 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1282 event pairs, 63 based on Foata normal form. 1/256 useless extension candidates. Maximal degree in co-relation 536. Up to 158 conditions per place. [2024-10-24 19:08:33,615 INFO L140 encePairwiseOnDemand]: 113/128 looper letters, 44 selfloop transitions, 12 changer transitions 3/102 dead transitions. [2024-10-24 19:08:33,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 102 transitions, 393 flow [2024-10-24 19:08:33,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:08:33,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:08:33,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 387 transitions. [2024-10-24 19:08:33,617 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6046875 [2024-10-24 19:08:33,617 INFO L175 Difference]: Start difference. First operand has 114 places, 96 transitions, 263 flow. Second operand 5 states and 387 transitions. [2024-10-24 19:08:33,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 102 transitions, 393 flow [2024-10-24 19:08:33,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 102 transitions, 371 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 19:08:33,620 INFO L231 Difference]: Finished difference. Result has 111 places, 93 transitions, 259 flow [2024-10-24 19:08:33,620 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=111, PETRI_TRANSITIONS=93} [2024-10-24 19:08:33,621 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -19 predicate places. [2024-10-24 19:08:33,622 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 93 transitions, 259 flow [2024-10-24 19:08:33,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 68.57142857142857) internal successors, (480), 7 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:33,622 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:33,622 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:33,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 19:08:33,623 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:33,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:33,623 INFO L85 PathProgramCache]: Analyzing trace with hash -670466203, now seen corresponding path program 1 times [2024-10-24 19:08:33,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:33,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820678228] [2024-10-24 19:08:33,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:33,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:34,127 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 19:08:34,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:34,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820678228] [2024-10-24 19:08:34,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820678228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:34,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:34,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 19:08:34,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990812674] [2024-10-24 19:08:34,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:34,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 19:08:34,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:34,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 19:08:34,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 19:08:34,809 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 128 [2024-10-24 19:08:34,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 93 transitions, 259 flow. Second operand has 7 states, 7 states have (on average 58.57142857142857) internal successors, (410), 7 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:34,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:34,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 128 [2024-10-24 19:08:34,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:35,062 INFO L124 PetriNetUnfolderBase]: 64/278 cut-off events. [2024-10-24 19:08:35,062 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-10-24 19:08:35,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 278 events. 64/278 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1111 event pairs, 54 based on Foata normal form. 2/237 useless extension candidates. Maximal degree in co-relation 502. Up to 132 conditions per place. [2024-10-24 19:08:35,064 INFO L140 encePairwiseOnDemand]: 110/128 looper letters, 48 selfloop transitions, 14 changer transitions 3/98 dead transitions. [2024-10-24 19:08:35,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 98 transitions, 399 flow [2024-10-24 19:08:35,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 19:08:35,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-24 19:08:35,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 451 transitions. [2024-10-24 19:08:35,066 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5033482142857143 [2024-10-24 19:08:35,067 INFO L175 Difference]: Start difference. First operand has 111 places, 93 transitions, 259 flow. Second operand 7 states and 451 transitions. [2024-10-24 19:08:35,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 98 transitions, 399 flow [2024-10-24 19:08:35,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 98 transitions, 375 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 19:08:35,069 INFO L231 Difference]: Finished difference. Result has 109 places, 89 transitions, 255 flow [2024-10-24 19:08:35,070 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=109, PETRI_TRANSITIONS=89} [2024-10-24 19:08:35,070 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -21 predicate places. [2024-10-24 19:08:35,071 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 89 transitions, 255 flow [2024-10-24 19:08:35,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 58.57142857142857) internal successors, (410), 7 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:35,071 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:35,071 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:35,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 19:08:35,072 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:35,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:35,072 INFO L85 PathProgramCache]: Analyzing trace with hash -670466204, now seen corresponding path program 1 times [2024-10-24 19:08:35,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:35,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661704785] [2024-10-24 19:08:35,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:35,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 19:08:35,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:35,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661704785] [2024-10-24 19:08:35,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661704785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:35,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:35,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 19:08:35,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173357608] [2024-10-24 19:08:35,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:35,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 19:08:35,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:35,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 19:08:35,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 19:08:35,728 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 128 [2024-10-24 19:08:35,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 89 transitions, 255 flow. Second operand has 7 states, 7 states have (on average 64.71428571428571) internal successors, (453), 7 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:35,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:35,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 128 [2024-10-24 19:08:35,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:35,905 INFO L124 PetriNetUnfolderBase]: 64/276 cut-off events. [2024-10-24 19:08:35,905 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-10-24 19:08:35,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 276 events. 64/276 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1112 event pairs, 54 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 506. Up to 130 conditions per place. [2024-10-24 19:08:35,907 INFO L140 encePairwiseOnDemand]: 109/128 looper letters, 48 selfloop transitions, 17 changer transitions 3/96 dead transitions. [2024-10-24 19:08:35,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 96 transitions, 405 flow [2024-10-24 19:08:35,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 19:08:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-24 19:08:35,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 556 transitions. [2024-10-24 19:08:35,910 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.54296875 [2024-10-24 19:08:35,910 INFO L175 Difference]: Start difference. First operand has 109 places, 89 transitions, 255 flow. Second operand 8 states and 556 transitions. [2024-10-24 19:08:35,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 96 transitions, 405 flow [2024-10-24 19:08:35,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 96 transitions, 377 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-24 19:08:35,913 INFO L231 Difference]: Finished difference. Result has 108 places, 87 transitions, 257 flow [2024-10-24 19:08:35,913 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=257, PETRI_PLACES=108, PETRI_TRANSITIONS=87} [2024-10-24 19:08:35,914 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -22 predicate places. [2024-10-24 19:08:35,914 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 87 transitions, 257 flow [2024-10-24 19:08:35,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 64.71428571428571) internal successors, (453), 7 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:35,914 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:35,915 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:35,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 19:08:35,915 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:35,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:35,915 INFO L85 PathProgramCache]: Analyzing trace with hash -72905735, now seen corresponding path program 1 times [2024-10-24 19:08:35,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:35,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691771829] [2024-10-24 19:08:35,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:35,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:36,069 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 19:08:36,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:36,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691771829] [2024-10-24 19:08:36,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691771829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:36,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:36,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:08:36,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341073893] [2024-10-24 19:08:36,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:36,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:08:36,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:36,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:08:36,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:08:36,250 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 128 [2024-10-24 19:08:36,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 87 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:36,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:36,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 128 [2024-10-24 19:08:36,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:36,384 INFO L124 PetriNetUnfolderBase]: 64/275 cut-off events. [2024-10-24 19:08:36,384 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-10-24 19:08:36,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 275 events. 64/275 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1112 event pairs, 63 based on Foata normal form. 1/235 useless extension candidates. Maximal degree in co-relation 505. Up to 170 conditions per place. [2024-10-24 19:08:36,386 INFO L140 encePairwiseOnDemand]: 116/128 looper letters, 45 selfloop transitions, 11 changer transitions 0/86 dead transitions. [2024-10-24 19:08:36,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 86 transitions, 367 flow [2024-10-24 19:08:36,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:08:36,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:08:36,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 397 transitions. [2024-10-24 19:08:36,388 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6203125 [2024-10-24 19:08:36,388 INFO L175 Difference]: Start difference. First operand has 108 places, 87 transitions, 257 flow. Second operand 5 states and 397 transitions. [2024-10-24 19:08:36,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 86 transitions, 367 flow [2024-10-24 19:08:36,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 86 transitions, 333 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-24 19:08:36,390 INFO L231 Difference]: Finished difference. Result has 104 places, 86 transitions, 243 flow [2024-10-24 19:08:36,391 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=104, PETRI_TRANSITIONS=86} [2024-10-24 19:08:36,391 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -26 predicate places. [2024-10-24 19:08:36,391 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 86 transitions, 243 flow [2024-10-24 19:08:36,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:36,392 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:36,392 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:36,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 19:08:36,392 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:36,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:36,393 INFO L85 PathProgramCache]: Analyzing trace with hash -72905734, now seen corresponding path program 1 times [2024-10-24 19:08:36,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:36,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108530672] [2024-10-24 19:08:36,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:36,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:36,671 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 19:08:36,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:36,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108530672] [2024-10-24 19:08:36,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108530672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:36,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:36,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:08:36,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629389872] [2024-10-24 19:08:36,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:36,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:08:36,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:36,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:08:36,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:08:36,900 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 128 [2024-10-24 19:08:36,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 86 transitions, 243 flow. Second operand has 5 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:36,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:36,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 128 [2024-10-24 19:08:36,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:37,045 INFO L124 PetriNetUnfolderBase]: 64/274 cut-off events. [2024-10-24 19:08:37,046 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-10-24 19:08:37,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 274 events. 64/274 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1110 event pairs, 63 based on Foata normal form. 1/232 useless extension candidates. Maximal degree in co-relation 484. Up to 170 conditions per place. [2024-10-24 19:08:37,047 INFO L140 encePairwiseOnDemand]: 116/128 looper letters, 40 selfloop transitions, 11 changer transitions 0/85 dead transitions. [2024-10-24 19:08:37,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 85 transitions, 343 flow [2024-10-24 19:08:37,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:08:37,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:08:37,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 417 transitions. [2024-10-24 19:08:37,049 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6515625 [2024-10-24 19:08:37,049 INFO L175 Difference]: Start difference. First operand has 104 places, 86 transitions, 243 flow. Second operand 5 states and 417 transitions. [2024-10-24 19:08:37,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 85 transitions, 343 flow [2024-10-24 19:08:37,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 85 transitions, 321 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 19:08:37,052 INFO L231 Difference]: Finished difference. Result has 103 places, 85 transitions, 241 flow [2024-10-24 19:08:37,052 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=103, PETRI_TRANSITIONS=85} [2024-10-24 19:08:37,053 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -27 predicate places. [2024-10-24 19:08:37,053 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 85 transitions, 241 flow [2024-10-24 19:08:37,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:37,053 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:37,054 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:37,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 19:08:37,054 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:37,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:37,054 INFO L85 PathProgramCache]: Analyzing trace with hash -2049875881, now seen corresponding path program 1 times [2024-10-24 19:08:37,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:37,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540355493] [2024-10-24 19:08:37,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:37,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 19:08:38,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:38,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540355493] [2024-10-24 19:08:38,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540355493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:38,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:38,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 19:08:38,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211065669] [2024-10-24 19:08:38,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:38,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 19:08:38,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:38,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 19:08:38,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-10-24 19:08:41,387 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 128 [2024-10-24 19:08:41,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 85 transitions, 241 flow. Second operand has 15 states, 15 states have (on average 45.666666666666664) internal successors, (685), 15 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:41,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:41,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 128 [2024-10-24 19:08:41,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:41,946 INFO L124 PetriNetUnfolderBase]: 64/272 cut-off events. [2024-10-24 19:08:41,946 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-10-24 19:08:41,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 272 events. 64/272 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1106 event pairs, 54 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 490. Up to 134 conditions per place. [2024-10-24 19:08:41,948 INFO L140 encePairwiseOnDemand]: 111/128 looper letters, 50 selfloop transitions, 15 changer transitions 3/92 dead transitions. [2024-10-24 19:08:41,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 92 transitions, 391 flow [2024-10-24 19:08:41,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 19:08:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-24 19:08:41,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 588 transitions. [2024-10-24 19:08:41,952 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3828125 [2024-10-24 19:08:41,952 INFO L175 Difference]: Start difference. First operand has 103 places, 85 transitions, 241 flow. Second operand 12 states and 588 transitions. [2024-10-24 19:08:41,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 92 transitions, 391 flow [2024-10-24 19:08:41,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 92 transitions, 369 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 19:08:41,958 INFO L231 Difference]: Finished difference. Result has 108 places, 83 transitions, 245 flow [2024-10-24 19:08:41,958 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=245, PETRI_PLACES=108, PETRI_TRANSITIONS=83} [2024-10-24 19:08:41,959 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -22 predicate places. [2024-10-24 19:08:41,959 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 83 transitions, 245 flow [2024-10-24 19:08:41,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 45.666666666666664) internal successors, (685), 15 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:41,959 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:41,960 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:41,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 19:08:41,960 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:41,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:41,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2049875882, now seen corresponding path program 1 times [2024-10-24 19:08:41,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:41,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401027523] [2024-10-24 19:08:41,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:41,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 19:08:42,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:42,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401027523] [2024-10-24 19:08:42,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401027523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:42,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:42,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 19:08:42,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827302409] [2024-10-24 19:08:42,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:42,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 19:08:42,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:42,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 19:08:42,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-24 19:08:43,292 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 128 [2024-10-24 19:08:43,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 83 transitions, 245 flow. Second operand has 10 states, 10 states have (on average 74.5) internal successors, (745), 10 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:43,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:43,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 128 [2024-10-24 19:08:43,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:43,507 INFO L124 PetriNetUnfolderBase]: 64/271 cut-off events. [2024-10-24 19:08:43,507 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-10-24 19:08:43,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 271 events. 64/271 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1109 event pairs, 54 based on Foata normal form. 1/231 useless extension candidates. Maximal degree in co-relation 500. Up to 133 conditions per place. [2024-10-24 19:08:43,509 INFO L140 encePairwiseOnDemand]: 115/128 looper letters, 52 selfloop transitions, 12 changer transitions 3/91 dead transitions. [2024-10-24 19:08:43,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 91 transitions, 393 flow [2024-10-24 19:08:43,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 19:08:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-24 19:08:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 634 transitions. [2024-10-24 19:08:43,512 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.619140625 [2024-10-24 19:08:43,512 INFO L175 Difference]: Start difference. First operand has 108 places, 83 transitions, 245 flow. Second operand 8 states and 634 transitions. [2024-10-24 19:08:43,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 91 transitions, 393 flow [2024-10-24 19:08:43,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 91 transitions, 365 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-10-24 19:08:43,516 INFO L231 Difference]: Finished difference. Result has 103 places, 82 transitions, 237 flow [2024-10-24 19:08:43,516 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=237, PETRI_PLACES=103, PETRI_TRANSITIONS=82} [2024-10-24 19:08:43,516 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -27 predicate places. [2024-10-24 19:08:43,516 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 82 transitions, 237 flow [2024-10-24 19:08:43,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 74.5) internal successors, (745), 10 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:43,518 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:43,518 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:43,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 19:08:43,518 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:43,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:43,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1459289247, now seen corresponding path program 1 times [2024-10-24 19:08:43,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:43,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100305423] [2024-10-24 19:08:43,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:43,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 19:08:43,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:43,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100305423] [2024-10-24 19:08:43,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100305423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:43,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:43,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:08:43,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928321862] [2024-10-24 19:08:43,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:43,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:08:43,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:43,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:08:43,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:08:43,887 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 128 [2024-10-24 19:08:43,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 82 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:43,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:43,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 128 [2024-10-24 19:08:43,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:44,042 INFO L124 PetriNetUnfolderBase]: 73/287 cut-off events. [2024-10-24 19:08:44,043 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-10-24 19:08:44,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 287 events. 73/287 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1176 event pairs, 45 based on Foata normal form. 2/246 useless extension candidates. Maximal degree in co-relation 529. Up to 108 conditions per place. [2024-10-24 19:08:44,044 INFO L140 encePairwiseOnDemand]: 109/128 looper letters, 47 selfloop transitions, 17 changer transitions 0/89 dead transitions. [2024-10-24 19:08:44,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 89 transitions, 379 flow [2024-10-24 19:08:44,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:08:44,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:08:44,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 401 transitions. [2024-10-24 19:08:44,046 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6265625 [2024-10-24 19:08:44,046 INFO L175 Difference]: Start difference. First operand has 103 places, 82 transitions, 237 flow. Second operand 5 states and 401 transitions. [2024-10-24 19:08:44,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 89 transitions, 379 flow [2024-10-24 19:08:44,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 89 transitions, 355 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-24 19:08:44,048 INFO L231 Difference]: Finished difference. Result has 98 places, 80 transitions, 243 flow [2024-10-24 19:08:44,048 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=98, PETRI_TRANSITIONS=80} [2024-10-24 19:08:44,049 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -32 predicate places. [2024-10-24 19:08:44,049 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 80 transitions, 243 flow [2024-10-24 19:08:44,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:44,049 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:44,049 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:44,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 19:08:44,049 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:44,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:44,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1459289248, now seen corresponding path program 1 times [2024-10-24 19:08:44,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:44,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144114541] [2024-10-24 19:08:44,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:44,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 19:08:44,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:44,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144114541] [2024-10-24 19:08:44,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144114541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:44,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:44,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:08:44,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342289338] [2024-10-24 19:08:44,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:44,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:08:44,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:44,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:08:44,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:08:44,507 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 128 [2024-10-24 19:08:44,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 80 transitions, 243 flow. Second operand has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:44,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:44,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 128 [2024-10-24 19:08:44,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:44,631 INFO L124 PetriNetUnfolderBase]: 73/274 cut-off events. [2024-10-24 19:08:44,631 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-10-24 19:08:44,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 274 events. 73/274 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1087 event pairs, 18 based on Foata normal form. 2/251 useless extension candidates. Maximal degree in co-relation 534. Up to 135 conditions per place. [2024-10-24 19:08:44,632 INFO L140 encePairwiseOnDemand]: 111/128 looper letters, 44 selfloop transitions, 15 changer transitions 0/87 dead transitions. [2024-10-24 19:08:44,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 87 transitions, 375 flow [2024-10-24 19:08:44,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:08:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:08:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 421 transitions. [2024-10-24 19:08:44,634 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6578125 [2024-10-24 19:08:44,634 INFO L175 Difference]: Start difference. First operand has 98 places, 80 transitions, 243 flow. Second operand 5 states and 421 transitions. [2024-10-24 19:08:44,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 87 transitions, 375 flow [2024-10-24 19:08:44,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 87 transitions, 341 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 19:08:44,636 INFO L231 Difference]: Finished difference. Result has 96 places, 78 transitions, 235 flow [2024-10-24 19:08:44,636 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=96, PETRI_TRANSITIONS=78} [2024-10-24 19:08:44,637 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -34 predicate places. [2024-10-24 19:08:44,637 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 78 transitions, 235 flow [2024-10-24 19:08:44,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:44,637 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:44,637 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:44,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 19:08:44,638 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:44,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:44,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1849635802, now seen corresponding path program 1 times [2024-10-24 19:08:44,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:44,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724100462] [2024-10-24 19:08:44,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:44,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:44,777 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 19:08:44,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:44,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724100462] [2024-10-24 19:08:44,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724100462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:44,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:44,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:08:44,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587312767] [2024-10-24 19:08:44,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:44,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:08:44,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:44,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:08:44,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:08:44,865 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 128 [2024-10-24 19:08:44,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 78 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:44,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:44,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 128 [2024-10-24 19:08:44,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:44,971 INFO L124 PetriNetUnfolderBase]: 71/277 cut-off events. [2024-10-24 19:08:44,971 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-10-24 19:08:44,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 277 events. 71/277 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1124 event pairs, 56 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 514. Up to 161 conditions per place. [2024-10-24 19:08:44,973 INFO L140 encePairwiseOnDemand]: 124/128 looper letters, 55 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2024-10-24 19:08:44,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 83 transitions, 361 flow [2024-10-24 19:08:44,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:08:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:08:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2024-10-24 19:08:44,974 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7994791666666666 [2024-10-24 19:08:44,974 INFO L175 Difference]: Start difference. First operand has 96 places, 78 transitions, 235 flow. Second operand 3 states and 307 transitions. [2024-10-24 19:08:44,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 83 transitions, 361 flow [2024-10-24 19:08:44,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 83 transitions, 329 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 19:08:44,977 INFO L231 Difference]: Finished difference. Result has 92 places, 76 transitions, 205 flow [2024-10-24 19:08:44,977 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=92, PETRI_TRANSITIONS=76} [2024-10-24 19:08:44,977 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -38 predicate places. [2024-10-24 19:08:44,977 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 76 transitions, 205 flow [2024-10-24 19:08:44,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:44,978 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:44,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 19:08:44,978 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:44,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:44,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1849635803, now seen corresponding path program 1 times [2024-10-24 19:08:44,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:44,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773164607] [2024-10-24 19:08:44,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:44,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:45,213 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 19:08:45,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:45,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773164607] [2024-10-24 19:08:45,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773164607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:45,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:45,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:08:45,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268431213] [2024-10-24 19:08:45,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:45,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:08:45,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:45,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:08:45,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:08:45,308 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 128 [2024-10-24 19:08:45,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 76 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:45,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:45,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 128 [2024-10-24 19:08:45,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:45,386 INFO L124 PetriNetUnfolderBase]: 64/254 cut-off events. [2024-10-24 19:08:45,386 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-10-24 19:08:45,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 254 events. 64/254 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 966 event pairs, 56 based on Foata normal form. 16/244 useless extension candidates. Maximal degree in co-relation 467. Up to 161 conditions per place. [2024-10-24 19:08:45,387 INFO L140 encePairwiseOnDemand]: 124/128 looper letters, 54 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2024-10-24 19:08:45,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 81 transitions, 327 flow [2024-10-24 19:08:45,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:08:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:08:45,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2024-10-24 19:08:45,388 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8046875 [2024-10-24 19:08:45,388 INFO L175 Difference]: Start difference. First operand has 92 places, 76 transitions, 205 flow. Second operand 3 states and 309 transitions. [2024-10-24 19:08:45,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 81 transitions, 327 flow [2024-10-24 19:08:45,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 81 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:08:45,390 INFO L231 Difference]: Finished difference. Result has 90 places, 74 transitions, 201 flow [2024-10-24 19:08:45,390 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=90, PETRI_TRANSITIONS=74} [2024-10-24 19:08:45,390 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -40 predicate places. [2024-10-24 19:08:45,391 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 74 transitions, 201 flow [2024-10-24 19:08:45,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:45,391 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:45,391 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:45,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 19:08:45,391 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:45,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:45,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1388089961, now seen corresponding path program 1 times [2024-10-24 19:08:45,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:45,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514521949] [2024-10-24 19:08:45,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:45,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:45,733 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 19:08:45,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:45,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514521949] [2024-10-24 19:08:45,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514521949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:45,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:45,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:08:45,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939280441] [2024-10-24 19:08:45,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:45,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:08:45,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:45,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:08:45,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:08:46,074 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 128 [2024-10-24 19:08:46,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 74 transitions, 201 flow. Second operand has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:46,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:46,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 128 [2024-10-24 19:08:46,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:46,264 INFO L124 PetriNetUnfolderBase]: 79/303 cut-off events. [2024-10-24 19:08:46,264 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-10-24 19:08:46,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 303 events. 79/303 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1281 event pairs, 30 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 555. Up to 163 conditions per place. [2024-10-24 19:08:46,266 INFO L140 encePairwiseOnDemand]: 117/128 looper letters, 58 selfloop transitions, 11 changer transitions 0/88 dead transitions. [2024-10-24 19:08:46,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 88 transitions, 371 flow [2024-10-24 19:08:46,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:08:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:08:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 510 transitions. [2024-10-24 19:08:46,268 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6640625 [2024-10-24 19:08:46,269 INFO L175 Difference]: Start difference. First operand has 90 places, 74 transitions, 201 flow. Second operand 6 states and 510 transitions. [2024-10-24 19:08:46,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 88 transitions, 371 flow [2024-10-24 19:08:46,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 88 transitions, 363 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:08:46,271 INFO L231 Difference]: Finished difference. Result has 95 places, 79 transitions, 247 flow [2024-10-24 19:08:46,271 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=247, PETRI_PLACES=95, PETRI_TRANSITIONS=79} [2024-10-24 19:08:46,272 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -35 predicate places. [2024-10-24 19:08:46,272 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 79 transitions, 247 flow [2024-10-24 19:08:46,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:46,272 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:46,272 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:46,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 19:08:46,273 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:46,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:46,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1388089960, now seen corresponding path program 1 times [2024-10-24 19:08:46,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:46,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464932748] [2024-10-24 19:08:46,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:46,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 19:08:46,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:46,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464932748] [2024-10-24 19:08:46,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464932748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:46,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:46,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:08:46,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099380478] [2024-10-24 19:08:46,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:46,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:08:46,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:46,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:08:46,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:08:46,763 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 128 [2024-10-24 19:08:46,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 79 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:46,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:46,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 128 [2024-10-24 19:08:46,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:46,935 INFO L124 PetriNetUnfolderBase]: 73/268 cut-off events. [2024-10-24 19:08:46,935 INFO L125 PetriNetUnfolderBase]: For 69/71 co-relation queries the response was YES. [2024-10-24 19:08:46,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 268 events. 73/268 cut-off events. For 69/71 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1005 event pairs, 47 based on Foata normal form. 10/255 useless extension candidates. Maximal degree in co-relation 557. Up to 131 conditions per place. [2024-10-24 19:08:46,937 INFO L140 encePairwiseOnDemand]: 117/128 looper letters, 59 selfloop transitions, 13 changer transitions 3/94 dead transitions. [2024-10-24 19:08:46,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 94 transitions, 427 flow [2024-10-24 19:08:46,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:08:46,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:08:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 513 transitions. [2024-10-24 19:08:46,939 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.66796875 [2024-10-24 19:08:46,939 INFO L175 Difference]: Start difference. First operand has 95 places, 79 transitions, 247 flow. Second operand 6 states and 513 transitions. [2024-10-24 19:08:46,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 94 transitions, 427 flow [2024-10-24 19:08:46,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 419 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:08:46,942 INFO L231 Difference]: Finished difference. Result has 97 places, 78 transitions, 263 flow [2024-10-24 19:08:46,942 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=263, PETRI_PLACES=97, PETRI_TRANSITIONS=78} [2024-10-24 19:08:46,942 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -33 predicate places. [2024-10-24 19:08:46,943 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 78 transitions, 263 flow [2024-10-24 19:08:46,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:46,943 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:46,943 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:46,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 19:08:46,944 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:46,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:46,944 INFO L85 PathProgramCache]: Analyzing trace with hash -616433637, now seen corresponding path program 1 times [2024-10-24 19:08:46,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:46,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750553563] [2024-10-24 19:08:46,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:46,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:47,919 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 19:08:47,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:47,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750553563] [2024-10-24 19:08:47,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750553563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:47,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:47,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 19:08:47,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851554002] [2024-10-24 19:08:47,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:47,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 19:08:47,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:47,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 19:08:47,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-24 19:08:48,876 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 128 [2024-10-24 19:08:48,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 78 transitions, 263 flow. Second operand has 12 states, 12 states have (on average 59.666666666666664) internal successors, (716), 12 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:48,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:48,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 128 [2024-10-24 19:08:48,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:49,108 INFO L124 PetriNetUnfolderBase]: 73/264 cut-off events. [2024-10-24 19:08:49,108 INFO L125 PetriNetUnfolderBase]: For 122/126 co-relation queries the response was YES. [2024-10-24 19:08:49,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 264 events. 73/264 cut-off events. For 122/126 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 996 event pairs, 39 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 581. Up to 153 conditions per place. [2024-10-24 19:08:49,110 INFO L140 encePairwiseOnDemand]: 109/128 looper letters, 49 selfloop transitions, 18 changer transitions 0/85 dead transitions. [2024-10-24 19:08:49,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 85 transitions, 428 flow [2024-10-24 19:08:49,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:08:49,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:08:49,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 395 transitions. [2024-10-24 19:08:49,112 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5143229166666666 [2024-10-24 19:08:49,112 INFO L175 Difference]: Start difference. First operand has 97 places, 78 transitions, 263 flow. Second operand 6 states and 395 transitions. [2024-10-24 19:08:49,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 85 transitions, 428 flow [2024-10-24 19:08:49,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 85 transitions, 396 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-24 19:08:49,118 INFO L231 Difference]: Finished difference. Result has 96 places, 77 transitions, 271 flow [2024-10-24 19:08:49,118 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=96, PETRI_TRANSITIONS=77} [2024-10-24 19:08:49,119 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -34 predicate places. [2024-10-24 19:08:49,119 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 77 transitions, 271 flow [2024-10-24 19:08:49,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 59.666666666666664) internal successors, (716), 12 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:49,119 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:49,119 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:49,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 19:08:49,120 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:49,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:49,120 INFO L85 PathProgramCache]: Analyzing trace with hash 81116520, now seen corresponding path program 1 times [2024-10-24 19:08:49,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:49,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133545087] [2024-10-24 19:08:49,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:49,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 19:08:52,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:52,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133545087] [2024-10-24 19:08:52,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133545087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:52,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:52,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2024-10-24 19:08:52,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554508963] [2024-10-24 19:08:52,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:52,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 19:08:52,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:52,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 19:08:52,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2024-10-24 19:08:58,285 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 128 [2024-10-24 19:08:58,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 77 transitions, 271 flow. Second operand has 26 states, 26 states have (on average 55.42307692307692) internal successors, (1441), 26 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:58,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:58,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 128 [2024-10-24 19:08:58,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:59,774 INFO L124 PetriNetUnfolderBase]: 103/326 cut-off events. [2024-10-24 19:08:59,774 INFO L125 PetriNetUnfolderBase]: For 92/98 co-relation queries the response was YES. [2024-10-24 19:08:59,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 326 events. 103/326 cut-off events. For 92/98 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1260 event pairs, 13 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 708. Up to 64 conditions per place. [2024-10-24 19:08:59,777 INFO L140 encePairwiseOnDemand]: 103/128 looper letters, 73 selfloop transitions, 31 changer transitions 3/117 dead transitions. [2024-10-24 19:08:59,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 117 transitions, 580 flow [2024-10-24 19:08:59,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-24 19:08:59,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-10-24 19:08:59,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1392 transitions. [2024-10-24 19:08:59,780 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.453125 [2024-10-24 19:08:59,780 INFO L175 Difference]: Start difference. First operand has 96 places, 77 transitions, 271 flow. Second operand 24 states and 1392 transitions. [2024-10-24 19:08:59,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 117 transitions, 580 flow [2024-10-24 19:08:59,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 117 transitions, 542 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 19:08:59,783 INFO L231 Difference]: Finished difference. Result has 119 places, 84 transitions, 344 flow [2024-10-24 19:08:59,784 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=344, PETRI_PLACES=119, PETRI_TRANSITIONS=84} [2024-10-24 19:08:59,784 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -11 predicate places. [2024-10-24 19:08:59,784 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 84 transitions, 344 flow [2024-10-24 19:08:59,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 55.42307692307692) internal successors, (1441), 26 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:59,785 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:59,785 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:59,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 19:08:59,786 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:08:59,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:59,786 INFO L85 PathProgramCache]: Analyzing trace with hash 81116521, now seen corresponding path program 1 times [2024-10-24 19:08:59,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:59,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782244037] [2024-10-24 19:08:59,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:59,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:09:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 19:09:02,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:09:02,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782244037] [2024-10-24 19:09:02,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782244037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:09:02,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:09:02,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-10-24 19:09:02,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433056714] [2024-10-24 19:09:02,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:09:02,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-24 19:09:02,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:09:02,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-24 19:09:02,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2024-10-24 19:09:07,362 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 128 [2024-10-24 19:09:07,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 84 transitions, 344 flow. Second operand has 25 states, 25 states have (on average 55.48) internal successors, (1387), 25 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:09:07,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:09:07,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 128 [2024-10-24 19:09:07,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:09:08,164 INFO L124 PetriNetUnfolderBase]: 124/385 cut-off events. [2024-10-24 19:09:08,164 INFO L125 PetriNetUnfolderBase]: For 210/216 co-relation queries the response was YES. [2024-10-24 19:09:08,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 977 conditions, 385 events. 124/385 cut-off events. For 210/216 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1634 event pairs, 13 based on Foata normal form. 12/374 useless extension candidates. Maximal degree in co-relation 952. Up to 75 conditions per place. [2024-10-24 19:09:08,166 INFO L140 encePairwiseOnDemand]: 103/128 looper letters, 75 selfloop transitions, 32 changer transitions 3/120 dead transitions. [2024-10-24 19:09:08,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 120 transitions, 649 flow [2024-10-24 19:09:08,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-24 19:09:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-10-24 19:09:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1395 transitions. [2024-10-24 19:09:08,169 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4541015625 [2024-10-24 19:09:08,169 INFO L175 Difference]: Start difference. First operand has 119 places, 84 transitions, 344 flow. Second operand 24 states and 1395 transitions. [2024-10-24 19:09:08,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 120 transitions, 649 flow [2024-10-24 19:09:08,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 120 transitions, 613 flow, removed 2 selfloop flow, removed 16 redundant places. [2024-10-24 19:09:08,173 INFO L231 Difference]: Finished difference. Result has 128 places, 85 transitions, 390 flow [2024-10-24 19:09:08,173 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=390, PETRI_PLACES=128, PETRI_TRANSITIONS=85} [2024-10-24 19:09:08,174 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -2 predicate places. [2024-10-24 19:09:08,174 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 85 transitions, 390 flow [2024-10-24 19:09:08,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 55.48) internal successors, (1387), 25 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:09:08,175 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:09:08,175 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:09:08,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-24 19:09:08,176 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-10-24 19:09:08,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:09:08,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1929572835, now seen corresponding path program 1 times [2024-10-24 19:09:08,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:09:08,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074174601] [2024-10-24 19:09:08,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:09:08,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:09:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:09:08,288 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 19:09:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:09:08,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 19:09:08,454 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 19:09:08,455 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 88 remaining) [2024-10-24 19:09:08,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 88 remaining) [2024-10-24 19:09:08,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 88 remaining) [2024-10-24 19:09:08,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 88 remaining) [2024-10-24 19:09:08,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 88 remaining) [2024-10-24 19:09:08,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 88 remaining) [2024-10-24 19:09:08,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 88 remaining) [2024-10-24 19:09:08,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 88 remaining) [2024-10-24 19:09:08,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 88 remaining) [2024-10-24 19:09:08,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 88 remaining) [2024-10-24 19:09:08,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 88 remaining) [2024-10-24 19:09:08,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 88 remaining) [2024-10-24 19:09:08,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 88 remaining) [2024-10-24 19:09:08,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 88 remaining) [2024-10-24 19:09:08,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 88 remaining) [2024-10-24 19:09:08,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 88 remaining) [2024-10-24 19:09:08,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 88 remaining) [2024-10-24 19:09:08,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 88 remaining) [2024-10-24 19:09:08,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 88 remaining) [2024-10-24 19:09:08,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 88 remaining) [2024-10-24 19:09:08,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 88 remaining) [2024-10-24 19:09:08,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 88 remaining) [2024-10-24 19:09:08,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 88 remaining) [2024-10-24 19:09:08,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 88 remaining) [2024-10-24 19:09:08,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 88 remaining) [2024-10-24 19:09:08,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 88 remaining) [2024-10-24 19:09:08,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 88 remaining) [2024-10-24 19:09:08,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 88 remaining) [2024-10-24 19:09:08,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 88 remaining) [2024-10-24 19:09:08,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 88 remaining) [2024-10-24 19:09:08,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 88 remaining) [2024-10-24 19:09:08,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 88 remaining) [2024-10-24 19:09:08,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 88 remaining) [2024-10-24 19:09:08,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 88 remaining) [2024-10-24 19:09:08,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 88 remaining) [2024-10-24 19:09:08,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 88 remaining) [2024-10-24 19:09:08,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 88 remaining) [2024-10-24 19:09:08,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 88 remaining) [2024-10-24 19:09:08,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 88 remaining) [2024-10-24 19:09:08,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 88 remaining) [2024-10-24 19:09:08,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 88 remaining) [2024-10-24 19:09:08,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 88 remaining) [2024-10-24 19:09:08,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 88 remaining) [2024-10-24 19:09:08,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 88 remaining) [2024-10-24 19:09:08,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 88 remaining) [2024-10-24 19:09:08,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 88 remaining) [2024-10-24 19:09:08,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 88 remaining) [2024-10-24 19:09:08,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 88 remaining) [2024-10-24 19:09:08,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 88 remaining) [2024-10-24 19:09:08,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 88 remaining) [2024-10-24 19:09:08,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 88 remaining) [2024-10-24 19:09:08,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 88 remaining) [2024-10-24 19:09:08,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 88 remaining) [2024-10-24 19:09:08,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 88 remaining) [2024-10-24 19:09:08,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 88 remaining) [2024-10-24 19:09:08,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 88 remaining) [2024-10-24 19:09:08,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 88 remaining) [2024-10-24 19:09:08,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 88 remaining) [2024-10-24 19:09:08,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 88 remaining) [2024-10-24 19:09:08,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 88 remaining) [2024-10-24 19:09:08,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 88 remaining) [2024-10-24 19:09:08,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 88 remaining) [2024-10-24 19:09:08,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 88 remaining) [2024-10-24 19:09:08,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK (24 of 88 remaining) [2024-10-24 19:09:08,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 88 remaining) [2024-10-24 19:09:08,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 88 remaining) [2024-10-24 19:09:08,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 88 remaining) [2024-10-24 19:09:08,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 88 remaining) [2024-10-24 19:09:08,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 88 remaining) [2024-10-24 19:09:08,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 88 remaining) [2024-10-24 19:09:08,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 88 remaining) [2024-10-24 19:09:08,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 88 remaining) [2024-10-24 19:09:08,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 88 remaining) [2024-10-24 19:09:08,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 88 remaining) [2024-10-24 19:09:08,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 88 remaining) [2024-10-24 19:09:08,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 88 remaining) [2024-10-24 19:09:08,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 88 remaining) [2024-10-24 19:09:08,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 88 remaining) [2024-10-24 19:09:08,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 88 remaining) [2024-10-24 19:09:08,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 88 remaining) [2024-10-24 19:09:08,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 88 remaining) [2024-10-24 19:09:08,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 88 remaining) [2024-10-24 19:09:08,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 88 remaining) [2024-10-24 19:09:08,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 88 remaining) [2024-10-24 19:09:08,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 88 remaining) [2024-10-24 19:09:08,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 88 remaining) [2024-10-24 19:09:08,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 88 remaining) [2024-10-24 19:09:08,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 88 remaining) [2024-10-24 19:09:08,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-24 19:09:08,472 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:09:08,535 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 19:09:08,535 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 19:09:08,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:09:08 BasicIcfg [2024-10-24 19:09:08,543 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 19:09:08,543 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 19:09:08,543 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 19:09:08,544 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 19:09:08,544 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:08:24" (3/4) ... [2024-10-24 19:09:08,545 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 19:09:08,614 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 19:09:08,614 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 19:09:08,615 INFO L158 Benchmark]: Toolchain (without parser) took 46078.97ms. Allocated memory was 207.6MB in the beginning and 696.3MB in the end (delta: 488.6MB). Free memory was 138.7MB in the beginning and 320.6MB in the end (delta: -181.9MB). Peak memory consumption was 307.4MB. Max. memory is 16.1GB. [2024-10-24 19:09:08,615 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:09:08,616 INFO L158 Benchmark]: CACSL2BoogieTranslator took 856.41ms. Allocated memory is still 207.6MB. Free memory was 138.4MB in the beginning and 171.7MB in the end (delta: -33.3MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2024-10-24 19:09:08,616 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.22ms. Allocated memory is still 207.6MB. Free memory was 171.7MB in the beginning and 167.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 19:09:08,616 INFO L158 Benchmark]: Boogie Preprocessor took 71.34ms. Allocated memory is still 207.6MB. Free memory was 167.6MB in the beginning and 163.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 19:09:08,616 INFO L158 Benchmark]: RCFGBuilder took 992.80ms. Allocated memory is still 207.6MB. Free memory was 163.5MB in the beginning and 167.0MB in the end (delta: -3.5MB). Peak memory consumption was 90.7MB. Max. memory is 16.1GB. [2024-10-24 19:09:08,617 INFO L158 Benchmark]: TraceAbstraction took 43981.88ms. Allocated memory was 207.6MB in the beginning and 696.3MB in the end (delta: 488.6MB). Free memory was 167.0MB in the beginning and 329.0MB in the end (delta: -162.0MB). Peak memory consumption was 326.6MB. Max. memory is 16.1GB. [2024-10-24 19:09:08,617 INFO L158 Benchmark]: Witness Printer took 71.21ms. Allocated memory is still 696.3MB. Free memory was 329.0MB in the beginning and 320.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 19:09:08,618 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 856.41ms. Allocated memory is still 207.6MB. Free memory was 138.4MB in the beginning and 171.7MB in the end (delta: -33.3MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.22ms. Allocated memory is still 207.6MB. Free memory was 171.7MB in the beginning and 167.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.34ms. Allocated memory is still 207.6MB. Free memory was 167.6MB in the beginning and 163.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 992.80ms. Allocated memory is still 207.6MB. Free memory was 163.5MB in the beginning and 167.0MB in the end (delta: -3.5MB). Peak memory consumption was 90.7MB. Max. memory is 16.1GB. * TraceAbstraction took 43981.88ms. Allocated memory was 207.6MB in the beginning and 696.3MB in the end (delta: 488.6MB). Free memory was 167.0MB in the beginning and 329.0MB in the end (delta: -162.0MB). Peak memory consumption was 326.6MB. Max. memory is 16.1GB. * Witness Printer took 71.21ms. Allocated memory is still 696.3MB. Free memory was 329.0MB in the beginning and 320.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1254] 0 int i = 0; VAL [i=0, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=1, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=2, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=3, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=4, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=5, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=6, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=7, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=8, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=9, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=10, mutex={1:0}, slot={2:0}] [L1254] COND FALSE 0 !(i < 10) [L1256] 0 int j = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(); [L1256] 0 int j = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(); [L1257] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1257] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1258] CALL 0 assume_abort_if_not(0 <= k && k < 10) [L11] COND FALSE 0 !(!cond) [L1258] RET 0 assume_abort_if_not(0 <= k && k < 10) [L1259] 0 struct s *p; [L1260] 0 pthread_t t1; [L1261] CALL, EXPR 0 new(1) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1261] RET, EXPR 0 new(1) [L1261] 0 slot[j] = new(1) [L1262] CALL, EXPR 0 new(2) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1262] RET, EXPR 0 new(2) [L1262] EXPR 0 slot[j] [L1262] CALL 0 list_add(new(2), slot[j]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [mutex={1:0}, slot={2:0}] [L1241] 0 node->next = temp [L1262] RET 0 list_add(new(2), slot[j]) [L1263] CALL, EXPR 0 new(1) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1263] RET, EXPR 0 new(1) [L1263] 0 slot[k] = new(1) [L1264] CALL, EXPR 0 new(2) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1264] RET, EXPR 0 new(2) [L1264] EXPR 0 slot[k] [L1264] CALL 0 list_add(new(2), slot[k]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [mutex={1:0}, slot={2:0}] [L1241] 0 node->next = temp [L1264] RET 0 list_add(new(2), slot[k]) [L1265] CALL, EXPR 0 new(3) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1265] RET, EXPR 0 new(3) [L1265] 0 p = new(3) [L1266] EXPR 0 slot[j] [L1266] CALL 0 list_add(p, slot[j]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [mutex={1:0}, slot={2:0}] [L1241] 0 node->next = temp [L1266] RET 0 list_add(p, slot[j]) [L1267] EXPR 0 slot[k] [L1267] CALL 0 list_add(p, slot[k]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [mutex={1:0}, slot={2:0}] [L1241] 0 node->next = temp [L1267] RET 0 list_add(p, slot[k]) [L1268] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [j=9, k=9, mutex={1:0}, p={-3:0}, slot={2:0}, t1=-1] [L1246] 1 int i = __VERIFIER_nondet_int(); [L1247] CALL 1 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 1 !(!cond) [L1247] RET 1 assume_abort_if_not(0 <= i && i < 10) [L1249] CALL, EXPR 1 new(3) [L1233] 1 struct s *p = malloc(sizeof(struct s)); [L1234] 1 p->datum = x VAL [\old(arg)={0:0}, arg={0:0}, i=7, mutex={1:0}, slot={2:0}] [L1235] 1 p->next = ((void *)0) [L1236] 1 return p; [L1249] RET, EXPR 1 new(3) [L1249] EXPR 1 slot[i] [L1249] CALL 1 list_add(new(3), slot[i]) [L1239] 1 list->next - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1253]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1268]: 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, 153 locations, 88 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: 43.8s, OverallIterations: 28, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12770 SdHoareTripleChecker+Valid, 23.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9892 mSDsluCounter, 9806 SdHoareTripleChecker+Invalid, 20.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9043 mSDsCounter, 721 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45619 IncrementalHoareTripleChecker+Invalid, 46340 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 721 mSolverCounterUnsat, 763 mSDtfsCounter, 45619 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 273 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390occurred in iteration=27, InterpolantAutomatonStates: 192, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 806 NumberOfCodeBlocks, 806 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 738 ConstructedInterpolants, 0 QuantifiedInterpolants, 7874 SizeOfPredicates, 0 NumberOfNonLiveVariables, 143 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 31 InterpolantComputations, 25 PerfectInterpolantSequences, 1275/1308 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-24 19:09:08,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)