./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.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/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.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', 'bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6'] 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/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.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 bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:20:02,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:20:02,080 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:20:02,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:20:02,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:20:02,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:20:02,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:20:02,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:20:02,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:20:02,113 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:20:02,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:20:02,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:20:02,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:20:02,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:20:02,113 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:20:02,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:20:02,113 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:20:02,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:20:02,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:20:02,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:20:02,114 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:20:02,114 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:20:02,114 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:20:02,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:20:02,114 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:20:02,114 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:20:02,114 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:20:02,114 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:20:02,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:20:02,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:20:02,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:20:02,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:20:02,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:20:02,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:20:02,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:20:02,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:20:02,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:20:02,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:20:02,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:20:02,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:20:02,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:20:02,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:20:02,118 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 -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 [2024-11-07 19:20:02,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:20:02,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:20:02,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:20:02,444 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:20:02,444 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:20:02,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2024-11-07 19:20:03,710 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:20:04,032 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:20:04,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2024-11-07 19:20:04,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/626bd510c/5a9516d8e96c416aa29d4281ceb5e122/FLAGb13562205 [2024-11-07 19:20:04,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/626bd510c/5a9516d8e96c416aa29d4281ceb5e122 [2024-11-07 19:20:04,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:20:04,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:20:04,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:20:04,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:20:04,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:20:04,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:20:04" (1/1) ... [2024-11-07 19:20:04,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a435598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:04, skipping insertion in model container [2024-11-07 19:20:04,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:20:04" (1/1) ... [2024-11-07 19:20:04,334 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:20:04,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:20:04,632 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:20:04,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:20:04,746 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:20:04,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:04 WrapperNode [2024-11-07 19:20:04,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:20:04,748 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:20:04,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:20:04,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:20:04,754 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:20:04" (1/1) ... [2024-11-07 19:20:04,771 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:20:04" (1/1) ... [2024-11-07 19:20:04,808 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2024-11-07 19:20:04,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:20:04,813 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:20:04,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:20:04,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:20:04,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:04" (1/1) ... [2024-11-07 19:20:04,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:04" (1/1) ... [2024-11-07 19:20:04,826 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:04" (1/1) ... [2024-11-07 19:20:04,851 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 19:20:04,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:04" (1/1) ... [2024-11-07 19:20:04,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:04" (1/1) ... [2024-11-07 19:20:04,864 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:04" (1/1) ... [2024-11-07 19:20:04,866 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:04" (1/1) ... [2024-11-07 19:20:04,871 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:04" (1/1) ... [2024-11-07 19:20:04,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:04" (1/1) ... [2024-11-07 19:20:04,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:20:04,879 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:20:04,879 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:20:04,879 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:20:04,880 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:04" (1/1) ... [2024-11-07 19:20:04,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:20:04,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:20:04,912 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:20:04,916 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:20:04,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 19:20:04,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:20:04,939 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-07 19:20:04,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-07 19:20:04,939 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-07 19:20:04,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-07 19:20:04,939 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-07 19:20:04,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-07 19:20:04,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 19:20:04,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 19:20:04,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:20:04,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:20:04,941 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:20:05,064 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:20:05,066 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:20:05,384 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:20:05,385 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:20:05,582 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:20:05,583 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 19:20:05,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:20:05 BoogieIcfgContainer [2024-11-07 19:20:05,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:20:05,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:20:05,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:20:05,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:20:05,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:20:04" (1/3) ... [2024-11-07 19:20:05,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5600f69d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:20:05, skipping insertion in model container [2024-11-07 19:20:05,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:04" (2/3) ... [2024-11-07 19:20:05,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5600f69d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:20:05, skipping insertion in model container [2024-11-07 19:20:05,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:20:05" (3/3) ... [2024-11-07 19:20:05,595 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2024-11-07 19:20:05,608 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:20:05,610 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-07 19:20:05,610 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:20:05,663 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 19:20:05,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-07 19:20:05,735 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-07 19:20:05,738 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:20:05,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-11-07 19:20:05,741 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-07 19:20:05,744 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-07 19:20:05,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:20:05,769 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;@5bf1dd85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:20:05,769 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-07 19:20:05,775 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:20:05,775 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-07 19:20:05,776 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:20:05,776 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:05,776 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-07 19:20:05,777 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:05,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:05,783 INFO L85 PathProgramCache]: Analyzing trace with hash 11874970, now seen corresponding path program 1 times [2024-11-07 19:20:05,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:20:05,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727520833] [2024-11-07 19:20:05,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:05,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:20:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:06,276 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:20:06,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:20:06,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727520833] [2024-11-07 19:20:06,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727520833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:06,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:06,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:20:06,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870534770] [2024-11-07 19:20:06,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:06,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:20:06,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:20:06,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:20:06,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:20:06,314 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-11-07 19:20:06,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:20:06,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:06,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-11-07 19:20:06,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:06,752 INFO L124 PetriNetUnfolderBase]: 680/1277 cut-off events. [2024-11-07 19:20:06,752 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-07 19:20:06,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1277 events. 680/1277 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8166 event pairs, 104 based on Foata normal form. 72/1333 useless extension candidates. Maximal degree in co-relation 2342. Up to 844 conditions per place. [2024-11-07 19:20:06,769 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 33 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-11-07 19:20:06,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 195 flow [2024-11-07 19:20:06,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:20:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:20:06,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-11-07 19:20:06,785 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-07 19:20:06,787 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 99 transitions. [2024-11-07 19:20:06,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 195 flow [2024-11-07 19:20:06,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:20:06,796 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-07 19:20:06,799 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-07 19:20:06,803 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-07 19:20:06,804 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-07 19:20:06,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:20:06,804 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:06,804 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:20:06,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 19:20:06,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:06,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:06,806 INFO L85 PathProgramCache]: Analyzing trace with hash 625606107, now seen corresponding path program 1 times [2024-11-07 19:20:06,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:20:06,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125140242] [2024-11-07 19:20:06,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:06,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:20:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:06,921 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:20:06,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:20:06,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125140242] [2024-11-07 19:20:06,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125140242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:06,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:06,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:20:06,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497813570] [2024-11-07 19:20:06,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:06,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:20:06,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:20:06,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:20:06,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:20:06,926 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-07 19:20:06,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:20:06,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:06,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-07 19:20:06,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:07,143 INFO L124 PetriNetUnfolderBase]: 605/1137 cut-off events. [2024-11-07 19:20:07,143 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-11-07 19:20:07,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 1137 events. 605/1137 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7018 event pairs, 605 based on Foata normal form. 36/1123 useless extension candidates. Maximal degree in co-relation 2171. Up to 926 conditions per place. [2024-11-07 19:20:07,155 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 18 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-07 19:20:07,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 120 flow [2024-11-07 19:20:07,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:20:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:20:07,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-11-07 19:20:07,158 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-07 19:20:07,158 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 75 transitions. [2024-11-07 19:20:07,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 120 flow [2024-11-07 19:20:07,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:20:07,160 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2024-11-07 19:20:07,161 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-11-07 19:20:07,162 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-11-07 19:20:07,162 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2024-11-07 19:20:07,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:20:07,162 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:07,163 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:20:07,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 19:20:07,163 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:07,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:07,163 INFO L85 PathProgramCache]: Analyzing trace with hash 625607718, now seen corresponding path program 1 times [2024-11-07 19:20:07,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:20:07,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225906521] [2024-11-07 19:20:07,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:07,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:20:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:08,181 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:20:08,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:20:08,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225906521] [2024-11-07 19:20:08,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225906521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:08,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:08,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:20:08,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714384804] [2024-11-07 19:20:08,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:08,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:20:08,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:20:08,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:20:08,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:20:08,202 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-11-07 19:20:08,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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:20:08,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:08,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-11-07 19:20:08,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:09,366 INFO L124 PetriNetUnfolderBase]: 3181/5158 cut-off events. [2024-11-07 19:20:09,366 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:20:09,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9892 conditions, 5158 events. 3181/5158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 33096 event pairs, 392 based on Foata normal form. 0/5021 useless extension candidates. Maximal degree in co-relation 9886. Up to 2283 conditions per place. [2024-11-07 19:20:09,388 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 41 selfloop transitions, 12 changer transitions 90/153 dead transitions. [2024-11-07 19:20:09,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 153 transitions, 604 flow [2024-11-07 19:20:09,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 19:20:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-07 19:20:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 314 transitions. [2024-11-07 19:20:09,391 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5946969696969697 [2024-11-07 19:20:09,391 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 12 states and 314 transitions. [2024-11-07 19:20:09,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 153 transitions, 604 flow [2024-11-07 19:20:09,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 153 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:20:09,396 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 213 flow [2024-11-07 19:20:09,397 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=213, PETRI_PLACES=64, PETRI_TRANSITIONS=44} [2024-11-07 19:20:09,397 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places. [2024-11-07 19:20:09,398 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 213 flow [2024-11-07 19:20:09,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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:20:09,398 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:09,398 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:20:09,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 19:20:09,399 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:09,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:09,400 INFO L85 PathProgramCache]: Analyzing trace with hash 827570693, now seen corresponding path program 1 times [2024-11-07 19:20:09,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:20:09,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879227547] [2024-11-07 19:20:09,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:09,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:20:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:10,129 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:20:10,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:20:10,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879227547] [2024-11-07 19:20:10,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879227547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:10,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:10,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:20:10,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662207273] [2024-11-07 19:20:10,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:10,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:20:10,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:20:10,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:20:10,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:20:10,149 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-11-07 19:20:10,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 44 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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:20:10,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:10,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-11-07 19:20:10,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:11,033 INFO L124 PetriNetUnfolderBase]: 2355/3922 cut-off events. [2024-11-07 19:20:11,033 INFO L125 PetriNetUnfolderBase]: For 8780/8783 co-relation queries the response was YES. [2024-11-07 19:20:11,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14278 conditions, 3922 events. 2355/3922 cut-off events. For 8780/8783 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 24816 event pairs, 500 based on Foata normal form. 99/4015 useless extension candidates. Maximal degree in co-relation 14260. Up to 2269 conditions per place. [2024-11-07 19:20:11,064 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 46 selfloop transitions, 19 changer transitions 54/129 dead transitions. [2024-11-07 19:20:11,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 129 transitions, 951 flow [2024-11-07 19:20:11,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 19:20:11,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-07 19:20:11,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 253 transitions. [2024-11-07 19:20:11,066 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.575 [2024-11-07 19:20:11,066 INFO L175 Difference]: Start difference. First operand has 64 places, 44 transitions, 213 flow. Second operand 10 states and 253 transitions. [2024-11-07 19:20:11,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 129 transitions, 951 flow [2024-11-07 19:20:11,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 129 transitions, 875 flow, removed 38 selfloop flow, removed 4 redundant places. [2024-11-07 19:20:11,095 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 361 flow [2024-11-07 19:20:11,095 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=361, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2024-11-07 19:20:11,096 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2024-11-07 19:20:11,097 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 361 flow [2024-11-07 19:20:11,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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:20:11,097 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:11,097 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:20:11,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 19:20:11,098 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:11,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:11,099 INFO L85 PathProgramCache]: Analyzing trace with hash 59559027, now seen corresponding path program 1 times [2024-11-07 19:20:11,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:20:11,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732154537] [2024-11-07 19:20:11,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:11,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:20:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:11,297 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:20:11,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:20:11,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732154537] [2024-11-07 19:20:11,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732154537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:11,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:11,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:20:11,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847101309] [2024-11-07 19:20:11,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:11,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:20:11,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:20:11,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:20:11,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:20:11,302 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-07 19:20:11,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 361 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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:20:11,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:11,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-07 19:20:11,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:12,212 INFO L124 PetriNetUnfolderBase]: 2791/4724 cut-off events. [2024-11-07 19:20:12,213 INFO L125 PetriNetUnfolderBase]: For 16588/17316 co-relation queries the response was YES. [2024-11-07 19:20:12,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18998 conditions, 4724 events. 2791/4724 cut-off events. For 16588/17316 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 32211 event pairs, 663 based on Foata normal form. 392/4954 useless extension candidates. Maximal degree in co-relation 18973. Up to 2030 conditions per place. [2024-11-07 19:20:12,258 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 46 selfloop transitions, 6 changer transitions 47/118 dead transitions. [2024-11-07 19:20:12,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 118 transitions, 1019 flow [2024-11-07 19:20:12,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:20:12,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:20:12,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 183 transitions. [2024-11-07 19:20:12,260 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5941558441558441 [2024-11-07 19:20:12,260 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 361 flow. Second operand 7 states and 183 transitions. [2024-11-07 19:20:12,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 118 transitions, 1019 flow [2024-11-07 19:20:12,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 118 transitions, 977 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-11-07 19:20:12,291 INFO L231 Difference]: Finished difference. Result has 68 places, 53 transitions, 371 flow [2024-11-07 19:20:12,291 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=371, PETRI_PLACES=68, PETRI_TRANSITIONS=53} [2024-11-07 19:20:12,294 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 19 predicate places. [2024-11-07 19:20:12,294 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 53 transitions, 371 flow [2024-11-07 19:20:12,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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:20:12,294 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:12,294 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:20:12,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 19:20:12,295 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:12,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:12,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1393230876, now seen corresponding path program 1 times [2024-11-07 19:20:12,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:20:12,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81412097] [2024-11-07 19:20:12,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:12,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:20:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:12,689 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:20:12,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:20:12,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81412097] [2024-11-07 19:20:12,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81412097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:12,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:12,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:20:12,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751307422] [2024-11-07 19:20:12,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:12,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:20:12,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:20:12,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:20:12,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:20:12,698 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-07 19:20:12,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 371 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 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:20:12,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:12,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-07 19:20:12,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:13,496 INFO L124 PetriNetUnfolderBase]: 3231/5480 cut-off events. [2024-11-07 19:20:13,497 INFO L125 PetriNetUnfolderBase]: For 17539/18594 co-relation queries the response was YES. [2024-11-07 19:20:13,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21658 conditions, 5480 events. 3231/5480 cut-off events. For 17539/18594 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 38051 event pairs, 976 based on Foata normal form. 607/5881 useless extension candidates. Maximal degree in co-relation 21633. Up to 3591 conditions per place. [2024-11-07 19:20:13,536 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 37 selfloop transitions, 4 changer transitions 39/106 dead transitions. [2024-11-07 19:20:13,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 106 transitions, 877 flow [2024-11-07 19:20:13,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:20:13,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:20:13,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2024-11-07 19:20:13,538 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5811688311688312 [2024-11-07 19:20:13,538 INFO L175 Difference]: Start difference. First operand has 68 places, 53 transitions, 371 flow. Second operand 7 states and 179 transitions. [2024-11-07 19:20:13,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 106 transitions, 877 flow [2024-11-07 19:20:13,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 106 transitions, 855 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-11-07 19:20:13,591 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 417 flow [2024-11-07 19:20:13,591 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=417, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2024-11-07 19:20:13,591 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 21 predicate places. [2024-11-07 19:20:13,592 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 417 flow [2024-11-07 19:20:13,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 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:20:13,592 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:13,592 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:20:13,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 19:20:13,592 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:13,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:13,593 INFO L85 PathProgramCache]: Analyzing trace with hash 810999619, now seen corresponding path program 1 times [2024-11-07 19:20:13,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:20:13,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850069966] [2024-11-07 19:20:13,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:13,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:20:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:14,122 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:20:14,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:20:14,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850069966] [2024-11-07 19:20:14,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850069966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:14,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:14,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:20:14,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447464592] [2024-11-07 19:20:14,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:14,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:20:14,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:20:14,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:20:14,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:20:14,137 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-11-07 19:20:14,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 417 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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:20:14,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:14,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-11-07 19:20:14,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:15,375 INFO L124 PetriNetUnfolderBase]: 4492/7749 cut-off events. [2024-11-07 19:20:15,375 INFO L125 PetriNetUnfolderBase]: For 25276/25308 co-relation queries the response was YES. [2024-11-07 19:20:15,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31852 conditions, 7749 events. 4492/7749 cut-off events. For 25276/25308 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 58000 event pairs, 985 based on Foata normal form. 196/7884 useless extension candidates. Maximal degree in co-relation 31825. Up to 2933 conditions per place. [2024-11-07 19:20:15,425 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 57 selfloop transitions, 21 changer transitions 55/144 dead transitions. [2024-11-07 19:20:15,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 144 transitions, 1290 flow [2024-11-07 19:20:15,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 19:20:15,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-07 19:20:15,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 246 transitions. [2024-11-07 19:20:15,427 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5590909090909091 [2024-11-07 19:20:15,427 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 417 flow. Second operand 10 states and 246 transitions. [2024-11-07 19:20:15,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 144 transitions, 1290 flow [2024-11-07 19:20:15,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 144 transitions, 1267 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-11-07 19:20:15,466 INFO L231 Difference]: Finished difference. Result has 81 places, 63 transitions, 607 flow [2024-11-07 19:20:15,466 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=607, PETRI_PLACES=81, PETRI_TRANSITIONS=63} [2024-11-07 19:20:15,467 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 32 predicate places. [2024-11-07 19:20:15,467 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 63 transitions, 607 flow [2024-11-07 19:20:15,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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:20:15,467 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:15,468 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:20:15,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 19:20:15,468 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:15,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:15,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1542743980, now seen corresponding path program 1 times [2024-11-07 19:20:15,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:20:15,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500591600] [2024-11-07 19:20:15,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:15,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:20:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:15,718 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:20:15,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:20:15,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500591600] [2024-11-07 19:20:15,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500591600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:15,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:15,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:20:15,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946758706] [2024-11-07 19:20:15,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:15,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:20:15,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:20:15,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:20:15,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:20:15,723 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-07 19:20:15,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 63 transitions, 607 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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:20:15,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:15,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-07 19:20:15,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:16,689 INFO L124 PetriNetUnfolderBase]: 4122/7298 cut-off events. [2024-11-07 19:20:16,690 INFO L125 PetriNetUnfolderBase]: For 42892/44051 co-relation queries the response was YES. [2024-11-07 19:20:16,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33715 conditions, 7298 events. 4122/7298 cut-off events. For 42892/44051 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 55803 event pairs, 1856 based on Foata normal form. 634/7776 useless extension candidates. Maximal degree in co-relation 33680. Up to 4832 conditions per place. [2024-11-07 19:20:16,736 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 49 selfloop transitions, 14 changer transitions 42/132 dead transitions. [2024-11-07 19:20:16,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 132 transitions, 1473 flow [2024-11-07 19:20:16,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:20:16,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:20:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-11-07 19:20:16,739 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5823863636363636 [2024-11-07 19:20:16,739 INFO L175 Difference]: Start difference. First operand has 81 places, 63 transitions, 607 flow. Second operand 8 states and 205 transitions. [2024-11-07 19:20:16,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 132 transitions, 1473 flow [2024-11-07 19:20:16,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 132 transitions, 1415 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-07 19:20:16,802 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 721 flow [2024-11-07 19:20:16,803 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=721, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2024-11-07 19:20:16,803 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 35 predicate places. [2024-11-07 19:20:16,804 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 721 flow [2024-11-07 19:20:16,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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:20:16,805 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:16,805 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:20:16,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 19:20:16,805 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:16,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:16,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1127372396, now seen corresponding path program 2 times [2024-11-07 19:20:16,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:20:16,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138380231] [2024-11-07 19:20:16,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:16,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:20:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:17,157 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:20:17,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:20:17,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138380231] [2024-11-07 19:20:17,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138380231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:17,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:17,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:20:17,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962277636] [2024-11-07 19:20:17,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:17,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:20:17,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:20:17,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:20:17,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:20:17,162 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-07 19:20:17,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 721 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 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:20:17,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:17,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-07 19:20:17,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:18,208 INFO L124 PetriNetUnfolderBase]: 3958/7012 cut-off events. [2024-11-07 19:20:18,209 INFO L125 PetriNetUnfolderBase]: For 46743/47730 co-relation queries the response was YES. [2024-11-07 19:20:18,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34259 conditions, 7012 events. 3958/7012 cut-off events. For 46743/47730 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 53324 event pairs, 1805 based on Foata normal form. 624/7481 useless extension candidates. Maximal degree in co-relation 34220. Up to 4749 conditions per place. [2024-11-07 19:20:18,257 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 45 selfloop transitions, 14 changer transitions 42/128 dead transitions. [2024-11-07 19:20:18,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 128 transitions, 1476 flow [2024-11-07 19:20:18,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:20:18,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:20:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-11-07 19:20:18,260 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5738636363636364 [2024-11-07 19:20:18,260 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 721 flow. Second operand 8 states and 202 transitions. [2024-11-07 19:20:18,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 128 transitions, 1476 flow [2024-11-07 19:20:18,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 128 transitions, 1424 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-11-07 19:20:18,341 INFO L231 Difference]: Finished difference. Result has 87 places, 70 transitions, 739 flow [2024-11-07 19:20:18,341 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=739, PETRI_PLACES=87, PETRI_TRANSITIONS=70} [2024-11-07 19:20:18,343 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 38 predicate places. [2024-11-07 19:20:18,343 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 70 transitions, 739 flow [2024-11-07 19:20:18,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 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:20:18,343 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:18,343 INFO L204 CegarLoopForPetriNet]: trace histogram [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:20:18,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 19:20:18,343 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:18,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:18,344 INFO L85 PathProgramCache]: Analyzing trace with hash -97355430, now seen corresponding path program 1 times [2024-11-07 19:20:18,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:20:18,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074442910] [2024-11-07 19:20:18,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:18,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:20:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:19,435 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:20:19,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:20:19,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074442910] [2024-11-07 19:20:19,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074442910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:19,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:19,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:20:19,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120807376] [2024-11-07 19:20:19,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:19,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:20:19,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:20:19,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:20:19,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:20:19,452 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-07 19:20:19,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 70 transitions, 739 flow. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 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:20:19,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:19,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-07 19:20:19,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:20,451 INFO L124 PetriNetUnfolderBase]: 4961/8462 cut-off events. [2024-11-07 19:20:20,451 INFO L125 PetriNetUnfolderBase]: For 57395/57418 co-relation queries the response was YES. [2024-11-07 19:20:20,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41506 conditions, 8462 events. 4961/8462 cut-off events. For 57395/57418 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 62179 event pairs, 1438 based on Foata normal form. 244/8701 useless extension candidates. Maximal degree in co-relation 41465. Up to 4922 conditions per place. [2024-11-07 19:20:20,502 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 68 selfloop transitions, 34 changer transitions 94/205 dead transitions. [2024-11-07 19:20:20,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 205 transitions, 2562 flow [2024-11-07 19:20:20,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 19:20:20,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-07 19:20:20,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 242 transitions. [2024-11-07 19:20:20,504 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-11-07 19:20:20,504 INFO L175 Difference]: Start difference. First operand has 87 places, 70 transitions, 739 flow. Second operand 10 states and 242 transitions. [2024-11-07 19:20:20,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 205 transitions, 2562 flow [2024-11-07 19:20:20,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 205 transitions, 2492 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-11-07 19:20:20,581 INFO L231 Difference]: Finished difference. Result has 94 places, 88 transitions, 1090 flow [2024-11-07 19:20:20,581 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1090, PETRI_PLACES=94, PETRI_TRANSITIONS=88} [2024-11-07 19:20:20,581 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 45 predicate places. [2024-11-07 19:20:20,581 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 1090 flow [2024-11-07 19:20:20,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 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:20:20,582 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:20,582 INFO L204 CegarLoopForPetriNet]: trace histogram [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:20:20,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 19:20:20,582 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:20,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:20,583 INFO L85 PathProgramCache]: Analyzing trace with hash -364931210, now seen corresponding path program 1 times [2024-11-07 19:20:20,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:20:20,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009075696] [2024-11-07 19:20:20,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:20,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:20:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:20,700 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:20:20,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:20:20,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009075696] [2024-11-07 19:20:20,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009075696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:20,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:20,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:20:20,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126682913] [2024-11-07 19:20:20,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:20,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:20:20,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:20:20,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:20:20,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:20:20,709 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-07 19:20:20,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 1090 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:20:20,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:20,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-07 19:20:20,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:20,985 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][63], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 51#true, Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, 49#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 21#L759true, 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 220#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 224#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 218#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 215#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 226#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 222#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 92#(= ~x~0 0), 241#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)]) [2024-11-07 19:20:20,987 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-11-07 19:20:20,987 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-07 19:20:20,987 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-07 19:20:20,987 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-07 19:20:21,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][84], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, 239#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 51#true, Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 49#true, Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 220#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 224#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), 14#L762true, Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 218#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 215#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 226#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 222#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 92#(= ~x~0 0), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)]) [2024-11-07 19:20:21,050 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-11-07 19:20:21,050 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-07 19:20:21,050 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-07 19:20:21,050 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-07 19:20:21,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][84], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, 239#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), 51#true, Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 49#true, Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 220#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 224#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 218#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 215#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 226#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 222#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 38#P0EXITtrue, Black: 92#(= ~x~0 0), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)]) [2024-11-07 19:20:21,110 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-11-07 19:20:21,110 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-07 19:20:21,110 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-07 19:20:21,110 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-07 19:20:21,797 INFO L124 PetriNetUnfolderBase]: 6633/10569 cut-off events. [2024-11-07 19:20:21,798 INFO L125 PetriNetUnfolderBase]: For 97646/100947 co-relation queries the response was YES. [2024-11-07 19:20:21,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51675 conditions, 10569 events. 6633/10569 cut-off events. For 97646/100947 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 71253 event pairs, 1018 based on Foata normal form. 1950/12128 useless extension candidates. Maximal degree in co-relation 51629. Up to 5701 conditions per place. [2024-11-07 19:20:21,866 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 79 selfloop transitions, 5 changer transitions 6/123 dead transitions. [2024-11-07 19:20:21,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 123 transitions, 1635 flow [2024-11-07 19:20:21,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:20:21,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:20:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-11-07 19:20:21,867 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-11-07 19:20:21,867 INFO L175 Difference]: Start difference. First operand has 94 places, 88 transitions, 1090 flow. Second operand 4 states and 108 transitions. [2024-11-07 19:20:21,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 123 transitions, 1635 flow [2024-11-07 19:20:21,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 123 transitions, 1595 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-11-07 19:20:21,924 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 1019 flow [2024-11-07 19:20:21,924 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=981, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1019, PETRI_PLACES=87, PETRI_TRANSITIONS=86} [2024-11-07 19:20:21,924 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 38 predicate places. [2024-11-07 19:20:21,924 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 1019 flow [2024-11-07 19:20:21,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:20:21,924 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:21,925 INFO L204 CegarLoopForPetriNet]: trace histogram [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:20:21,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 19:20:21,925 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:21,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:21,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2047113351, now seen corresponding path program 1 times [2024-11-07 19:20:21,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:20:21,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428429366] [2024-11-07 19:20:21,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:21,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:20:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:22,072 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:20:22,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:20:22,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428429366] [2024-11-07 19:20:22,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428429366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:22,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:22,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:20:22,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614680065] [2024-11-07 19:20:22,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:22,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:20:22,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:20:22,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:20:22,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:20:22,080 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-07 19:20:22,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 1019 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:20:22,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:22,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-07 19:20:22,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:22,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][63], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 51#true, Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 49#true, Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 250#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 21#L759true, 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 92#(= ~x~0 0), Black: 239#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 241#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)]) [2024-11-07 19:20:22,325 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-11-07 19:20:22,325 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-07 19:20:22,325 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-07 19:20:22,325 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-07 19:20:22,387 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][80], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, 239#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 51#true, Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 49#true, Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 14#L762true, Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 252#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 92#(= ~x~0 0), Black: 241#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)]) [2024-11-07 19:20:22,388 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-11-07 19:20:22,388 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-07 19:20:22,388 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-07 19:20:22,388 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-07 19:20:22,479 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][80], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, 239#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 51#true, Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 49#true, Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 252#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 38#P0EXITtrue, Black: 92#(= ~x~0 0), Black: 241#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)]) [2024-11-07 19:20:22,479 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-11-07 19:20:22,479 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-07 19:20:22,479 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-07 19:20:22,479 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-07 19:20:22,982 INFO L124 PetriNetUnfolderBase]: 4618/7370 cut-off events. [2024-11-07 19:20:22,982 INFO L125 PetriNetUnfolderBase]: For 54185/56190 co-relation queries the response was YES. [2024-11-07 19:20:23,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34907 conditions, 7370 events. 4618/7370 cut-off events. For 54185/56190 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 47430 event pairs, 435 based on Foata normal form. 1272/8301 useless extension candidates. Maximal degree in co-relation 34863. Up to 2597 conditions per place. [2024-11-07 19:20:23,015 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 79 selfloop transitions, 8 changer transitions 16/133 dead transitions. [2024-11-07 19:20:23,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 133 transitions, 1678 flow [2024-11-07 19:20:23,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:20:23,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:20:23,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-11-07 19:20:23,016 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-11-07 19:20:23,016 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 1019 flow. Second operand 5 states and 137 transitions. [2024-11-07 19:20:23,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 133 transitions, 1678 flow [2024-11-07 19:20:23,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 133 transitions, 1650 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-07 19:20:23,037 INFO L231 Difference]: Finished difference. Result has 90 places, 81 transitions, 904 flow [2024-11-07 19:20:23,038 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=904, PETRI_PLACES=90, PETRI_TRANSITIONS=81} [2024-11-07 19:20:23,038 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 41 predicate places. [2024-11-07 19:20:23,038 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 81 transitions, 904 flow [2024-11-07 19:20:23,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:20:23,038 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:23,038 INFO L204 CegarLoopForPetriNet]: trace histogram [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:20:23,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 19:20:23,038 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:23,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:23,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1030053428, now seen corresponding path program 1 times [2024-11-07 19:20:23,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:20:23,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668615875] [2024-11-07 19:20:23,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:23,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:20:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:23,865 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:20:23,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:20:23,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668615875] [2024-11-07 19:20:23,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668615875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:23,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:23,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 19:20:23,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542807662] [2024-11-07 19:20:23,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:23,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 19:20:23,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:20:23,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 19:20:23,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 19:20:23,875 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-07 19:20:23,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 81 transitions, 904 flow. Second operand has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 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:20:23,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:23,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-07 19:20:23,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:24,915 INFO L124 PetriNetUnfolderBase]: 3248/6253 cut-off events. [2024-11-07 19:20:24,915 INFO L125 PetriNetUnfolderBase]: For 31534/33181 co-relation queries the response was YES. [2024-11-07 19:20:24,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27203 conditions, 6253 events. 3248/6253 cut-off events. For 31534/33181 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 50029 event pairs, 1073 based on Foata normal form. 489/6189 useless extension candidates. Maximal degree in co-relation 27172. Up to 2858 conditions per place. [2024-11-07 19:20:24,955 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 44 selfloop transitions, 19 changer transitions 38/139 dead transitions. [2024-11-07 19:20:24,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 139 transitions, 1585 flow [2024-11-07 19:20:24,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 19:20:24,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 19:20:24,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2024-11-07 19:20:24,956 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5656565656565656 [2024-11-07 19:20:24,956 INFO L175 Difference]: Start difference. First operand has 90 places, 81 transitions, 904 flow. Second operand 9 states and 224 transitions. [2024-11-07 19:20:24,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 139 transitions, 1585 flow [2024-11-07 19:20:24,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 139 transitions, 1546 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-07 19:20:24,982 INFO L231 Difference]: Finished difference. Result has 100 places, 82 transitions, 977 flow [2024-11-07 19:20:24,982 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=977, PETRI_PLACES=100, PETRI_TRANSITIONS=82} [2024-11-07 19:20:24,983 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 51 predicate places. [2024-11-07 19:20:24,983 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 82 transitions, 977 flow [2024-11-07 19:20:24,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 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:20:24,983 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:24,983 INFO L204 CegarLoopForPetriNet]: trace histogram [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:20:24,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 19:20:24,983 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:24,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:24,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1349137058, now seen corresponding path program 1 times [2024-11-07 19:20:24,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:20:24,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232803500] [2024-11-07 19:20:24,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:24,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:20:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:25,203 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:20:25,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:20:25,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232803500] [2024-11-07 19:20:25,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232803500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:25,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:25,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:20:25,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010028228] [2024-11-07 19:20:25,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:25,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:20:25,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:20:25,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:20:25,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:20:25,210 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-07 19:20:25,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 82 transitions, 977 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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:20:25,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:25,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-07 19:20:25,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:25,913 INFO L124 PetriNetUnfolderBase]: 3900/6494 cut-off events. [2024-11-07 19:20:25,913 INFO L125 PetriNetUnfolderBase]: For 57450/58703 co-relation queries the response was YES. [2024-11-07 19:20:25,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30586 conditions, 6494 events. 3900/6494 cut-off events. For 57450/58703 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 43629 event pairs, 396 based on Foata normal form. 881/7154 useless extension candidates. Maximal degree in co-relation 30550. Up to 2464 conditions per place. [2024-11-07 19:20:25,938 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 58 selfloop transitions, 11 changer transitions 30/120 dead transitions. [2024-11-07 19:20:25,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 120 transitions, 1554 flow [2024-11-07 19:20:25,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:20:25,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:20:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-11-07 19:20:25,939 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-07 19:20:25,939 INFO L175 Difference]: Start difference. First operand has 100 places, 82 transitions, 977 flow. Second operand 6 states and 150 transitions. [2024-11-07 19:20:25,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 120 transitions, 1554 flow [2024-11-07 19:20:25,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 120 transitions, 1364 flow, removed 85 selfloop flow, removed 11 redundant places. [2024-11-07 19:20:25,969 INFO L231 Difference]: Finished difference. Result has 92 places, 64 transitions, 622 flow [2024-11-07 19:20:25,969 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=622, PETRI_PLACES=92, PETRI_TRANSITIONS=64} [2024-11-07 19:20:25,970 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 43 predicate places. [2024-11-07 19:20:25,970 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 64 transitions, 622 flow [2024-11-07 19:20:25,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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:20:25,970 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:25,970 INFO L204 CegarLoopForPetriNet]: trace histogram [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:20:25,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 19:20:25,970 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:25,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:25,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1860468819, now seen corresponding path program 1 times [2024-11-07 19:20:25,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:20:25,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305634387] [2024-11-07 19:20:25,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:25,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:20:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:27,004 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:20:27,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:20:27,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305634387] [2024-11-07 19:20:27,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305634387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:27,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:27,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 19:20:27,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346991031] [2024-11-07 19:20:27,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:27,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 19:20:27,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:20:27,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 19:20:27,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-07 19:20:27,024 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-07 19:20:27,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 64 transitions, 622 flow. Second operand has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 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:20:27,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:27,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-07 19:20:27,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:27,420 INFO L124 PetriNetUnfolderBase]: 843/1745 cut-off events. [2024-11-07 19:20:27,420 INFO L125 PetriNetUnfolderBase]: For 8026/8377 co-relation queries the response was YES. [2024-11-07 19:20:27,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6871 conditions, 1745 events. 843/1745 cut-off events. For 8026/8377 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 11548 event pairs, 234 based on Foata normal form. 78/1647 useless extension candidates. Maximal degree in co-relation 6842. Up to 621 conditions per place. [2024-11-07 19:20:27,431 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 32 selfloop transitions, 6 changer transitions 23/89 dead transitions. [2024-11-07 19:20:27,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 89 transitions, 831 flow [2024-11-07 19:20:27,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:20:27,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:20:27,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-11-07 19:20:27,433 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.538961038961039 [2024-11-07 19:20:27,433 INFO L175 Difference]: Start difference. First operand has 92 places, 64 transitions, 622 flow. Second operand 7 states and 166 transitions. [2024-11-07 19:20:27,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 89 transitions, 831 flow [2024-11-07 19:20:27,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 89 transitions, 670 flow, removed 46 selfloop flow, removed 16 redundant places. [2024-11-07 19:20:27,447 INFO L231 Difference]: Finished difference. Result has 85 places, 57 transitions, 401 flow [2024-11-07 19:20:27,447 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=85, PETRI_TRANSITIONS=57} [2024-11-07 19:20:27,447 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 36 predicate places. [2024-11-07 19:20:27,447 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 57 transitions, 401 flow [2024-11-07 19:20:27,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 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:20:27,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:27,448 INFO L204 CegarLoopForPetriNet]: trace histogram [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:20:27,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 19:20:27,448 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:27,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:27,448 INFO L85 PathProgramCache]: Analyzing trace with hash -462981715, now seen corresponding path program 2 times [2024-11-07 19:20:27,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:20:27,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301714856] [2024-11-07 19:20:27,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:27,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:20:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:20:27,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:20:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:20:27,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 19:20:27,592 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:20:27,593 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-07 19:20:27,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-07 19:20:27,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-07 19:20:27,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-07 19:20:27,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-07 19:20:27,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-07 19:20:27,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-07 19:20:27,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 19:20:27,596 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:20:27,670 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:20:27,670 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:20:27,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:20:27 BasicIcfg [2024-11-07 19:20:27,678 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:20:27,678 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:20:27,678 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:20:27,679 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:20:27,679 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:20:05" (3/4) ... [2024-11-07 19:20:27,680 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:20:27,681 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:20:27,681 INFO L158 Benchmark]: Toolchain (without parser) took 23390.66ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 90.8MB in the beginning and 625.3MB in the end (delta: -534.4MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-07 19:20:27,682 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:20:27,682 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.34ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 67.7MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 19:20:27,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.46ms. Allocated memory is still 117.4MB. Free memory was 67.7MB in the beginning and 65.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:20:27,682 INFO L158 Benchmark]: Boogie Preprocessor took 63.88ms. Allocated memory is still 117.4MB. Free memory was 65.2MB in the beginning and 62.1MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:20:27,683 INFO L158 Benchmark]: RCFGBuilder took 704.60ms. Allocated memory is still 117.4MB. Free memory was 62.1MB in the beginning and 58.1MB in the end (delta: 4.0MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-11-07 19:20:27,683 INFO L158 Benchmark]: TraceAbstraction took 22092.50ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 57.6MB in the beginning and 625.7MB in the end (delta: -568.1MB). Peak memory consumption was 966.6MB. Max. memory is 16.1GB. [2024-11-07 19:20:27,683 INFO L158 Benchmark]: Witness Printer took 2.38ms. Allocated memory is still 1.7GB. Free memory was 625.7MB in the beginning and 625.3MB in the end (delta: 420.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:20:27,685 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.84ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 455.34ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 67.7MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.46ms. Allocated memory is still 117.4MB. Free memory was 67.7MB in the beginning and 65.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.88ms. Allocated memory is still 117.4MB. Free memory was 65.2MB in the beginning and 62.1MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 704.60ms. Allocated memory is still 117.4MB. Free memory was 62.1MB in the beginning and 58.1MB in the end (delta: 4.0MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * TraceAbstraction took 22092.50ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 57.6MB in the beginning and 625.7MB in the end (delta: -568.1MB). Peak memory consumption was 966.6MB. Max. memory is 16.1GB. * Witness Printer took 2.38ms. Allocated memory is still 1.7GB. Free memory was 625.7MB in the beginning and 625.3MB in the end (delta: 420.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=-3, t2490=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=-3, t2490=-2, t2491=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L788] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L791] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=-3, t2490=-2, t2491=-1, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=-3, t2490=-2, t2491=-1, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=-3, t2490=-2, t2491=-1, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "safe030_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 819]: 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: 821]: 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: 817]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 7 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: 21.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 757 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 718 mSDsluCounter, 290 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 221 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2176 IncrementalHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 69 mSDtfsCounter, 2176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1090occurred in iteration=10, InterpolantAutomatonStates: 109, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 329 NumberOfCodeBlocks, 329 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 284 ConstructedInterpolants, 0 QuantifiedInterpolants, 2375 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 19:20:27,707 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:20:30,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:20:30,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-07 19:20:30,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:20:30,146 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:20:30,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:20:30,181 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:20:30,181 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:20:30,181 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:20:30,181 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:20:30,181 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:20:30,181 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:20:30,182 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:20:30,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:20:30,182 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:20:30,182 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:20:30,182 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:20:30,182 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:20:30,182 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:20:30,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:20:30,182 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:20:30,182 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:20:30,182 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:20:30,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:20:30,183 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:20:30,183 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 19:20:30,183 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:20:30,183 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 19:20:30,183 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:20:30,183 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:20:30,183 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:20:30,184 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:20:30,184 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:20:30,184 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:20:30,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:20:30,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:20:30,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:20:30,185 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:20:30,185 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 19:20:30,185 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 19:20:30,185 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:20:30,185 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:20:30,185 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:20:30,186 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:20:30,186 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 -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 [2024-11-07 19:20:30,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:20:30,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:20:30,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:20:30,491 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:20:30,491 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:20:30,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2024-11-07 19:20:31,774 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:20:32,072 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:20:32,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2024-11-07 19:20:32,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b77a48356/ced1d987b8bc4929b48d7d735c358ca1/FLAGd01b563fc [2024-11-07 19:20:32,113 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b77a48356/ced1d987b8bc4929b48d7d735c358ca1 [2024-11-07 19:20:32,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:20:32,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:20:32,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:20:32,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:20:32,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:20:32,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:20:32" (1/1) ... [2024-11-07 19:20:32,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ad29730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:32, skipping insertion in model container [2024-11-07 19:20:32,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:20:32" (1/1) ... [2024-11-07 19:20:32,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:20:32,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:20:32,511 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:20:32,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:20:32,619 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:20:32,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:32 WrapperNode [2024-11-07 19:20:32,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:20:32,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:20:32,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:20:32,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:20:32,626 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:20:32" (1/1) ... [2024-11-07 19:20:32,654 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:20:32" (1/1) ... [2024-11-07 19:20:32,688 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-11-07 19:20:32,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:20:32,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:20:32,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:20:32,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:20:32,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:32" (1/1) ... [2024-11-07 19:20:32,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:32" (1/1) ... [2024-11-07 19:20:32,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:32" (1/1) ... [2024-11-07 19:20:32,728 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 19:20:32,728 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:32" (1/1) ... [2024-11-07 19:20:32,728 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:32" (1/1) ... [2024-11-07 19:20:32,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:32" (1/1) ... [2024-11-07 19:20:32,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:32" (1/1) ... [2024-11-07 19:20:32,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:32" (1/1) ... [2024-11-07 19:20:32,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:32" (1/1) ... [2024-11-07 19:20:32,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:20:32,746 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:20:32,746 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:20:32,746 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:20:32,747 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:32" (1/1) ... [2024-11-07 19:20:32,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:20:32,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:20:32,780 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:20:32,783 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:20:32,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 19:20:32,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:20:32,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 19:20:32,805 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-07 19:20:32,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-07 19:20:32,805 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-07 19:20:32,806 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-07 19:20:32,806 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-07 19:20:32,806 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-07 19:20:32,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 19:20:32,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:20:32,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:20:32,807 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:20:32,945 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:20:32,946 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:20:33,247 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:20:33,248 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:20:33,479 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:20:33,479 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 19:20:33,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:20:33 BoogieIcfgContainer [2024-11-07 19:20:33,480 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:20:33,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:20:33,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:20:33,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:20:33,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:20:32" (1/3) ... [2024-11-07 19:20:33,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe01bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:20:33, skipping insertion in model container [2024-11-07 19:20:33,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:20:32" (2/3) ... [2024-11-07 19:20:33,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe01bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:20:33, skipping insertion in model container [2024-11-07 19:20:33,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:20:33" (3/3) ... [2024-11-07 19:20:33,491 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2024-11-07 19:20:33,504 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:20:33,504 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-07 19:20:33,505 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:20:33,570 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 19:20:33,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-07 19:20:33,638 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-07 19:20:33,641 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:20:33,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-11-07 19:20:33,647 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-07 19:20:33,649 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-07 19:20:33,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:20:33,670 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;@24528e50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:20:33,670 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-07 19:20:33,674 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:20:33,674 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-07 19:20:33,674 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:20:33,674 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:33,675 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-07 19:20:33,677 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:33,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:33,683 INFO L85 PathProgramCache]: Analyzing trace with hash 11936538, now seen corresponding path program 1 times [2024-11-07 19:20:33,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:33,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30038568] [2024-11-07 19:20:33,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:33,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:33,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:33,697 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:33,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 19:20:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:33,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:20:33,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:33,824 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:20:33,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:33,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:33,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30038568] [2024-11-07 19:20:33,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30038568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:33,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:33,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:20:33,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129919984] [2024-11-07 19:20:33,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:33,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:20:33,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:33,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:20:33,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:20:33,859 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-11-07 19:20:33,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:20:33,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:33,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-11-07 19:20:33,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:34,270 INFO L124 PetriNetUnfolderBase]: 680/1277 cut-off events. [2024-11-07 19:20:34,271 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-07 19:20:34,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1277 events. 680/1277 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8166 event pairs, 104 based on Foata normal form. 72/1333 useless extension candidates. Maximal degree in co-relation 2342. Up to 844 conditions per place. [2024-11-07 19:20:34,288 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 33 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-11-07 19:20:34,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 195 flow [2024-11-07 19:20:34,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:20:34,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:20:34,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-11-07 19:20:34,300 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-07 19:20:34,301 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 99 transitions. [2024-11-07 19:20:34,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 195 flow [2024-11-07 19:20:34,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:20:34,307 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-07 19:20:34,310 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-07 19:20:34,313 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-07 19:20:34,313 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-07 19:20:34,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:20:34,313 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:34,314 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:20:34,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 19:20:34,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:34,515 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:34,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:34,516 INFO L85 PathProgramCache]: Analyzing trace with hash 18908189, now seen corresponding path program 1 times [2024-11-07 19:20:34,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:34,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483662763] [2024-11-07 19:20:34,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:34,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:34,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:34,520 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:34,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 19:20:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:34,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:20:34,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:34,653 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:20:34,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:34,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:34,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483662763] [2024-11-07 19:20:34,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [483662763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:34,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:34,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:20:34,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781166489] [2024-11-07 19:20:34,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:34,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:20:34,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:34,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:20:34,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:20:34,667 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-07 19:20:34,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:20:34,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:34,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-07 19:20:34,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:35,113 INFO L124 PetriNetUnfolderBase]: 1511/2579 cut-off events. [2024-11-07 19:20:35,114 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2024-11-07 19:20:35,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5055 conditions, 2579 events. 1511/2579 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 16042 event pairs, 149 based on Foata normal form. 80/2612 useless extension candidates. Maximal degree in co-relation 5045. Up to 1513 conditions per place. [2024-11-07 19:20:35,132 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 41 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2024-11-07 19:20:35,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 230 flow [2024-11-07 19:20:35,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:20:35,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:20:35,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-11-07 19:20:35,134 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6193181818181818 [2024-11-07 19:20:35,134 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 4 states and 109 transitions. [2024-11-07 19:20:35,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 230 flow [2024-11-07 19:20:35,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:20:35,137 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 112 flow [2024-11-07 19:20:35,137 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2024-11-07 19:20:35,138 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-11-07 19:20:35,138 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 112 flow [2024-11-07 19:20:35,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:20:35,138 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:35,138 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:20:35,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 19:20:35,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:35,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:35,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:35,340 INFO L85 PathProgramCache]: Analyzing trace with hash 763897214, now seen corresponding path program 1 times [2024-11-07 19:20:35,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:35,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017608506] [2024-11-07 19:20:35,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:35,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:35,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:35,342 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:35,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 19:20:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:35,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 19:20:35,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:35,485 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:20:35,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:35,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:35,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017608506] [2024-11-07 19:20:35,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017608506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:35,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:35,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:20:35,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395766298] [2024-11-07 19:20:35,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:35,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:20:35,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:35,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:20:35,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:20:35,495 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-07 19:20:35,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:20:35,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:35,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-07 19:20:35,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:35,816 INFO L124 PetriNetUnfolderBase]: 947/1651 cut-off events. [2024-11-07 19:20:35,817 INFO L125 PetriNetUnfolderBase]: For 386/386 co-relation queries the response was YES. [2024-11-07 19:20:35,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3695 conditions, 1651 events. 947/1651 cut-off events. For 386/386 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 9056 event pairs, 75 based on Foata normal form. 68/1680 useless extension candidates. Maximal degree in co-relation 3683. Up to 729 conditions per place. [2024-11-07 19:20:35,827 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 51 selfloop transitions, 8 changer transitions 1/72 dead transitions. [2024-11-07 19:20:35,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 319 flow [2024-11-07 19:20:35,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:20:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:20:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-11-07 19:20:35,829 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-11-07 19:20:35,829 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 112 flow. Second operand 5 states and 137 transitions. [2024-11-07 19:20:35,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 319 flow [2024-11-07 19:20:35,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 72 transitions, 309 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-07 19:20:35,832 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 152 flow [2024-11-07 19:20:35,833 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2024-11-07 19:20:35,833 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2024-11-07 19:20:35,833 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 152 flow [2024-11-07 19:20:35,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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:20:35,834 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:35,834 INFO L204 CegarLoopForPetriNet]: trace histogram [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:20:35,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 19:20:36,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:36,035 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:36,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:36,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1947524706, now seen corresponding path program 1 times [2024-11-07 19:20:36,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:36,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865148643] [2024-11-07 19:20:36,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:36,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:36,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:36,039 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:36,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 19:20:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:36,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:20:36,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:36,216 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:20:36,216 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:36,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:36,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865148643] [2024-11-07 19:20:36,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865148643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:36,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:36,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:20:36,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957862250] [2024-11-07 19:20:36,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:36,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:20:36,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:36,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:20:36,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:20:36,234 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-07 19:20:36,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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:20:36,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:36,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-07 19:20:36,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:36,551 INFO L124 PetriNetUnfolderBase]: 503/867 cut-off events. [2024-11-07 19:20:36,552 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2024-11-07 19:20:36,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2225 conditions, 867 events. 503/867 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3821 event pairs, 61 based on Foata normal form. 36/869 useless extension candidates. Maximal degree in co-relation 2211. Up to 268 conditions per place. [2024-11-07 19:20:36,559 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 45 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2024-11-07 19:20:36,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 330 flow [2024-11-07 19:20:36,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:20:36,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:20:36,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-11-07 19:20:36,563 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5643939393939394 [2024-11-07 19:20:36,564 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 152 flow. Second operand 6 states and 149 transitions. [2024-11-07 19:20:36,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 330 flow [2024-11-07 19:20:36,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 305 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-07 19:20:36,571 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 166 flow [2024-11-07 19:20:36,572 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-11-07 19:20:36,573 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2024-11-07 19:20:36,574 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 166 flow [2024-11-07 19:20:36,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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:20:36,574 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:36,574 INFO L204 CegarLoopForPetriNet]: trace histogram [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:20:36,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 19:20:36,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:36,775 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:36,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:36,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1445208008, now seen corresponding path program 1 times [2024-11-07 19:20:36,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:36,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423210972] [2024-11-07 19:20:36,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:36,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:36,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:36,778 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:36,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 19:20:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:36,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 19:20:36,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:36,928 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:20:36,928 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:36,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:36,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423210972] [2024-11-07 19:20:36,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423210972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:36,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:36,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:20:36,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489111515] [2024-11-07 19:20:36,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:36,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:20:36,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:36,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:20:36,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:20:36,931 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-07 19:20:36,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:20:36,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:36,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-07 19:20:36,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:37,013 INFO L124 PetriNetUnfolderBase]: 261/547 cut-off events. [2024-11-07 19:20:37,014 INFO L125 PetriNetUnfolderBase]: For 169/174 co-relation queries the response was YES. [2024-11-07 19:20:37,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1182 conditions, 547 events. 261/547 cut-off events. For 169/174 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2596 event pairs, 251 based on Foata normal form. 8/502 useless extension candidates. Maximal degree in co-relation 1167. Up to 426 conditions per place. [2024-11-07 19:20:37,017 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 18 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-11-07 19:20:37,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 41 transitions, 204 flow [2024-11-07 19:20:37,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:20:37,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:20:37,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-11-07 19:20:37,018 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-07 19:20:37,018 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 166 flow. Second operand 3 states and 75 transitions. [2024-11-07 19:20:37,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 41 transitions, 204 flow [2024-11-07 19:20:37,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 41 transitions, 148 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-07 19:20:37,020 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 108 flow [2024-11-07 19:20:37,020 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2024-11-07 19:20:37,021 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2024-11-07 19:20:37,021 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 108 flow [2024-11-07 19:20:37,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:20:37,021 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:37,021 INFO L204 CegarLoopForPetriNet]: trace histogram [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:20:37,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 19:20:37,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:37,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:37,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:37,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1445209619, now seen corresponding path program 1 times [2024-11-07 19:20:37,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:37,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689055348] [2024-11-07 19:20:37,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:20:37,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:37,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:37,225 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:37,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 19:20:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:20:37,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 19:20:37,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:37,846 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:20:37,847 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:37,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:37,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689055348] [2024-11-07 19:20:37,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689055348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:37,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:37,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 19:20:37,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285899637] [2024-11-07 19:20:37,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:37,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 19:20:37,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:37,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 19:20:37,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-07 19:20:37,866 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-07 19:20:37,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 108 flow. Second operand has 11 states, 11 states have (on average 19.545454545454547) internal successors, (215), 11 states have internal predecessors, (215), 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:20:37,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:37,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-07 19:20:37,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:38,206 INFO L124 PetriNetUnfolderBase]: 453/877 cut-off events. [2024-11-07 19:20:38,207 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:20:38,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1723 conditions, 877 events. 453/877 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4478 event pairs, 166 based on Foata normal form. 8/829 useless extension candidates. Maximal degree in co-relation 1716. Up to 373 conditions per place. [2024-11-07 19:20:38,211 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 31 selfloop transitions, 6 changer transitions 10/67 dead transitions. [2024-11-07 19:20:38,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 260 flow [2024-11-07 19:20:38,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:20:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:20:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-11-07 19:20:38,213 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.564935064935065 [2024-11-07 19:20:38,213 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 108 flow. Second operand 7 states and 174 transitions. [2024-11-07 19:20:38,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 260 flow [2024-11-07 19:20:38,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 259 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:20:38,215 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 143 flow [2024-11-07 19:20:38,215 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=143, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2024-11-07 19:20:38,215 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2024-11-07 19:20:38,215 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 143 flow [2024-11-07 19:20:38,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.545454545454547) internal successors, (215), 11 states have internal predecessors, (215), 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:20:38,216 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:38,216 INFO L204 CegarLoopForPetriNet]: trace histogram [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:20:38,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-07 19:20:38,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:38,420 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:38,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:38,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1782664199, now seen corresponding path program 2 times [2024-11-07 19:20:38,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:38,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22336814] [2024-11-07 19:20:38,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 19:20:38,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:38,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:38,424 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:38,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 19:20:38,513 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 19:20:38,514 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:20:38,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:20:38,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:38,565 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:20:38,565 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:38,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:38,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22336814] [2024-11-07 19:20:38,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22336814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:38,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:38,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:20:38,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391005490] [2024-11-07 19:20:38,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:38,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:20:38,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:38,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:20:38,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:20:38,572 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-07 19:20:38,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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:20:38,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:38,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-07 19:20:38,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:38,834 INFO L124 PetriNetUnfolderBase]: 893/1680 cut-off events. [2024-11-07 19:20:38,834 INFO L125 PetriNetUnfolderBase]: For 397/421 co-relation queries the response was YES. [2024-11-07 19:20:38,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3743 conditions, 1680 events. 893/1680 cut-off events. For 397/421 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10030 event pairs, 377 based on Foata normal form. 12/1547 useless extension candidates. Maximal degree in co-relation 3731. Up to 756 conditions per place. [2024-11-07 19:20:38,842 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 30 selfloop transitions, 2 changer transitions 14/66 dead transitions. [2024-11-07 19:20:38,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 298 flow [2024-11-07 19:20:38,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:20:38,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:20:38,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2024-11-07 19:20:38,843 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5863636363636363 [2024-11-07 19:20:38,843 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 143 flow. Second operand 5 states and 129 transitions. [2024-11-07 19:20:38,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 298 flow [2024-11-07 19:20:38,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 66 transitions, 287 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-07 19:20:38,846 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 147 flow [2024-11-07 19:20:38,847 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2024-11-07 19:20:38,847 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2024-11-07 19:20:38,847 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 147 flow [2024-11-07 19:20:38,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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:20:38,848 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:38,848 INFO L204 CegarLoopForPetriNet]: trace histogram [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:20:38,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-07 19:20:39,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:39,049 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:39,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:39,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1771300341, now seen corresponding path program 3 times [2024-11-07 19:20:39,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:39,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974685156] [2024-11-07 19:20:39,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 19:20:39,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:39,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:39,055 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:39,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-07 19:20:39,138 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-07 19:20:39,138 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:20:39,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:20:39,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:39,298 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:20:39,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:39,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:39,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974685156] [2024-11-07 19:20:39,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974685156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:39,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:39,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:20:39,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644280897] [2024-11-07 19:20:39,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:39,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:20:39,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:39,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:20:39,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:20:39,305 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-07 19:20:39,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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:20:39,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:39,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-07 19:20:39,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:39,525 INFO L124 PetriNetUnfolderBase]: 753/1439 cut-off events. [2024-11-07 19:20:39,525 INFO L125 PetriNetUnfolderBase]: For 207/207 co-relation queries the response was YES. [2024-11-07 19:20:39,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3166 conditions, 1439 events. 753/1439 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8093 event pairs, 301 based on Foata normal form. 8/1370 useless extension candidates. Maximal degree in co-relation 3153. Up to 585 conditions per place. [2024-11-07 19:20:39,532 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 27 selfloop transitions, 2 changer transitions 15/64 dead transitions. [2024-11-07 19:20:39,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 64 transitions, 293 flow [2024-11-07 19:20:39,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:20:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:20:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2024-11-07 19:20:39,534 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5772727272727273 [2024-11-07 19:20:39,534 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 147 flow. Second operand 5 states and 127 transitions. [2024-11-07 19:20:39,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 64 transitions, 293 flow [2024-11-07 19:20:39,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 64 transitions, 279 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-07 19:20:39,536 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 145 flow [2024-11-07 19:20:39,536 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2024-11-07 19:20:39,537 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2024-11-07 19:20:39,538 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 145 flow [2024-11-07 19:20:39,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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:20:39,538 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:39,538 INFO L204 CegarLoopForPetriNet]: trace histogram [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:20:39,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-07 19:20:39,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:39,739 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:39,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:39,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1583847147, now seen corresponding path program 4 times [2024-11-07 19:20:39,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:39,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106465471] [2024-11-07 19:20:39,740 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-07 19:20:39,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:39,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:39,742 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:39,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-07 19:20:39,820 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-07 19:20:39,821 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:20:39,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 19:20:39,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:20:39,989 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:20:39,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:20:39,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:20:39,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106465471] [2024-11-07 19:20:39,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106465471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:20:39,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:20:39,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 19:20:39,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002796386] [2024-11-07 19:20:39,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:20:39,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 19:20:39,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:20:39,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 19:20:39,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 19:20:40,003 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-07 19:20:40,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 145 flow. Second operand has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 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:20:40,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:20:40,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-07 19:20:40,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:20:40,301 INFO L124 PetriNetUnfolderBase]: 706/1427 cut-off events. [2024-11-07 19:20:40,301 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2024-11-07 19:20:40,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3076 conditions, 1427 events. 706/1427 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8278 event pairs, 373 based on Foata normal form. 8/1356 useless extension candidates. Maximal degree in co-relation 3063. Up to 448 conditions per place. [2024-11-07 19:20:40,310 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 37 selfloop transitions, 5 changer transitions 18/80 dead transitions. [2024-11-07 19:20:40,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 80 transitions, 373 flow [2024-11-07 19:20:40,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:20:40,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:20:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 186 transitions. [2024-11-07 19:20:40,311 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6038961038961039 [2024-11-07 19:20:40,311 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 145 flow. Second operand 7 states and 186 transitions. [2024-11-07 19:20:40,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 80 transitions, 373 flow [2024-11-07 19:20:40,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 80 transitions, 353 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-11-07 19:20:40,315 INFO L231 Difference]: Finished difference. Result has 62 places, 43 transitions, 159 flow [2024-11-07 19:20:40,315 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=62, PETRI_TRANSITIONS=43} [2024-11-07 19:20:40,317 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2024-11-07 19:20:40,317 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 43 transitions, 159 flow [2024-11-07 19:20:40,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 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:20:40,317 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:20:40,317 INFO L204 CegarLoopForPetriNet]: trace histogram [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:20:40,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-07 19:20:40,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:40,518 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:20:40,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:20:40,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2056870711, now seen corresponding path program 5 times [2024-11-07 19:20:40,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:20:40,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422468591] [2024-11-07 19:20:40,519 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-07 19:20:40,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:40,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:20:40,521 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:20:40,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-07 19:20:40,607 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 19:20:40,607 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-07 19:20:40,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:20:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:20:40,728 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 19:20:40,728 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:20:40,729 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-07 19:20:40,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-07 19:20:40,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-07 19:20:40,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-07 19:20:40,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-07 19:20:40,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-07 19:20:40,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-07 19:20:40,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-07 19:20:40,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:20:40,933 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-11-07 19:20:41,011 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:20:41,011 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:20:41,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:20:41 BasicIcfg [2024-11-07 19:20:41,019 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:20:41,020 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:20:41,020 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:20:41,020 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:20:41,021 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:20:33" (3/4) ... [2024-11-07 19:20:41,022 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:20:41,023 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:20:41,024 INFO L158 Benchmark]: Toolchain (without parser) took 8907.26ms. Allocated memory was 83.9MB in the beginning and 159.4MB in the end (delta: 75.5MB). Free memory was 59.5MB in the beginning and 63.6MB in the end (delta: -4.1MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. [2024-11-07 19:20:41,024 INFO L158 Benchmark]: CDTParser took 2.56ms. Allocated memory is still 83.9MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:20:41,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.72ms. Allocated memory is still 83.9MB. Free memory was 59.2MB in the beginning and 36.2MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 19:20:41,025 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.49ms. Allocated memory is still 83.9MB. Free memory was 36.2MB in the beginning and 33.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:20:41,025 INFO L158 Benchmark]: Boogie Preprocessor took 52.44ms. Allocated memory is still 83.9MB. Free memory was 33.8MB in the beginning and 30.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:20:41,025 INFO L158 Benchmark]: RCFGBuilder took 734.49ms. Allocated memory is still 83.9MB. Free memory was 30.9MB in the beginning and 36.6MB in the end (delta: -5.8MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2024-11-07 19:20:41,025 INFO L158 Benchmark]: TraceAbstraction took 7536.71ms. Allocated memory was 83.9MB in the beginning and 159.4MB in the end (delta: 75.5MB). Free memory was 36.1MB in the beginning and 63.6MB in the end (delta: -27.5MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2024-11-07 19:20:41,026 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 159.4MB. Free memory was 63.6MB in the beginning and 63.6MB in the end (delta: 14.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:20:41,027 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.56ms. Allocated memory is still 83.9MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.72ms. Allocated memory is still 83.9MB. Free memory was 59.2MB in the beginning and 36.2MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.49ms. Allocated memory is still 83.9MB. Free memory was 36.2MB in the beginning and 33.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.44ms. Allocated memory is still 83.9MB. Free memory was 33.8MB in the beginning and 30.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 734.49ms. Allocated memory is still 83.9MB. Free memory was 30.9MB in the beginning and 36.6MB in the end (delta: -5.8MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7536.71ms. Allocated memory was 83.9MB in the beginning and 159.4MB in the end (delta: 75.5MB). Free memory was 36.1MB in the beginning and 63.6MB in the end (delta: -27.5MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 159.4MB. Free memory was 63.6MB in the beginning and 63.6MB in the end (delta: 14.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=0, t2490=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2489=0, t2490=1, t2491=2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L788] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L791] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=0, t2490=1, t2491=2, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=0, t2490=1, t2491=2, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=0, t2490=1, t2491=2, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "safe030_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 819]: 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: 821]: 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: 817]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 7 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: 7.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 326 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 307 mSDsluCounter, 105 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1108 IncrementalHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 6 mSDtfsCounter, 1108 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=4, InterpolantAutomatonStates: 45, 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, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 244 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 205 ConstructedInterpolants, 0 QuantifiedInterpolants, 918 SizeOfPredicates, 13 NumberOfNonLiveVariables, 976 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 19:20:41,049 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 Result: UNKNOWN: Overapproximated counterexample