./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../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 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '573c853979782f78b60122afde2824ab47c3f9d6394b4ee74285d458320f7321'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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.3.0-?-4f9af40 [2024-11-07 19:22:58,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:22:58,507 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 19:22:58,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:22:58,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:22:58,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:22:58,543 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:22:58,543 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:22:58,544 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:22:58,544 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:22:58,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:22:58,545 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:22:58,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:22:58,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:22:58,546 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:22:58,546 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:22:58,546 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:22:58,546 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:22:58,547 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:22:58,547 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:22:58,547 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:22:58,547 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:22:58,547 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:22:58,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:22:58,547 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:22:58,547 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:22:58,548 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:22:58,548 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:22:58,548 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:22:58,548 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:22:58,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:22:58,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:22:58,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:22:58,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:22:58,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:22:58,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:22:58,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:22:58,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:22:58,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:22:58,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:22:58,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:22:58,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:22:58,550 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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-11-07 19:22:58,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:22:58,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:22:58,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:22:58,832 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:22:58,832 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:22:58,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.i [2024-11-07 19:23:00,099 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:23:00,442 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:23:00,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.i [2024-11-07 19:23:00,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e6903a53c/6aadc56d003d4525a994cb649431e55e/FLAGc14d4e1b5 [2024-11-07 19:23:00,664 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e6903a53c/6aadc56d003d4525a994cb649431e55e [2024-11-07 19:23:00,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:23:00,667 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:23:00,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:23:00,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:23:00,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:23:00,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:23:00" (1/1) ... [2024-11-07 19:23:00,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d0a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:00, skipping insertion in model container [2024-11-07 19:23:00,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:23:00" (1/1) ... [2024-11-07 19:23:00,716 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:23:01,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:23:01,125 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:23:01,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:23:01,282 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:23:01,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:01 WrapperNode [2024-11-07 19:23:01,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:23:01,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:23:01,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:23:01,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:23:01,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:01" (1/1) ... [2024-11-07 19:23:01,304 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:01" (1/1) ... [2024-11-07 19:23:01,336 INFO L138 Inliner]: procedures = 372, calls = 99, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 249 [2024-11-07 19:23:01,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:23:01,338 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:23:01,338 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:23:01,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:23:01,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:01" (1/1) ... [2024-11-07 19:23:01,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:01" (1/1) ... [2024-11-07 19:23:01,360 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:01" (1/1) ... [2024-11-07 19:23:01,404 INFO L175 MemorySlicer]: Split 97 memory accesses to 3 slices as follows [50, 18, 29]. 52 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 24 writes are split as follows [0, 2, 22]. [2024-11-07 19:23:01,404 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:01" (1/1) ... [2024-11-07 19:23:01,404 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:01" (1/1) ... [2024-11-07 19:23:01,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:01" (1/1) ... [2024-11-07 19:23:01,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:01" (1/1) ... [2024-11-07 19:23:01,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:01" (1/1) ... [2024-11-07 19:23:01,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:01" (1/1) ... [2024-11-07 19:23:01,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:23:01,438 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:23:01,439 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:23:01,439 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:23:01,440 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:01" (1/1) ... [2024-11-07 19:23:01,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:23:01,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:23:01,472 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 19:23:01,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 19:23:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 19:23:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 19:23:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 19:23:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-07 19:23:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-07 19:23:01,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-07 19:23:01,499 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-07 19:23:01,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 19:23:01,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 19:23:01,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 19:23:01,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 19:23:01,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 19:23:01,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 19:23:01,500 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-07 19:23:01,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 19:23:01,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:23:01,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 19:23:01,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 19:23:01,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 19:23:01,500 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-07 19:23:01,500 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-07 19:23:01,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 19:23:01,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 19:23:01,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 19:23:01,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:23:01,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:23:01,503 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 19:23:01,684 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:23:01,685 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:23:02,297 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:23:02,297 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:23:02,728 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:23:02,729 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 19:23:02,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:23:02 BoogieIcfgContainer [2024-11-07 19:23:02,730 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:23:02,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:23:02,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:23:02,738 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:23:02,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:23:00" (1/3) ... [2024-11-07 19:23:02,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ec8c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:23:02, skipping insertion in model container [2024-11-07 19:23:02,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:23:01" (2/3) ... [2024-11-07 19:23:02,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ec8c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:23:02, skipping insertion in model container [2024-11-07 19:23:02,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:23:02" (3/3) ... [2024-11-07 19:23:02,741 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_12-arraycollapse_rc-deref.i [2024-11-07 19:23:02,756 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:23:02,756 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 75 error locations. [2024-11-07 19:23:02,757 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:23:02,833 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 19:23:02,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 128 transitions, 260 flow [2024-11-07 19:23:02,929 INFO L124 PetriNetUnfolderBase]: 1/127 cut-off events. [2024-11-07 19:23:02,931 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:23:02,935 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-11-07 19:23:02,935 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 128 transitions, 260 flow [2024-11-07 19:23:02,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 127 transitions, 257 flow [2024-11-07 19:23:02,948 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:23:02,962 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;@7ec3e591, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:23:02,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2024-11-07 19:23:02,967 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:23:02,967 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-07 19:23:02,967 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:23:02,967 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:02,968 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-07 19:23:02,968 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-11-07 19:23:02,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:02,973 INFO L85 PathProgramCache]: Analyzing trace with hash 727376, now seen corresponding path program 1 times [2024-11-07 19:23:02,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:02,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686450741] [2024-11-07 19:23:02,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:02,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:03,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:23:03,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:03,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686450741] [2024-11-07 19:23:03,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686450741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:03,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:03,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:23:03,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400776180] [2024-11-07 19:23:03,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:03,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:23:03,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:03,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:23:03,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:23:03,345 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 128 [2024-11-07 19:23:03,350 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-11-07 19:23:03,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:03,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 128 [2024-11-07 19:23:03,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:03,539 INFO L124 PetriNetUnfolderBase]: 64/324 cut-off events. [2024-11-07 19:23:03,542 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:23:03,543 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-11-07 19:23:03,546 INFO L140 encePairwiseOnDemand]: 125/128 looper letters, 38 selfloop transitions, 2 changer transitions 0/128 dead transitions. [2024-11-07 19:23:03,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 128 transitions, 339 flow [2024-11-07 19:23:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:23:03,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:23:03,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2024-11-07 19:23:03,562 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8020833333333334 [2024-11-07 19:23:03,564 INFO L175 Difference]: Start difference. First operand has 130 places, 127 transitions, 257 flow. Second operand 3 states and 308 transitions. [2024-11-07 19:23:03,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 128 transitions, 339 flow [2024-11-07 19:23:03,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 128 transitions, 338 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:23:03,574 INFO L231 Difference]: Finished difference. Result has 132 places, 128 transitions, 268 flow [2024-11-07 19:23:03,577 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-11-07 19:23:03,581 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2024-11-07 19:23:03,582 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 128 transitions, 268 flow [2024-11-07 19:23:03,583 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-11-07 19:23:03,583 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:03,583 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-07 19:23:03,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 19:23:03,584 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-11-07 19:23:03,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:03,585 INFO L85 PathProgramCache]: Analyzing trace with hash 22544959, now seen corresponding path program 1 times [2024-11-07 19:23:03,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:03,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716356734] [2024-11-07 19:23:03,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:03,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:03,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:23:03,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:03,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716356734] [2024-11-07 19:23:03,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716356734] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:23:03,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566334036] [2024-11-07 19:23:03,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:03,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:23:03,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:23:03,742 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:23:03,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 19:23:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:03,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:23:03,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:23:03,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:23:03,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:23:03,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:23:03,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566334036] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:23:03,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:23:03,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-07 19:23:03,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049032056] [2024-11-07 19:23:03,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:23:03,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:23:03,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:03,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:23:03,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:23:03,919 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 128 [2024-11-07 19:23:03,920 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-11-07 19:23:03,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:03,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 128 [2024-11-07 19:23:03,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:04,137 INFO L124 PetriNetUnfolderBase]: 64/327 cut-off events. [2024-11-07 19:23:04,137 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:23:04,141 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-11-07 19:23:04,143 INFO L140 encePairwiseOnDemand]: 125/128 looper letters, 38 selfloop transitions, 5 changer transitions 0/131 dead transitions. [2024-11-07 19:23:04,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 131 transitions, 366 flow [2024-11-07 19:23:04,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:23:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:23:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 580 transitions. [2024-11-07 19:23:04,149 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7552083333333334 [2024-11-07 19:23:04,149 INFO L175 Difference]: Start difference. First operand has 132 places, 128 transitions, 268 flow. Second operand 6 states and 580 transitions. [2024-11-07 19:23:04,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 131 transitions, 366 flow [2024-11-07 19:23:04,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 131 transitions, 362 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-07 19:23:04,173 INFO L231 Difference]: Finished difference. Result has 139 places, 131 transitions, 300 flow [2024-11-07 19:23:04,173 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-11-07 19:23:04,174 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, 9 predicate places. [2024-11-07 19:23:04,174 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 131 transitions, 300 flow [2024-11-07 19:23:04,174 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-11-07 19:23:04,175 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:04,175 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2024-11-07 19:23:04,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 19:23:04,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:23:04,379 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-11-07 19:23:04,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:04,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1618304272, now seen corresponding path program 2 times [2024-11-07 19:23:04,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:04,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791573764] [2024-11-07 19:23:04,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:04,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 19:23:04,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:04,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791573764] [2024-11-07 19:23:04,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791573764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:04,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:04,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:23:04,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005728454] [2024-11-07 19:23:04,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:04,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:23:04,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:04,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:23:04,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:23:04,636 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 128 [2024-11-07 19:23:04,637 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-11-07 19:23:04,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:04,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 128 [2024-11-07 19:23:04,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:04,790 INFO L124 PetriNetUnfolderBase]: 64/317 cut-off events. [2024-11-07 19:23:04,790 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 19:23:04,791 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-11-07 19:23:04,793 INFO L140 encePairwiseOnDemand]: 108/128 looper letters, 38 selfloop transitions, 10 changer transitions 0/121 dead transitions. [2024-11-07 19:23:04,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 121 transitions, 376 flow [2024-11-07 19:23:04,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:23:04,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:23:04,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2024-11-07 19:23:04,798 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.71875 [2024-11-07 19:23:04,799 INFO L175 Difference]: Start difference. First operand has 139 places, 131 transitions, 300 flow. Second operand 3 states and 276 transitions. [2024-11-07 19:23:04,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 121 transitions, 376 flow [2024-11-07 19:23:04,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 121 transitions, 362 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-07 19:23:04,805 INFO L231 Difference]: Finished difference. Result has 130 places, 121 transitions, 286 flow [2024-11-07 19:23:04,805 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-11-07 19:23:04,806 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, 0 predicate places. [2024-11-07 19:23:04,806 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 121 transitions, 286 flow [2024-11-07 19:23:04,807 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-11-07 19:23:04,807 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:04,807 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2024-11-07 19:23:04,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 19:23:04,807 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-11-07 19:23:04,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:04,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1618304273, now seen corresponding path program 1 times [2024-11-07 19:23:04,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:04,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772480030] [2024-11-07 19:23:04,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:04,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:04,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:23:04,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:04,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772480030] [2024-11-07 19:23:04,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772480030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:23:04,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509300362] [2024-11-07 19:23:04,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:04,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:23:04,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:23:04,988 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:23:04,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 19:23:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:05,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:23:05,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:23:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:23:05,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:23:05,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:23:05,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509300362] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:23:05,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:23:05,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-07 19:23:05,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35026568] [2024-11-07 19:23:05,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:23:05,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 19:23:05,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:05,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 19:23:05,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-07 19:23:05,213 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 128 [2024-11-07 19:23:05,215 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-11-07 19:23:05,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:05,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 128 [2024-11-07 19:23:05,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:05,349 INFO L124 PetriNetUnfolderBase]: 64/323 cut-off events. [2024-11-07 19:23:05,350 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2024-11-07 19:23:05,351 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-11-07 19:23:05,352 INFO L140 encePairwiseOnDemand]: 125/128 looper letters, 38 selfloop transitions, 11 changer transitions 0/127 dead transitions. [2024-11-07 19:23:05,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 127 transitions, 420 flow [2024-11-07 19:23:05,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 19:23:05,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-07 19:23:05,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1123 transitions. [2024-11-07 19:23:05,355 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7311197916666666 [2024-11-07 19:23:05,355 INFO L175 Difference]: Start difference. First operand has 130 places, 121 transitions, 286 flow. Second operand 12 states and 1123 transitions. [2024-11-07 19:23:05,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 127 transitions, 420 flow [2024-11-07 19:23:05,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 127 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:23:05,362 INFO L231 Difference]: Finished difference. Result has 145 places, 127 transitions, 350 flow [2024-11-07 19:23:05,365 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-11-07 19:23:05,366 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, 15 predicate places. [2024-11-07 19:23:05,366 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 127 transitions, 350 flow [2024-11-07 19:23:05,367 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-11-07 19:23:05,367 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:05,368 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2024-11-07 19:23:05,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 19:23:05,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:23:05,569 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-11-07 19:23:05,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:05,569 INFO L85 PathProgramCache]: Analyzing trace with hash -274137423, now seen corresponding path program 2 times [2024-11-07 19:23:05,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:05,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440599293] [2024-11-07 19:23:05,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:05,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:05,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:05,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440599293] [2024-11-07 19:23:05,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440599293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:05,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:05,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:23:05,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255301818] [2024-11-07 19:23:05,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:05,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:23:05,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:05,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:23:05,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:23:05,827 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 128 [2024-11-07 19:23:05,827 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-11-07 19:23:05,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:05,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 128 [2024-11-07 19:23:05,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:05,966 INFO L124 PetriNetUnfolderBase]: 64/313 cut-off events. [2024-11-07 19:23:05,967 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-07 19:23:05,967 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-11-07 19:23:05,969 INFO L140 encePairwiseOnDemand]: 108/128 looper letters, 39 selfloop transitions, 10 changer transitions 0/117 dead transitions. [2024-11-07 19:23:05,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 117 transitions, 428 flow [2024-11-07 19:23:05,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:23:05,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:23:05,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2024-11-07 19:23:05,973 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7447916666666666 [2024-11-07 19:23:05,973 INFO L175 Difference]: Start difference. First operand has 145 places, 127 transitions, 350 flow. Second operand 3 states and 286 transitions. [2024-11-07 19:23:05,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 117 transitions, 428 flow [2024-11-07 19:23:05,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 117 transitions, 380 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-11-07 19:23:05,979 INFO L231 Difference]: Finished difference. Result has 132 places, 117 transitions, 302 flow [2024-11-07 19:23:05,979 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-11-07 19:23:05,980 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2024-11-07 19:23:05,981 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 117 transitions, 302 flow [2024-11-07 19:23:05,981 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-11-07 19:23:05,981 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:05,981 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2024-11-07 19:23:05,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 19:23:05,982 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-11-07 19:23:05,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:05,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1453035888, now seen corresponding path program 1 times [2024-11-07 19:23:05,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:05,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244325863] [2024-11-07 19:23:05,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:05,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:06,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:06,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244325863] [2024-11-07 19:23:06,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244325863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:06,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:06,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:23:06,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057822032] [2024-11-07 19:23:06,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:06,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:23:06,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:06,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:23:06,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:23:06,656 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 128 [2024-11-07 19:23:06,657 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-11-07 19:23:06,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:06,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 128 [2024-11-07 19:23:06,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:06,779 INFO L124 PetriNetUnfolderBase]: 73/327 cut-off events. [2024-11-07 19:23:06,779 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-07 19:23:06,780 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-11-07 19:23:06,787 INFO L140 encePairwiseOnDemand]: 119/128 looper letters, 54 selfloop transitions, 1 changer transitions 0/109 dead transitions. [2024-11-07 19:23:06,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 109 transitions, 396 flow [2024-11-07 19:23:06,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:23:06,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:23:06,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2024-11-07 19:23:06,794 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7239583333333334 [2024-11-07 19:23:06,794 INFO L175 Difference]: Start difference. First operand has 132 places, 117 transitions, 302 flow. Second operand 3 states and 278 transitions. [2024-11-07 19:23:06,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 109 transitions, 396 flow [2024-11-07 19:23:06,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 109 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:23:06,798 INFO L231 Difference]: Finished difference. Result has 124 places, 109 transitions, 268 flow [2024-11-07 19:23:06,801 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-11-07 19:23:06,802 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -6 predicate places. [2024-11-07 19:23:06,802 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 109 transitions, 268 flow [2024-11-07 19:23:06,802 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-11-07 19:23:06,802 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:06,802 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2024-11-07 19:23:06,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 19:23:06,803 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-11-07 19:23:06,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:06,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1453035887, now seen corresponding path program 1 times [2024-11-07 19:23:06,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:06,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076454821] [2024-11-07 19:23:06,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:06,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:07,071 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:07,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:07,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076454821] [2024-11-07 19:23:07,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076454821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:07,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:07,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:23:07,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123550096] [2024-11-07 19:23:07,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:07,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:23:07,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:07,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:23:07,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:23:07,345 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 128 [2024-11-07 19:23:07,345 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-11-07 19:23:07,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:07,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 128 [2024-11-07 19:23:07,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:07,514 INFO L124 PetriNetUnfolderBase]: 73/321 cut-off events. [2024-11-07 19:23:07,514 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-11-07 19:23:07,515 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-11-07 19:23:07,517 INFO L140 encePairwiseOnDemand]: 112/128 looper letters, 44 selfloop transitions, 12 changer transitions 3/114 dead transitions. [2024-11-07 19:23:07,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 114 transitions, 396 flow [2024-11-07 19:23:07,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:23:07,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:23:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2024-11-07 19:23:07,520 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6765625 [2024-11-07 19:23:07,520 INFO L175 Difference]: Start difference. First operand has 124 places, 109 transitions, 268 flow. Second operand 5 states and 433 transitions. [2024-11-07 19:23:07,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 114 transitions, 396 flow [2024-11-07 19:23:07,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 114 transitions, 395 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:23:07,524 INFO L231 Difference]: Finished difference. Result has 123 places, 105 transitions, 283 flow [2024-11-07 19:23:07,524 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-11-07 19:23:07,525 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -7 predicate places. [2024-11-07 19:23:07,526 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 105 transitions, 283 flow [2024-11-07 19:23:07,526 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-11-07 19:23:07,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:07,526 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:07,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 19:23:07,527 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-11-07 19:23:07,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:07,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1859092806, now seen corresponding path program 1 times [2024-11-07 19:23:07,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:07,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986314905] [2024-11-07 19:23:07,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:07,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:07,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:07,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986314905] [2024-11-07 19:23:07,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986314905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:07,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:07,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:23:07,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94653762] [2024-11-07 19:23:07,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:07,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:23:07,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:07,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:23:07,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:23:08,298 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 128 [2024-11-07 19:23:08,299 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-11-07 19:23:08,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:08,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 128 [2024-11-07 19:23:08,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:08,554 INFO L124 PetriNetUnfolderBase]: 64/289 cut-off events. [2024-11-07 19:23:08,555 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-07 19:23:08,555 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-11-07 19:23:08,556 INFO L140 encePairwiseOnDemand]: 107/128 looper letters, 45 selfloop transitions, 16 changer transitions 0/100 dead transitions. [2024-11-07 19:23:08,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 100 transitions, 395 flow [2024-11-07 19:23:08,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:23:08,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:23:08,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 552 transitions. [2024-11-07 19:23:08,558 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5390625 [2024-11-07 19:23:08,558 INFO L175 Difference]: Start difference. First operand has 123 places, 105 transitions, 283 flow. Second operand 8 states and 552 transitions. [2024-11-07 19:23:08,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 100 transitions, 395 flow [2024-11-07 19:23:08,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 100 transitions, 371 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:23:08,561 INFO L231 Difference]: Finished difference. Result has 121 places, 100 transitions, 281 flow [2024-11-07 19:23:08,562 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-11-07 19:23:08,563 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -9 predicate places. [2024-11-07 19:23:08,563 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 100 transitions, 281 flow [2024-11-07 19:23:08,564 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-11-07 19:23:08,564 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:08,564 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:08,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 19:23:08,564 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-11-07 19:23:08,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:08,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1859092807, now seen corresponding path program 1 times [2024-11-07 19:23:08,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:08,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842703060] [2024-11-07 19:23:08,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:08,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:09,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:09,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842703060] [2024-11-07 19:23:09,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842703060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:09,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:09,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:23:09,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799822960] [2024-11-07 19:23:09,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:09,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:23:09,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:09,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:23:09,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:23:09,599 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 128 [2024-11-07 19:23:09,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 100 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 72.33333333333333) internal successors, (434), 6 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:09,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:09,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 128 [2024-11-07 19:23:09,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:09,805 INFO L124 PetriNetUnfolderBase]: 64/287 cut-off events. [2024-11-07 19:23:09,805 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-11-07 19:23:09,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 287 events. 64/287 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1126 event pairs, 63 based on Foata normal form. 1/245 useless extension candidates. Maximal degree in co-relation 506. Up to 172 conditions per place. [2024-11-07 19:23:09,807 INFO L140 encePairwiseOnDemand]: 115/128 looper letters, 44 selfloop transitions, 11 changer transitions 0/98 dead transitions. [2024-11-07 19:23:09,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 98 transitions, 387 flow [2024-11-07 19:23:09,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:23:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:23:09,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 544 transitions. [2024-11-07 19:23:09,809 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2024-11-07 19:23:09,809 INFO L175 Difference]: Start difference. First operand has 121 places, 100 transitions, 281 flow. Second operand 7 states and 544 transitions. [2024-11-07 19:23:09,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 98 transitions, 387 flow [2024-11-07 19:23:09,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 98 transitions, 355 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-07 19:23:09,812 INFO L231 Difference]: Finished difference. Result has 118 places, 98 transitions, 267 flow [2024-11-07 19:23:09,812 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-11-07 19:23:09,812 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -12 predicate places. [2024-11-07 19:23:09,812 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 98 transitions, 267 flow [2024-11-07 19:23:09,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.33333333333333) internal successors, (434), 6 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:09,813 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:09,813 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:09,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 19:23:09,813 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-11-07 19:23:09,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:09,813 INFO L85 PathProgramCache]: Analyzing trace with hash -118183534, now seen corresponding path program 1 times [2024-11-07 19:23:09,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:09,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595920924] [2024-11-07 19:23:09,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:09,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:10,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:10,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595920924] [2024-11-07 19:23:10,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595920924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:10,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:10,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:23:10,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908826511] [2024-11-07 19:23:10,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:10,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:23:10,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:10,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:23:10,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:23:10,265 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 128 [2024-11-07 19:23:10,266 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-11-07 19:23:10,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:10,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 128 [2024-11-07 19:23:10,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:10,414 INFO L124 PetriNetUnfolderBase]: 64/286 cut-off events. [2024-11-07 19:23:10,415 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-11-07 19:23:10,415 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-11-07 19:23:10,417 INFO L140 encePairwiseOnDemand]: 116/128 looper letters, 41 selfloop transitions, 11 changer transitions 0/97 dead transitions. [2024-11-07 19:23:10,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 97 transitions, 369 flow [2024-11-07 19:23:10,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:23:10,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:23:10,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 418 transitions. [2024-11-07 19:23:10,419 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.653125 [2024-11-07 19:23:10,419 INFO L175 Difference]: Start difference. First operand has 118 places, 98 transitions, 267 flow. Second operand 5 states and 418 transitions. [2024-11-07 19:23:10,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 97 transitions, 369 flow [2024-11-07 19:23:10,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 97 transitions, 347 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-07 19:23:10,421 INFO L231 Difference]: Finished difference. Result has 115 places, 97 transitions, 265 flow [2024-11-07 19:23:10,422 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-11-07 19:23:10,422 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -15 predicate places. [2024-11-07 19:23:10,422 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 97 transitions, 265 flow [2024-11-07 19:23:10,423 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-11-07 19:23:10,423 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:10,423 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:10,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 19:23:10,423 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-11-07 19:23:10,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:10,424 INFO L85 PathProgramCache]: Analyzing trace with hash -118183535, now seen corresponding path program 1 times [2024-11-07 19:23:10,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:10,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684028686] [2024-11-07 19:23:10,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:10,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:10,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:10,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684028686] [2024-11-07 19:23:10,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684028686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:10,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:10,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:23:10,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093564962] [2024-11-07 19:23:10,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:10,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:23:10,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:10,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:23:10,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:23:10,738 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 128 [2024-11-07 19:23:10,739 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-11-07 19:23:10,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:10,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 128 [2024-11-07 19:23:10,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:10,916 INFO L124 PetriNetUnfolderBase]: 64/285 cut-off events. [2024-11-07 19:23:10,917 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-07 19:23:10,917 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-11-07 19:23:10,918 INFO L140 encePairwiseOnDemand]: 116/128 looper letters, 46 selfloop transitions, 11 changer transitions 0/96 dead transitions. [2024-11-07 19:23:10,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 96 transitions, 377 flow [2024-11-07 19:23:10,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:23:10,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:23:10,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 398 transitions. [2024-11-07 19:23:10,920 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.621875 [2024-11-07 19:23:10,920 INFO L175 Difference]: Start difference. First operand has 115 places, 97 transitions, 265 flow. Second operand 5 states and 398 transitions. [2024-11-07 19:23:10,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 96 transitions, 377 flow [2024-11-07 19:23:10,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 96 transitions, 355 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:23:10,922 INFO L231 Difference]: Finished difference. Result has 114 places, 96 transitions, 263 flow [2024-11-07 19:23:10,923 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-11-07 19:23:10,923 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -16 predicate places. [2024-11-07 19:23:10,923 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 96 transitions, 263 flow [2024-11-07 19:23:10,924 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-11-07 19:23:10,924 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:10,924 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:10,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 19:23:10,924 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-11-07 19:23:10,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:10,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1068289777, now seen corresponding path program 1 times [2024-11-07 19:23:10,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:10,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242825249] [2024-11-07 19:23:10,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:10,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:11,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:11,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242825249] [2024-11-07 19:23:11,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242825249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:11,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:11,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:23:11,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615014746] [2024-11-07 19:23:11,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:11,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:23:11,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:11,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:23:11,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:23:11,995 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 128 [2024-11-07 19:23:11,996 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-11-07 19:23:11,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:11,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 128 [2024-11-07 19:23:11,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:12,171 INFO L124 PetriNetUnfolderBase]: 73/309 cut-off events. [2024-11-07 19:23:12,172 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-11-07 19:23:12,172 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-11-07 19:23:12,174 INFO L140 encePairwiseOnDemand]: 113/128 looper letters, 44 selfloop transitions, 12 changer transitions 3/102 dead transitions. [2024-11-07 19:23:12,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 102 transitions, 393 flow [2024-11-07 19:23:12,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:23:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:23:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 387 transitions. [2024-11-07 19:23:12,176 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6046875 [2024-11-07 19:23:12,176 INFO L175 Difference]: Start difference. First operand has 114 places, 96 transitions, 263 flow. Second operand 5 states and 387 transitions. [2024-11-07 19:23:12,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 102 transitions, 393 flow [2024-11-07 19:23:12,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 102 transitions, 371 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:23:12,180 INFO L231 Difference]: Finished difference. Result has 111 places, 93 transitions, 259 flow [2024-11-07 19:23:12,180 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-11-07 19:23:12,181 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -19 predicate places. [2024-11-07 19:23:12,182 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 93 transitions, 259 flow [2024-11-07 19:23:12,182 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-11-07 19:23:12,182 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:12,182 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:12,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 19:23:12,183 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-11-07 19:23:12,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:12,183 INFO L85 PathProgramCache]: Analyzing trace with hash -281122203, now seen corresponding path program 1 times [2024-11-07 19:23:12,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:12,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728635908] [2024-11-07 19:23:12,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:12,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:12,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:12,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728635908] [2024-11-07 19:23:12,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728635908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:12,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:12,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:23:12,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135892452] [2024-11-07 19:23:12,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:12,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:23:12,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:12,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:23:12,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:23:13,404 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 128 [2024-11-07 19:23:13,405 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-11-07 19:23:13,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:13,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 128 [2024-11-07 19:23:13,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:13,614 INFO L124 PetriNetUnfolderBase]: 64/278 cut-off events. [2024-11-07 19:23:13,614 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-07 19:23:13,615 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 1113 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-11-07 19:23:13,615 INFO L140 encePairwiseOnDemand]: 110/128 looper letters, 48 selfloop transitions, 14 changer transitions 3/98 dead transitions. [2024-11-07 19:23:13,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 98 transitions, 399 flow [2024-11-07 19:23:13,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:23:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:23:13,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 451 transitions. [2024-11-07 19:23:13,617 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5033482142857143 [2024-11-07 19:23:13,617 INFO L175 Difference]: Start difference. First operand has 111 places, 93 transitions, 259 flow. Second operand 7 states and 451 transitions. [2024-11-07 19:23:13,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 98 transitions, 399 flow [2024-11-07 19:23:13,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 98 transitions, 375 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:23:13,620 INFO L231 Difference]: Finished difference. Result has 109 places, 89 transitions, 255 flow [2024-11-07 19:23:13,620 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-11-07 19:23:13,620 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -21 predicate places. [2024-11-07 19:23:13,621 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 89 transitions, 255 flow [2024-11-07 19:23:13,621 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-11-07 19:23:13,621 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:13,621 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:23:13,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 19:23:13,621 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-11-07 19:23:13,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:13,622 INFO L85 PathProgramCache]: Analyzing trace with hash -281122204, now seen corresponding path program 1 times [2024-11-07 19:23:13,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:13,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702287562] [2024-11-07 19:23:13,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:13,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:13,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:13,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702287562] [2024-11-07 19:23:13,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702287562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:13,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:13,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:23:13,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567939097] [2024-11-07 19:23:13,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:13,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:23:13,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:13,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:23:13,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:23:14,372 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 128 [2024-11-07 19:23:14,373 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-11-07 19:23:14,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:14,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 128 [2024-11-07 19:23:14,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:14,555 INFO L124 PetriNetUnfolderBase]: 64/276 cut-off events. [2024-11-07 19:23:14,555 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-07 19:23:14,556 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 1114 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-11-07 19:23:14,557 INFO L140 encePairwiseOnDemand]: 109/128 looper letters, 48 selfloop transitions, 17 changer transitions 3/96 dead transitions. [2024-11-07 19:23:14,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 96 transitions, 405 flow [2024-11-07 19:23:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:23:14,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:23:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 556 transitions. [2024-11-07 19:23:14,560 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.54296875 [2024-11-07 19:23:14,560 INFO L175 Difference]: Start difference. First operand has 109 places, 89 transitions, 255 flow. Second operand 8 states and 556 transitions. [2024-11-07 19:23:14,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 96 transitions, 405 flow [2024-11-07 19:23:14,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 96 transitions, 377 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-07 19:23:14,563 INFO L231 Difference]: Finished difference. Result has 108 places, 87 transitions, 257 flow [2024-11-07 19:23:14,563 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-11-07 19:23:14,563 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -22 predicate places. [2024-11-07 19:23:14,563 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 87 transitions, 257 flow [2024-11-07 19:23:14,564 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-11-07 19:23:14,564 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:14,564 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-11-07 19:23:14,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 19:23:14,564 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-07 19:23:14,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:14,565 INFO L85 PathProgramCache]: Analyzing trace with hash 424527226, now seen corresponding path program 1 times [2024-11-07 19:23:14,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:14,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221768073] [2024-11-07 19:23:14,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:14,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:14,786 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:14,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:14,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221768073] [2024-11-07 19:23:14,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221768073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:14,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:14,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:23:14,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676636970] [2024-11-07 19:23:14,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:14,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:23:14,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:14,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:23:14,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:23:15,053 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 128 [2024-11-07 19:23:15,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 87 transitions, 257 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-11-07 19:23:15,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:15,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 128 [2024-11-07 19:23:15,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:15,193 INFO L124 PetriNetUnfolderBase]: 64/275 cut-off events. [2024-11-07 19:23:15,193 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-11-07 19:23:15,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 275 events. 64/275 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1116 event pairs, 63 based on Foata normal form. 1/235 useless extension candidates. Maximal degree in co-relation 500. Up to 170 conditions per place. [2024-11-07 19:23:15,195 INFO L140 encePairwiseOnDemand]: 116/128 looper letters, 40 selfloop transitions, 11 changer transitions 0/86 dead transitions. [2024-11-07 19:23:15,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 86 transitions, 357 flow [2024-11-07 19:23:15,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:23:15,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:23:15,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 417 transitions. [2024-11-07 19:23:15,197 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6515625 [2024-11-07 19:23:15,197 INFO L175 Difference]: Start difference. First operand has 108 places, 87 transitions, 257 flow. Second operand 5 states and 417 transitions. [2024-11-07 19:23:15,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 86 transitions, 357 flow [2024-11-07 19:23:15,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 86 transitions, 323 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-07 19:23:15,200 INFO L231 Difference]: Finished difference. Result has 104 places, 86 transitions, 243 flow [2024-11-07 19:23:15,201 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-11-07 19:23:15,201 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -26 predicate places. [2024-11-07 19:23:15,202 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 86 transitions, 243 flow [2024-11-07 19:23:15,202 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-11-07 19:23:15,202 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:15,202 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-11-07 19:23:15,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 19:23:15,202 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-07 19:23:15,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:15,203 INFO L85 PathProgramCache]: Analyzing trace with hash 424527225, now seen corresponding path program 1 times [2024-11-07 19:23:15,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:15,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185207810] [2024-11-07 19:23:15,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:15,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:15,315 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:15,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:15,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185207810] [2024-11-07 19:23:15,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185207810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:15,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:15,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:23:15,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612420509] [2024-11-07 19:23:15,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:15,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:23:15,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:15,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:23:15,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:23:15,508 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 128 [2024-11-07 19:23:15,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 86 transitions, 243 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-11-07 19:23:15,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:15,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 128 [2024-11-07 19:23:15,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:15,642 INFO L124 PetriNetUnfolderBase]: 64/274 cut-off events. [2024-11-07 19:23:15,642 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-07 19:23:15,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 274 events. 64/274 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1108 event pairs, 63 based on Foata normal form. 1/232 useless extension candidates. Maximal degree in co-relation 489. Up to 170 conditions per place. [2024-11-07 19:23:15,644 INFO L140 encePairwiseOnDemand]: 116/128 looper letters, 45 selfloop transitions, 11 changer transitions 0/85 dead transitions. [2024-11-07 19:23:15,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 85 transitions, 353 flow [2024-11-07 19:23:15,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:23:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:23:15,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 397 transitions. [2024-11-07 19:23:15,646 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6203125 [2024-11-07 19:23:15,646 INFO L175 Difference]: Start difference. First operand has 104 places, 86 transitions, 243 flow. Second operand 5 states and 397 transitions. [2024-11-07 19:23:15,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 85 transitions, 353 flow [2024-11-07 19:23:15,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 85 transitions, 331 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:23:15,648 INFO L231 Difference]: Finished difference. Result has 103 places, 85 transitions, 241 flow [2024-11-07 19:23:15,648 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-11-07 19:23:15,648 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -27 predicate places. [2024-11-07 19:23:15,648 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 85 transitions, 241 flow [2024-11-07 19:23:15,649 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-11-07 19:23:15,649 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:15,649 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-11-07 19:23:15,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 19:23:15,649 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-11-07 19:23:15,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:15,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1963632937, now seen corresponding path program 1 times [2024-11-07 19:23:15,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:15,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359232397] [2024-11-07 19:23:15,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:15,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:17,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:17,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359232397] [2024-11-07 19:23:17,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359232397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:17,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:17,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 19:23:17,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757648735] [2024-11-07 19:23:17,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:17,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 19:23:17,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:17,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 19:23:17,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-07 19:23:19,254 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 128 [2024-11-07 19:23:19,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 85 transitions, 241 flow. Second operand has 16 states, 16 states have (on average 45.5625) internal successors, (729), 16 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:19,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:19,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 128 [2024-11-07 19:23:19,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:19,836 INFO L124 PetriNetUnfolderBase]: 64/272 cut-off events. [2024-11-07 19:23:19,837 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-11-07 19:23:19,837 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 127 conditions per place. [2024-11-07 19:23:19,838 INFO L140 encePairwiseOnDemand]: 107/128 looper letters, 46 selfloop transitions, 19 changer transitions 3/92 dead transitions. [2024-11-07 19:23:19,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 92 transitions, 391 flow [2024-11-07 19:23:19,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 19:23:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-07 19:23:19,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 764 transitions. [2024-11-07 19:23:19,841 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.373046875 [2024-11-07 19:23:19,841 INFO L175 Difference]: Start difference. First operand has 103 places, 85 transitions, 241 flow. Second operand 16 states and 764 transitions. [2024-11-07 19:23:19,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 92 transitions, 391 flow [2024-11-07 19:23:19,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 92 transitions, 369 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:23:19,844 INFO L231 Difference]: Finished difference. Result has 112 places, 83 transitions, 253 flow [2024-11-07 19:23:19,844 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=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=253, PETRI_PLACES=112, PETRI_TRANSITIONS=83} [2024-11-07 19:23:19,845 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -18 predicate places. [2024-11-07 19:23:19,845 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 83 transitions, 253 flow [2024-11-07 19:23:19,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 45.5625) internal successors, (729), 16 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:19,845 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:19,846 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-11-07 19:23:19,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 19:23:19,846 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-11-07 19:23:19,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:19,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1963632938, now seen corresponding path program 1 times [2024-11-07 19:23:19,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:19,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441547316] [2024-11-07 19:23:19,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:19,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:20,459 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:20,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:20,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441547316] [2024-11-07 19:23:20,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441547316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:20,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:20,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 19:23:20,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367889960] [2024-11-07 19:23:20,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:20,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 19:23:20,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:20,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 19:23:20,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-07 19:23:21,237 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 128 [2024-11-07 19:23:21,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 83 transitions, 253 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-11-07 19:23:21,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:21,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 128 [2024-11-07 19:23:21,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:21,437 INFO L124 PetriNetUnfolderBase]: 64/271 cut-off events. [2024-11-07 19:23:21,437 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-07 19:23:21,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 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 1107 event pairs, 54 based on Foata normal form. 1/231 useless extension candidates. Maximal degree in co-relation 504. Up to 133 conditions per place. [2024-11-07 19:23:21,439 INFO L140 encePairwiseOnDemand]: 115/128 looper letters, 52 selfloop transitions, 12 changer transitions 3/91 dead transitions. [2024-11-07 19:23:21,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 91 transitions, 401 flow [2024-11-07 19:23:21,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:23:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:23:21,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 634 transitions. [2024-11-07 19:23:21,441 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.619140625 [2024-11-07 19:23:21,441 INFO L175 Difference]: Start difference. First operand has 112 places, 83 transitions, 253 flow. Second operand 8 states and 634 transitions. [2024-11-07 19:23:21,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 91 transitions, 401 flow [2024-11-07 19:23:21,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 91 transitions, 365 flow, removed 0 selfloop flow, removed 14 redundant places. [2024-11-07 19:23:21,444 INFO L231 Difference]: Finished difference. Result has 103 places, 82 transitions, 237 flow [2024-11-07 19:23:21,444 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-11-07 19:23:21,444 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -27 predicate places. [2024-11-07 19:23:21,445 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 82 transitions, 237 flow [2024-11-07 19:23:21,445 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-11-07 19:23:21,445 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:21,445 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-11-07 19:23:21,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 19:23:21,445 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-07 19:23:21,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:21,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1560583776, now seen corresponding path program 1 times [2024-11-07 19:23:21,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:21,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992191484] [2024-11-07 19:23:21,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:21,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:21,753 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:21,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:21,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992191484] [2024-11-07 19:23:21,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992191484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:21,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:21,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:23:21,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604913467] [2024-11-07 19:23:21,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:21,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:23:21,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:21,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:23:21,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:23:21,993 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 128 [2024-11-07 19:23:21,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 82 transitions, 237 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-11-07 19:23:21,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:21,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 128 [2024-11-07 19:23:21,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:22,150 INFO L124 PetriNetUnfolderBase]: 73/276 cut-off events. [2024-11-07 19:23:22,150 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-11-07 19:23:22,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 276 events. 73/276 cut-off events. For 50/50 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/243 useless extension candidates. Maximal degree in co-relation 513. Up to 135 conditions per place. [2024-11-07 19:23:22,152 INFO L140 encePairwiseOnDemand]: 111/128 looper letters, 44 selfloop transitions, 15 changer transitions 0/89 dead transitions. [2024-11-07 19:23:22,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 89 transitions, 369 flow [2024-11-07 19:23:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:23:22,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:23:22,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 421 transitions. [2024-11-07 19:23:22,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6578125 [2024-11-07 19:23:22,154 INFO L175 Difference]: Start difference. First operand has 103 places, 82 transitions, 237 flow. Second operand 5 states and 421 transitions. [2024-11-07 19:23:22,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 89 transitions, 369 flow [2024-11-07 19:23:22,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 89 transitions, 345 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-07 19:23:22,156 INFO L231 Difference]: Finished difference. Result has 98 places, 80 transitions, 239 flow [2024-11-07 19:23:22,156 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=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=239, PETRI_PLACES=98, PETRI_TRANSITIONS=80} [2024-11-07 19:23:22,156 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -32 predicate places. [2024-11-07 19:23:22,157 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 80 transitions, 239 flow [2024-11-07 19:23:22,157 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-11-07 19:23:22,157 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:22,157 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-11-07 19:23:22,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 19:23:22,157 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-07 19:23:22,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:22,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1560583777, now seen corresponding path program 1 times [2024-11-07 19:23:22,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:22,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352399255] [2024-11-07 19:23:22,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:22,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:22,285 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:22,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:22,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352399255] [2024-11-07 19:23:22,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352399255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:22,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:22,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:23:22,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650706698] [2024-11-07 19:23:22,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:22,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:23:22,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:22,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:23:22,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:23:22,462 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 128 [2024-11-07 19:23:22,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 80 transitions, 239 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-11-07 19:23:22,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:22,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 128 [2024-11-07 19:23:22,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:22,604 INFO L124 PetriNetUnfolderBase]: 73/285 cut-off events. [2024-11-07 19:23:22,604 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-11-07 19:23:22,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 285 events. 73/285 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1181 event pairs, 45 based on Foata normal form. 2/244 useless extension candidates. Maximal degree in co-relation 530. Up to 108 conditions per place. [2024-11-07 19:23:22,607 INFO L140 encePairwiseOnDemand]: 109/128 looper letters, 47 selfloop transitions, 17 changer transitions 0/87 dead transitions. [2024-11-07 19:23:22,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 87 transitions, 381 flow [2024-11-07 19:23:22,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:23:22,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:23:22,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 401 transitions. [2024-11-07 19:23:22,608 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6265625 [2024-11-07 19:23:22,609 INFO L175 Difference]: Start difference. First operand has 98 places, 80 transitions, 239 flow. Second operand 5 states and 401 transitions. [2024-11-07 19:23:22,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 87 transitions, 381 flow [2024-11-07 19:23:22,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 87 transitions, 351 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:23:22,611 INFO L231 Difference]: Finished difference. Result has 96 places, 78 transitions, 239 flow [2024-11-07 19:23:22,611 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=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=239, PETRI_PLACES=96, PETRI_TRANSITIONS=78} [2024-11-07 19:23:22,612 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -34 predicate places. [2024-11-07 19:23:22,612 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 78 transitions, 239 flow [2024-11-07 19:23:22,613 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-11-07 19:23:22,613 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:22,613 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-11-07 19:23:22,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 19:23:22,613 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-11-07 19:23:22,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:22,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1580649138, now seen corresponding path program 1 times [2024-11-07 19:23:22,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:22,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265007029] [2024-11-07 19:23:22,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:22,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:22,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:22,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265007029] [2024-11-07 19:23:22,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265007029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:22,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:22,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:23:22,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30098310] [2024-11-07 19:23:22,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:22,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:23:22,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:22,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:23:22,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:23:22,806 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 128 [2024-11-07 19:23:22,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 78 transitions, 239 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-11-07 19:23:22,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:22,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 128 [2024-11-07 19:23:22,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:22,912 INFO L124 PetriNetUnfolderBase]: 71/277 cut-off events. [2024-11-07 19:23:22,912 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2024-11-07 19:23:22,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 277 events. 71/277 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1123 event pairs, 56 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 536. Up to 161 conditions per place. [2024-11-07 19:23:22,914 INFO L140 encePairwiseOnDemand]: 124/128 looper letters, 55 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2024-11-07 19:23:22,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 83 transitions, 369 flow [2024-11-07 19:23:22,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:23:22,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:23:22,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2024-11-07 19:23:22,915 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7994791666666666 [2024-11-07 19:23:22,915 INFO L175 Difference]: Start difference. First operand has 96 places, 78 transitions, 239 flow. Second operand 3 states and 307 transitions. [2024-11-07 19:23:22,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 83 transitions, 369 flow [2024-11-07 19:23:22,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 83 transitions, 329 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 19:23:22,918 INFO L231 Difference]: Finished difference. Result has 92 places, 76 transitions, 205 flow [2024-11-07 19:23:22,918 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-11-07 19:23:22,918 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -38 predicate places. [2024-11-07 19:23:22,919 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 76 transitions, 205 flow [2024-11-07 19:23:22,919 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-11-07 19:23:22,919 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:22,919 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-11-07 19:23:22,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 19:23:22,920 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-11-07 19:23:22,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:22,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1580649137, now seen corresponding path program 1 times [2024-11-07 19:23:22,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:22,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275202936] [2024-11-07 19:23:22,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:22,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:23,077 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:23,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:23,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275202936] [2024-11-07 19:23:23,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275202936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:23,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:23,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:23:23,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407922903] [2024-11-07 19:23:23,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:23,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:23:23,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:23,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:23:23,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:23:23,168 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 128 [2024-11-07 19:23:23,169 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-11-07 19:23:23,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:23,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 128 [2024-11-07 19:23:23,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:23,283 INFO L124 PetriNetUnfolderBase]: 64/254 cut-off events. [2024-11-07 19:23:23,284 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-07 19:23:23,284 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-11-07 19:23:23,286 INFO L140 encePairwiseOnDemand]: 124/128 looper letters, 54 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2024-11-07 19:23:23,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 81 transitions, 327 flow [2024-11-07 19:23:23,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:23:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:23:23,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2024-11-07 19:23:23,288 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8046875 [2024-11-07 19:23:23,288 INFO L175 Difference]: Start difference. First operand has 92 places, 76 transitions, 205 flow. Second operand 3 states and 309 transitions. [2024-11-07 19:23:23,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 81 transitions, 327 flow [2024-11-07 19:23:23,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 81 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:23:23,290 INFO L231 Difference]: Finished difference. Result has 90 places, 74 transitions, 201 flow [2024-11-07 19:23:23,290 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-11-07 19:23:23,292 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -40 predicate places. [2024-11-07 19:23:23,292 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 74 transitions, 201 flow [2024-11-07 19:23:23,292 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-11-07 19:23:23,292 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:23,292 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-11-07 19:23:23,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 19:23:23,293 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-11-07 19:23:23,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:23,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1871527959, now seen corresponding path program 1 times [2024-11-07 19:23:23,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:23,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666146313] [2024-11-07 19:23:23,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:23,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:23,618 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:23,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:23,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666146313] [2024-11-07 19:23:23,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666146313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:23,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:23,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:23:23,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424157150] [2024-11-07 19:23:23,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:23,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:23:23,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:23,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:23:23,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:23:23,952 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 128 [2024-11-07 19:23:23,953 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-11-07 19:23:23,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:23,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 128 [2024-11-07 19:23:23,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:24,108 INFO L124 PetriNetUnfolderBase]: 79/303 cut-off events. [2024-11-07 19:23:24,108 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-11-07 19:23:24,109 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 1274 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-11-07 19:23:24,110 INFO L140 encePairwiseOnDemand]: 117/128 looper letters, 58 selfloop transitions, 11 changer transitions 0/88 dead transitions. [2024-11-07 19:23:24,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 88 transitions, 371 flow [2024-11-07 19:23:24,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:23:24,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:23:24,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 510 transitions. [2024-11-07 19:23:24,111 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6640625 [2024-11-07 19:23:24,111 INFO L175 Difference]: Start difference. First operand has 90 places, 74 transitions, 201 flow. Second operand 6 states and 510 transitions. [2024-11-07 19:23:24,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 88 transitions, 371 flow [2024-11-07 19:23:24,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 88 transitions, 363 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:23:24,114 INFO L231 Difference]: Finished difference. Result has 95 places, 79 transitions, 247 flow [2024-11-07 19:23:24,114 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-11-07 19:23:24,114 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -35 predicate places. [2024-11-07 19:23:24,114 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 79 transitions, 247 flow [2024-11-07 19:23:24,115 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-11-07 19:23:24,115 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:24,115 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-11-07 19:23:24,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 19:23:24,115 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-11-07 19:23:24,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:24,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1871527960, now seen corresponding path program 1 times [2024-11-07 19:23:24,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:24,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123649379] [2024-11-07 19:23:24,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:24,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:24,277 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:24,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:24,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123649379] [2024-11-07 19:23:24,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123649379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:24,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:24,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:23:24,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757592389] [2024-11-07 19:23:24,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:24,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:23:24,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:24,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:23:24,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:23:24,552 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 128 [2024-11-07 19:23:24,552 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-11-07 19:23:24,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:24,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 128 [2024-11-07 19:23:24,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:24,743 INFO L124 PetriNetUnfolderBase]: 73/268 cut-off events. [2024-11-07 19:23:24,743 INFO L125 PetriNetUnfolderBase]: For 70/72 co-relation queries the response was YES. [2024-11-07 19:23:24,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 268 events. 73/268 cut-off events. For 70/72 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-11-07 19:23:24,744 INFO L140 encePairwiseOnDemand]: 117/128 looper letters, 59 selfloop transitions, 13 changer transitions 3/94 dead transitions. [2024-11-07 19:23:24,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 94 transitions, 427 flow [2024-11-07 19:23:24,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:23:24,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:23:24,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 513 transitions. [2024-11-07 19:23:24,746 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.66796875 [2024-11-07 19:23:24,746 INFO L175 Difference]: Start difference. First operand has 95 places, 79 transitions, 247 flow. Second operand 6 states and 513 transitions. [2024-11-07 19:23:24,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 94 transitions, 427 flow [2024-11-07 19:23:24,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 419 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:23:24,750 INFO L231 Difference]: Finished difference. Result has 97 places, 78 transitions, 263 flow [2024-11-07 19:23:24,750 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-11-07 19:23:24,750 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -33 predicate places. [2024-11-07 19:23:24,751 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 78 transitions, 263 flow [2024-11-07 19:23:24,751 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-11-07 19:23:24,751 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:24,751 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-11-07 19:23:24,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 19:23:24,751 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-11-07 19:23:24,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:24,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1414626063, now seen corresponding path program 1 times [2024-11-07 19:23:24,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:24,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921793776] [2024-11-07 19:23:24,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:24,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:25,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:25,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921793776] [2024-11-07 19:23:25,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921793776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:25,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:25,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 19:23:25,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393563158] [2024-11-07 19:23:25,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:25,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 19:23:25,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:25,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 19:23:25,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-07 19:23:26,035 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 128 [2024-11-07 19:23:26,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 78 transitions, 263 flow. Second operand has 10 states, 10 states have (on average 71.8) internal successors, (718), 10 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:26,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:26,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 128 [2024-11-07 19:23:26,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:26,189 INFO L124 PetriNetUnfolderBase]: 73/264 cut-off events. [2024-11-07 19:23:26,189 INFO L125 PetriNetUnfolderBase]: For 125/129 co-relation queries the response was YES. [2024-11-07 19:23:26,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 264 events. 73/264 cut-off events. For 125/129 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 990 event pairs, 39 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 577. Up to 153 conditions per place. [2024-11-07 19:23:26,191 INFO L140 encePairwiseOnDemand]: 115/128 looper letters, 51 selfloop transitions, 12 changer transitions 0/85 dead transitions. [2024-11-07 19:23:26,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 85 transitions, 420 flow [2024-11-07 19:23:26,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:23:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:23:26,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 394 transitions. [2024-11-07 19:23:26,192 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.615625 [2024-11-07 19:23:26,192 INFO L175 Difference]: Start difference. First operand has 97 places, 78 transitions, 263 flow. Second operand 5 states and 394 transitions. [2024-11-07 19:23:26,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 85 transitions, 420 flow [2024-11-07 19:23:26,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 85 transitions, 388 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 19:23:26,195 INFO L231 Difference]: Finished difference. Result has 95 places, 77 transitions, 259 flow [2024-11-07 19:23:26,195 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=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=95, PETRI_TRANSITIONS=77} [2024-11-07 19:23:26,195 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -35 predicate places. [2024-11-07 19:23:26,196 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 77 transitions, 259 flow [2024-11-07 19:23:26,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 71.8) internal successors, (718), 10 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:26,196 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:26,196 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-11-07 19:23:26,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 19:23:26,197 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-07 19:23:26,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:26,197 INFO L85 PathProgramCache]: Analyzing trace with hash 2112176221, now seen corresponding path program 1 times [2024-11-07 19:23:26,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:26,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258091801] [2024-11-07 19:23:26,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:26,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:29,041 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:29,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:29,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258091801] [2024-11-07 19:23:29,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258091801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:29,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:29,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-11-07 19:23:29,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683918398] [2024-11-07 19:23:29,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:29,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 19:23:29,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:29,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 19:23:29,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2024-11-07 19:23:33,585 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 128 [2024-11-07 19:23:33,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 77 transitions, 259 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-11-07 19:23:33,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:33,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 128 [2024-11-07 19:23:33,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:34,570 INFO L124 PetriNetUnfolderBase]: 124/389 cut-off events. [2024-11-07 19:23:34,570 INFO L125 PetriNetUnfolderBase]: For 100/106 co-relation queries the response was YES. [2024-11-07 19:23:34,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 389 events. 124/389 cut-off events. For 100/106 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1672 event pairs, 13 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 818. Up to 75 conditions per place. [2024-11-07 19:23:34,572 INFO L140 encePairwiseOnDemand]: 103/128 looper letters, 75 selfloop transitions, 32 changer transitions 3/120 dead transitions. [2024-11-07 19:23:34,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 120 transitions, 582 flow [2024-11-07 19:23:34,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-07 19:23:34,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-11-07 19:23:34,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1449 transitions. [2024-11-07 19:23:34,575 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4528125 [2024-11-07 19:23:34,575 INFO L175 Difference]: Start difference. First operand has 95 places, 77 transitions, 259 flow. Second operand 25 states and 1449 transitions. [2024-11-07 19:23:34,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 120 transitions, 582 flow [2024-11-07 19:23:34,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 120 transitions, 556 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:23:34,579 INFO L231 Difference]: Finished difference. Result has 119 places, 84 transitions, 343 flow [2024-11-07 19:23:34,579 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=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=343, PETRI_PLACES=119, PETRI_TRANSITIONS=84} [2024-11-07 19:23:34,579 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -11 predicate places. [2024-11-07 19:23:34,579 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 84 transitions, 343 flow [2024-11-07 19:23:34,580 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-11-07 19:23:34,580 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:34,580 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-11-07 19:23:34,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 19:23:34,581 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-07 19:23:34,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:34,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2112176220, now seen corresponding path program 1 times [2024-11-07 19:23:34,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:34,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165503773] [2024-11-07 19:23:34,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:34,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:23:36,941 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-07 19:23:36,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:23:36,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165503773] [2024-11-07 19:23:36,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165503773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:23:36,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:23:36,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2024-11-07 19:23:36,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612449912] [2024-11-07 19:23:36,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:23:36,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 19:23:36,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:23:36,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 19:23:36,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2024-11-07 19:23:43,169 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 128 [2024-11-07 19:23:43,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 84 transitions, 343 flow. Second operand has 27 states, 27 states have (on average 55.370370370370374) internal successors, (1495), 27 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:43,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:23:43,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 128 [2024-11-07 19:23:43,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:23:44,594 INFO L124 PetriNetUnfolderBase]: 124/385 cut-off events. [2024-11-07 19:23:44,595 INFO L125 PetriNetUnfolderBase]: For 180/186 co-relation queries the response was YES. [2024-11-07 19:23:44,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 385 events. 124/385 cut-off events. For 180/186 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1631 event pairs, 13 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 916. Up to 101 conditions per place. [2024-11-07 19:23:44,597 INFO L140 encePairwiseOnDemand]: 102/128 looper letters, 72 selfloop transitions, 33 changer transitions 3/118 dead transitions. [2024-11-07 19:23:44,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 118 transitions, 633 flow [2024-11-07 19:23:44,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-07 19:23:44,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-11-07 19:23:44,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1446 transitions. [2024-11-07 19:23:44,599 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.451875 [2024-11-07 19:23:44,599 INFO L175 Difference]: Start difference. First operand has 119 places, 84 transitions, 343 flow. Second operand 25 states and 1446 transitions. [2024-11-07 19:23:44,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 118 transitions, 633 flow [2024-11-07 19:23:44,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 118 transitions, 596 flow, removed 2 selfloop flow, removed 17 redundant places. [2024-11-07 19:23:44,603 INFO L231 Difference]: Finished difference. Result has 129 places, 85 transitions, 391 flow [2024-11-07 19:23:44,604 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=391, PETRI_PLACES=129, PETRI_TRANSITIONS=85} [2024-11-07 19:23:44,604 INFO L277 CegarLoopForPetriNet]: 130 programPoint places, -1 predicate places. [2024-11-07 19:23:44,604 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 85 transitions, 391 flow [2024-11-07 19:23:44,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 55.370370370370374) internal successors, (1495), 27 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:23:44,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:23:44,605 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-11-07 19:23:44,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 19:23:44,606 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-11-07 19:23:44,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:23:44,606 INFO L85 PathProgramCache]: Analyzing trace with hash 903735837, now seen corresponding path program 1 times [2024-11-07 19:23:44,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:23:44,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070261587] [2024-11-07 19:23:44,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:23:44,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:23:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:23:44,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:23:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:23:45,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 19:23:45,364 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:23:45,365 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 88 remaining) [2024-11-07 19:23:45,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 88 remaining) [2024-11-07 19:23:45,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 88 remaining) [2024-11-07 19:23:45,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 88 remaining) [2024-11-07 19:23:45,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 88 remaining) [2024-11-07 19:23:45,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 88 remaining) [2024-11-07 19:23:45,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 88 remaining) [2024-11-07 19:23:45,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 88 remaining) [2024-11-07 19:23:45,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 88 remaining) [2024-11-07 19:23:45,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 88 remaining) [2024-11-07 19:23:45,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 88 remaining) [2024-11-07 19:23:45,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 88 remaining) [2024-11-07 19:23:45,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 88 remaining) [2024-11-07 19:23:45,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 88 remaining) [2024-11-07 19:23:45,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 88 remaining) [2024-11-07 19:23:45,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 88 remaining) [2024-11-07 19:23:45,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 88 remaining) [2024-11-07 19:23:45,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 88 remaining) [2024-11-07 19:23:45,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 88 remaining) [2024-11-07 19:23:45,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 88 remaining) [2024-11-07 19:23:45,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 88 remaining) [2024-11-07 19:23:45,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 88 remaining) [2024-11-07 19:23:45,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 88 remaining) [2024-11-07 19:23:45,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 88 remaining) [2024-11-07 19:23:45,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 88 remaining) [2024-11-07 19:23:45,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 88 remaining) [2024-11-07 19:23:45,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 88 remaining) [2024-11-07 19:23:45,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 88 remaining) [2024-11-07 19:23:45,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 88 remaining) [2024-11-07 19:23:45,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 88 remaining) [2024-11-07 19:23:45,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 88 remaining) [2024-11-07 19:23:45,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 88 remaining) [2024-11-07 19:23:45,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 88 remaining) [2024-11-07 19:23:45,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 88 remaining) [2024-11-07 19:23:45,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 88 remaining) [2024-11-07 19:23:45,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 88 remaining) [2024-11-07 19:23:45,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 88 remaining) [2024-11-07 19:23:45,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 88 remaining) [2024-11-07 19:23:45,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 88 remaining) [2024-11-07 19:23:45,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 88 remaining) [2024-11-07 19:23:45,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 88 remaining) [2024-11-07 19:23:45,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 88 remaining) [2024-11-07 19:23:45,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 88 remaining) [2024-11-07 19:23:45,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 88 remaining) [2024-11-07 19:23:45,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 88 remaining) [2024-11-07 19:23:45,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 88 remaining) [2024-11-07 19:23:45,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 88 remaining) [2024-11-07 19:23:45,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 88 remaining) [2024-11-07 19:23:45,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 88 remaining) [2024-11-07 19:23:45,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 88 remaining) [2024-11-07 19:23:45,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 88 remaining) [2024-11-07 19:23:45,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 88 remaining) [2024-11-07 19:23:45,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 88 remaining) [2024-11-07 19:23:45,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 88 remaining) [2024-11-07 19:23:45,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 88 remaining) [2024-11-07 19:23:45,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 88 remaining) [2024-11-07 19:23:45,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 88 remaining) [2024-11-07 19:23:45,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 88 remaining) [2024-11-07 19:23:45,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 88 remaining) [2024-11-07 19:23:45,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 88 remaining) [2024-11-07 19:23:45,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 88 remaining) [2024-11-07 19:23:45,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 88 remaining) [2024-11-07 19:23:45,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 88 remaining) [2024-11-07 19:23:45,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK (24 of 88 remaining) [2024-11-07 19:23:45,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 88 remaining) [2024-11-07 19:23:45,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 88 remaining) [2024-11-07 19:23:45,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 88 remaining) [2024-11-07 19:23:45,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 88 remaining) [2024-11-07 19:23:45,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 88 remaining) [2024-11-07 19:23:45,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 88 remaining) [2024-11-07 19:23:45,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 88 remaining) [2024-11-07 19:23:45,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 88 remaining) [2024-11-07 19:23:45,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 88 remaining) [2024-11-07 19:23:45,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 88 remaining) [2024-11-07 19:23:45,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 88 remaining) [2024-11-07 19:23:45,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 88 remaining) [2024-11-07 19:23:45,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 88 remaining) [2024-11-07 19:23:45,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 88 remaining) [2024-11-07 19:23:45,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 88 remaining) [2024-11-07 19:23:45,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 88 remaining) [2024-11-07 19:23:45,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 88 remaining) [2024-11-07 19:23:45,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 88 remaining) [2024-11-07 19:23:45,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 88 remaining) [2024-11-07 19:23:45,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 88 remaining) [2024-11-07 19:23:45,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 88 remaining) [2024-11-07 19:23:45,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 88 remaining) [2024-11-07 19:23:45,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 88 remaining) [2024-11-07 19:23:45,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 88 remaining) [2024-11-07 19:23:45,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 19:23:45,375 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-11-07 19:23:45,437 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:23:45,437 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:23:45,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:23:45 BasicIcfg [2024-11-07 19:23:45,444 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:23:45,445 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:23:45,445 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:23:45,445 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:23:45,445 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:23:02" (3/4) ... [2024-11-07 19:23:45,446 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 19:23:45,505 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 19:23:45,505 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:23:45,505 INFO L158 Benchmark]: Toolchain (without parser) took 44838.32ms. Allocated memory was 117.4MB in the beginning and 704.6MB in the end (delta: 587.2MB). Free memory was 89.6MB in the beginning and 440.6MB in the end (delta: -350.9MB). Peak memory consumption was 233.5MB. Max. memory is 16.1GB. [2024-11-07 19:23:45,505 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:23:45,506 INFO L158 Benchmark]: CACSL2BoogieTranslator took 614.98ms. Allocated memory is still 117.4MB. Free memory was 89.5MB in the beginning and 49.1MB in the end (delta: 40.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-07 19:23:45,506 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.44ms. Allocated memory is still 117.4MB. Free memory was 49.1MB in the beginning and 45.8MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:23:45,506 INFO L158 Benchmark]: Boogie Preprocessor took 96.40ms. Allocated memory is still 117.4MB. Free memory was 45.6MB in the beginning and 87.3MB in the end (delta: -41.7MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-07 19:23:45,506 INFO L158 Benchmark]: RCFGBuilder took 1291.61ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 87.3MB in the beginning and 85.9MB in the end (delta: 1.5MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. [2024-11-07 19:23:45,506 INFO L158 Benchmark]: TraceAbstraction took 42711.04ms. Allocated memory was 159.4MB in the beginning and 704.6MB in the end (delta: 545.3MB). Free memory was 85.1MB in the beginning and 449.0MB in the end (delta: -363.8MB). Peak memory consumption was 391.2MB. Max. memory is 16.1GB. [2024-11-07 19:23:45,507 INFO L158 Benchmark]: Witness Printer took 60.15ms. Allocated memory is still 704.6MB. Free memory was 449.0MB in the beginning and 440.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:23:45,510 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 614.98ms. Allocated memory is still 117.4MB. Free memory was 89.5MB in the beginning and 49.1MB in the end (delta: 40.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.44ms. Allocated memory is still 117.4MB. Free memory was 49.1MB in the beginning and 45.8MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 96.40ms. Allocated memory is still 117.4MB. Free memory was 45.6MB in the beginning and 87.3MB in the end (delta: -41.7MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * RCFGBuilder took 1291.61ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 87.3MB in the beginning and 85.9MB in the end (delta: 1.5MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. * TraceAbstraction took 42711.04ms. Allocated memory was 159.4MB in the beginning and 704.6MB in the end (delta: 545.3MB). Free memory was 85.1MB in the beginning and 449.0MB in the end (delta: -363.8MB). Peak memory consumption was 391.2MB. Max. memory is 16.1GB. * Witness Printer took 60.15ms. Allocated memory is still 704.6MB. Free memory was 449.0MB in the beginning and 440.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]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1254] 0 int i = 0; VAL [i=0, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=1, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=2, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=3, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=4, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=5, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=6, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=7, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=8, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=9, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=10, mutex={1:0}, slot={2:0}] [L1254] COND FALSE 0 !(i < 10) [L1256] 0 int j = __VERIFIER_nondet_int(), 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=0, k=9, mutex={1:0}, p={-6:0}, slot={2:0}, t1=-1] [L1246] 1 int i = __VERIFIER_nondet_int(); [L1247] CALL 1 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 1 !(!cond) [L1247] RET 1 assume_abort_if_not(0 <= i && i < 10) [L1249] CALL, EXPR 1 new(3) [L1233] 1 struct s *p = malloc(sizeof(struct s)); [L1234] 1 p->datum = x VAL [\old(arg)={0:0}, arg={0:0}, i=5, 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: 42.5s, OverallIterations: 28, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12582 SdHoareTripleChecker+Valid, 23.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9690 mSDsluCounter, 8777 SdHoareTripleChecker+Invalid, 20.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8433 mSDsCounter, 687 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44548 IncrementalHoareTripleChecker+Invalid, 45235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 687 mSolverCounterUnsat, 344 mSDtfsCounter, 44548 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=27, InterpolantAutomatonStates: 197, 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.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 806 NumberOfCodeBlocks, 806 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 738 ConstructedInterpolants, 0 QuantifiedInterpolants, 7881 SizeOfPredicates, 0 NumberOfNonLiveVariables, 411 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-11-07 19:23:45,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)