./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.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/mix035_power.opt_rmo.opt.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', '6f7e432a886f0272967b45cc6f21d24dfd6dfdb8fd02a0d13e6bb2d2db636b21'] 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/mix035_power.opt_rmo.opt.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 6f7e432a886f0272967b45cc6f21d24dfd6dfdb8fd02a0d13e6bb2d2db636b21 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:13:37,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:13:37,593 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:13:37,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:13:37,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:13:37,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:13:37,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:13:37,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:13:37,614 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:13:37,614 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:13:37,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:13:37,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:13:37,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:13:37,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:13:37,614 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:13:37,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:13:37,614 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:13:37,614 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:13:37,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:13:37,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:13:37,615 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:13:37,615 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:13:37,615 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:13:37,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:13:37,615 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:13:37,615 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:13:37,615 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:13:37,615 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:13:37,615 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:13:37,615 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:13:37,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:13:37,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:13:37,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:13:37,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:13:37,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:13:37,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:13:37,615 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:13:37,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:13:37,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:13:37,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:13:37,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:13:37,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:13:37,616 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 -> 6f7e432a886f0272967b45cc6f21d24dfd6dfdb8fd02a0d13e6bb2d2db636b21 [2024-11-07 19:13:37,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:13:37,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:13:37,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:13:37,885 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:13:37,885 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:13:37,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2024-11-07 19:13:39,031 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:13:39,265 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:13:39,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2024-11-07 19:13:39,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7a83e23d/df257f705f584da986930a340db79516/FLAGba6efe586 [2024-11-07 19:13:39,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7a83e23d/df257f705f584da986930a340db79516 [2024-11-07 19:13:39,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:13:39,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:13:39,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:13:39,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:13:39,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:13:39,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:13:39" (1/1) ... [2024-11-07 19:13:39,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@899920d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:39, skipping insertion in model container [2024-11-07 19:13:39,594 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:13:39" (1/1) ... [2024-11-07 19:13:39,619 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:13:39,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:13:39,838 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:13:39,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:13:39,946 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:13:39,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:39 WrapperNode [2024-11-07 19:13:39,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:13:39,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:13:39,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:13:39,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:13:39,955 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:13:39" (1/1) ... [2024-11-07 19:13:39,965 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:13:39" (1/1) ... [2024-11-07 19:13:39,989 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 122 [2024-11-07 19:13:39,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:13:39,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:13:39,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:13:39,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:13:39,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:39" (1/1) ... [2024-11-07 19:13:39,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:39" (1/1) ... [2024-11-07 19:13:40,000 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:39" (1/1) ... [2024-11-07 19:13:40,021 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:13:40,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:39" (1/1) ... [2024-11-07 19:13:40,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:39" (1/1) ... [2024-11-07 19:13:40,032 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:39" (1/1) ... [2024-11-07 19:13:40,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:39" (1/1) ... [2024-11-07 19:13:40,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:39" (1/1) ... [2024-11-07 19:13:40,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:39" (1/1) ... [2024-11-07 19:13:40,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:13:40,048 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:13:40,048 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:13:40,048 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:13:40,049 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:39" (1/1) ... [2024-11-07 19:13:40,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:13:40,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:13:40,081 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:13:40,084 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:13:40,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 19:13:40,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:13:40,104 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-07 19:13:40,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-07 19:13:40,104 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-07 19:13:40,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-07 19:13:40,104 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-07 19:13:40,104 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-07 19:13:40,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 19:13:40,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 19:13:40,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:13:40,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:13:40,106 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:13:40,218 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:13:40,220 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:13:40,526 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:13:40,526 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:13:40,710 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:13:40,711 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 19:13:40,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:13:40 BoogieIcfgContainer [2024-11-07 19:13:40,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:13:40,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:13:40,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:13:40,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:13:40,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:13:39" (1/3) ... [2024-11-07 19:13:40,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c6a6b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:13:40, skipping insertion in model container [2024-11-07 19:13:40,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:39" (2/3) ... [2024-11-07 19:13:40,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c6a6b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:13:40, skipping insertion in model container [2024-11-07 19:13:40,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:13:40" (3/3) ... [2024-11-07 19:13:40,720 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_power.opt_rmo.opt.i [2024-11-07 19:13:40,732 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:13:40,733 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-07 19:13:40,733 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:13:40,784 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 19:13:40,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 104 flow [2024-11-07 19:13:40,838 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2024-11-07 19:13:40,840 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:13:40,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 2/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-11-07 19:13:40,845 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 46 transitions, 104 flow [2024-11-07 19:13:40,848 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 43 transitions, 95 flow [2024-11-07 19:13:40,854 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:13:40,865 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;@6f8dfeb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:13:40,866 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-07 19:13:40,870 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:13:40,874 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-07 19:13:40,874 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:13:40,875 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:13:40,875 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 19:13:40,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:13:40,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:13:40,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1349117193, now seen corresponding path program 1 times [2024-11-07 19:13:40,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:13:40,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906027977] [2024-11-07 19:13:40,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:13:40,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:13:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:13:41,299 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:13:41,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:13:41,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906027977] [2024-11-07 19:13:41,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906027977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:13:41,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:13:41,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:13:41,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829380389] [2024-11-07 19:13:41,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:13:41,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:13:41,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:13:41,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:13:41,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:13:41,334 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 46 [2024-11-07 19:13:41,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 95 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:13:41,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:13:41,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 46 [2024-11-07 19:13:41,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:13:41,707 INFO L124 PetriNetUnfolderBase]: 603/1133 cut-off events. [2024-11-07 19:13:41,707 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-07 19:13:41,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2092 conditions, 1133 events. 603/1133 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7067 event pairs, 192 based on Foata normal form. 72/1175 useless extension candidates. Maximal degree in co-relation 2081. Up to 742 conditions per place. [2024-11-07 19:13:41,725 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 29 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2024-11-07 19:13:41,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 52 transitions, 182 flow [2024-11-07 19:13:41,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:13:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:13:41,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-11-07 19:13:41,738 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7536231884057971 [2024-11-07 19:13:41,740 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 95 flow. Second operand 3 states and 104 transitions. [2024-11-07 19:13:41,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 52 transitions, 182 flow [2024-11-07 19:13:41,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:13:41,748 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 86 flow [2024-11-07 19:13:41,750 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-11-07 19:13:41,755 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2024-11-07 19:13:41,756 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 86 flow [2024-11-07 19:13:41,756 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:13:41,756 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:13:41,757 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:13:41,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 19:13:41,758 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:13:41,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:13:41,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1738341749, now seen corresponding path program 1 times [2024-11-07 19:13:41,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:13:41,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836095270] [2024-11-07 19:13:41,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:13:41,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:13:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:13:41,842 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:13:41,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:13:41,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836095270] [2024-11-07 19:13:41,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836095270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:13:41,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:13:41,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:13:41,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633435260] [2024-11-07 19:13:41,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:13:41,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:13:41,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:13:41,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:13:41,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:13:41,846 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2024-11-07 19:13:41,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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:13:41,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:13:41,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2024-11-07 19:13:41,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:13:42,029 INFO L124 PetriNetUnfolderBase]: 528/1076 cut-off events. [2024-11-07 19:13:42,029 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-11-07 19:13:42,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1992 conditions, 1076 events. 528/1076 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7163 event pairs, 528 based on Foata normal form. 36/1052 useless extension candidates. Maximal degree in co-relation 1982. Up to 811 conditions per place. [2024-11-07 19:13:42,039 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 17 selfloop transitions, 1 changer transitions 1/37 dead transitions. [2024-11-07 19:13:42,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 37 transitions, 122 flow [2024-11-07 19:13:42,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:13:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:13:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-11-07 19:13:42,043 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6014492753623188 [2024-11-07 19:13:42,043 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 86 flow. Second operand 3 states and 83 transitions. [2024-11-07 19:13:42,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 37 transitions, 122 flow [2024-11-07 19:13:42,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:13:42,045 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 80 flow [2024-11-07 19:13:42,046 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-07 19:13:42,047 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2024-11-07 19:13:42,047 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 80 flow [2024-11-07 19:13:42,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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:13:42,047 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:13:42,047 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:13:42,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 19:13:42,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:13:42,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:13:42,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1738341856, now seen corresponding path program 1 times [2024-11-07 19:13:42,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:13:42,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390854654] [2024-11-07 19:13:42,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:13:42,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:13:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:13:42,286 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:13:42,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:13:42,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390854654] [2024-11-07 19:13:42,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390854654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:13:42,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:13:42,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:13:42,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192251096] [2024-11-07 19:13:42,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:13:42,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:13:42,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:13:42,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:13:42,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:13:42,294 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-07 19:13:42,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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:13:42,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:13:42,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-07 19:13:42,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:13:42,582 INFO L124 PetriNetUnfolderBase]: 1213/2151 cut-off events. [2024-11-07 19:13:42,582 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:13:42,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4047 conditions, 2151 events. 1213/2151 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 13759 event pairs, 147 based on Foata normal form. 80/2163 useless extension candidates. Maximal degree in co-relation 4041. Up to 1081 conditions per place. [2024-11-07 19:13:42,596 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 39 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2024-11-07 19:13:42,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 220 flow [2024-11-07 19:13:42,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:13:42,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:13:42,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2024-11-07 19:13:42,600 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6467391304347826 [2024-11-07 19:13:42,600 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 80 flow. Second operand 4 states and 119 transitions. [2024-11-07 19:13:42,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 220 flow [2024-11-07 19:13:42,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:13:42,603 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 113 flow [2024-11-07 19:13:42,604 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=44, 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=113, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-07 19:13:42,605 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2024-11-07 19:13:42,605 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 113 flow [2024-11-07 19:13:42,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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:13:42,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:13:42,605 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:13:42,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 19:13:42,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:13:42,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:13:42,607 INFO L85 PathProgramCache]: Analyzing trace with hash -385934787, now seen corresponding path program 1 times [2024-11-07 19:13:42,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:13:42,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505454890] [2024-11-07 19:13:42,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:13:42,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:13:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:13:42,841 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:13:42,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:13:42,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505454890] [2024-11-07 19:13:42,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505454890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:13:42,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:13:42,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:13:42,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963951327] [2024-11-07 19:13:42,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:13:42,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:13:42,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:13:42,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:13:42,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:13:42,854 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-07 19:13:42,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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:13:42,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:13:42,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-07 19:13:42,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:13:43,122 INFO L124 PetriNetUnfolderBase]: 809/1447 cut-off events. [2024-11-07 19:13:43,123 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2024-11-07 19:13:43,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3254 conditions, 1447 events. 809/1447 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 8140 event pairs, 73 based on Foata normal form. 68/1470 useless extension candidates. Maximal degree in co-relation 3245. Up to 521 conditions per place. [2024-11-07 19:13:43,133 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 49 selfloop transitions, 8 changer transitions 1/72 dead transitions. [2024-11-07 19:13:43,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 72 transitions, 316 flow [2024-11-07 19:13:43,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:13:43,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:13:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-11-07 19:13:43,136 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2024-11-07 19:13:43,136 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 113 flow. Second operand 5 states and 150 transitions. [2024-11-07 19:13:43,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 72 transitions, 316 flow [2024-11-07 19:13:43,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 306 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-07 19:13:43,140 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 153 flow [2024-11-07 19:13:43,141 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=153, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2024-11-07 19:13:43,141 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2024-11-07 19:13:43,142 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 153 flow [2024-11-07 19:13:43,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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:13:43,143 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:13:43,143 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:13:43,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 19:13:43,143 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:13:43,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:13:43,145 INFO L85 PathProgramCache]: Analyzing trace with hash -983112558, now seen corresponding path program 1 times [2024-11-07 19:13:43,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:13:43,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212189222] [2024-11-07 19:13:43,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:13:43,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:13:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:13:43,426 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:13:43,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:13:43,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212189222] [2024-11-07 19:13:43,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212189222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:13:43,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:13:43,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:13:43,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329617004] [2024-11-07 19:13:43,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:13:43,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:13:43,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:13:43,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:13:43,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:13:43,433 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-07 19:13:43,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:13:43,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:13:43,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-07 19:13:43,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:13:43,627 INFO L124 PetriNetUnfolderBase]: 477/831 cut-off events. [2024-11-07 19:13:43,628 INFO L125 PetriNetUnfolderBase]: For 730/730 co-relation queries the response was YES. [2024-11-07 19:13:43,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2144 conditions, 831 events. 477/831 cut-off events. For 730/730 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3753 event pairs, 59 based on Foata normal form. 36/832 useless extension candidates. Maximal degree in co-relation 2133. Up to 268 conditions per place. [2024-11-07 19:13:43,633 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 43 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2024-11-07 19:13:43,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 69 transitions, 327 flow [2024-11-07 19:13:43,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:13:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:13:43,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2024-11-07 19:13:43,636 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5978260869565217 [2024-11-07 19:13:43,636 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 153 flow. Second operand 6 states and 165 transitions. [2024-11-07 19:13:43,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 69 transitions, 327 flow [2024-11-07 19:13:43,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 302 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-07 19:13:43,641 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 167 flow [2024-11-07 19:13:43,642 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=49, 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=167, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2024-11-07 19:13:43,642 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2024-11-07 19:13:43,643 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 167 flow [2024-11-07 19:13:43,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:13:43,643 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:13:43,643 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, 1, 1] [2024-11-07 19:13:43,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 19:13:43,644 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:13:43,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:13:43,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1182933877, now seen corresponding path program 1 times [2024-11-07 19:13:43,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:13:43,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154126198] [2024-11-07 19:13:43,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:13:43,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:13:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:13:44,000 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:13:44,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:13:44,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154126198] [2024-11-07 19:13:44,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154126198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:13:44,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:13:44,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:13:44,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718676791] [2024-11-07 19:13:44,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:13:44,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:13:44,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:13:44,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:13:44,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:13:44,018 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-07 19:13:44,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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:13:44,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:13:44,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-07 19:13:44,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:13:44,309 INFO L124 PetriNetUnfolderBase]: 800/1458 cut-off events. [2024-11-07 19:13:44,309 INFO L125 PetriNetUnfolderBase]: For 613/624 co-relation queries the response was YES. [2024-11-07 19:13:44,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3368 conditions, 1458 events. 800/1458 cut-off events. For 613/624 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7761 event pairs, 179 based on Foata normal form. 8/1421 useless extension candidates. Maximal degree in co-relation 3356. Up to 722 conditions per place. [2024-11-07 19:13:44,324 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 48 selfloop transitions, 9 changer transitions 10/86 dead transitions. [2024-11-07 19:13:44,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 86 transitions, 407 flow [2024-11-07 19:13:44,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:13:44,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:13:44,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2024-11-07 19:13:44,326 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5807453416149069 [2024-11-07 19:13:44,326 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 167 flow. Second operand 7 states and 187 transitions. [2024-11-07 19:13:44,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 86 transitions, 407 flow [2024-11-07 19:13:44,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 86 transitions, 343 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-07 19:13:44,334 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 175 flow [2024-11-07 19:13:44,335 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=175, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2024-11-07 19:13:44,335 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2024-11-07 19:13:44,335 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 175 flow [2024-11-07 19:13:44,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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:13:44,335 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:13:44,335 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, 1, 1] [2024-11-07 19:13:44,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 19:13:44,335 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:13:44,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:13:44,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1450457295, now seen corresponding path program 2 times [2024-11-07 19:13:44,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:13:44,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220953389] [2024-11-07 19:13:44,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:13:44,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:13:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:13:44,599 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:13:44,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:13:44,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220953389] [2024-11-07 19:13:44,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220953389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:13:44,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:13:44,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:13:44,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459730781] [2024-11-07 19:13:44,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:13:44,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:13:44,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:13:44,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:13:44,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:13:44,616 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-07 19:13:44,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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:13:44,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:13:44,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-07 19:13:44,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:13:44,970 INFO L124 PetriNetUnfolderBase]: 1079/2007 cut-off events. [2024-11-07 19:13:44,971 INFO L125 PetriNetUnfolderBase]: For 590/618 co-relation queries the response was YES. [2024-11-07 19:13:44,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4592 conditions, 2007 events. 1079/2007 cut-off events. For 590/618 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 11911 event pairs, 163 based on Foata normal form. 30/1962 useless extension candidates. Maximal degree in co-relation 4579. Up to 1023 conditions per place. [2024-11-07 19:13:44,980 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 37 selfloop transitions, 13 changer transitions 19/89 dead transitions. [2024-11-07 19:13:44,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 89 transitions, 438 flow [2024-11-07 19:13:44,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 19:13:44,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-07 19:13:44,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2024-11-07 19:13:44,982 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5590062111801242 [2024-11-07 19:13:44,983 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 175 flow. Second operand 7 states and 180 transitions. [2024-11-07 19:13:44,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 89 transitions, 438 flow [2024-11-07 19:13:44,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 89 transitions, 432 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-07 19:13:44,987 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 271 flow [2024-11-07 19:13:44,987 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=271, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2024-11-07 19:13:44,987 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2024-11-07 19:13:44,988 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 271 flow [2024-11-07 19:13:44,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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:13:44,989 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:13:44,989 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, 1, 1] [2024-11-07 19:13:44,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 19:13:44,989 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:13:44,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:13:44,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1929155039, now seen corresponding path program 3 times [2024-11-07 19:13:44,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:13:44,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906714480] [2024-11-07 19:13:44,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:13:44,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:13:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:13:45,245 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:13:45,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:13:45,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906714480] [2024-11-07 19:13:45,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906714480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:13:45,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:13:45,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 19:13:45,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201153841] [2024-11-07 19:13:45,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:13:45,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:13:45,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:13:45,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:13:45,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:13:45,267 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-07 19:13:45,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 271 flow. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 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:13:45,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:13:45,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-07 19:13:45,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:13:45,641 INFO L124 PetriNetUnfolderBase]: 1387/2560 cut-off events. [2024-11-07 19:13:45,642 INFO L125 PetriNetUnfolderBase]: For 1669/1740 co-relation queries the response was YES. [2024-11-07 19:13:45,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6247 conditions, 2560 events. 1387/2560 cut-off events. For 1669/1740 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 16266 event pairs, 329 based on Foata normal form. 24/2462 useless extension candidates. Maximal degree in co-relation 6230. Up to 955 conditions per place. [2024-11-07 19:13:45,649 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 35 selfloop transitions, 5 changer transitions 37/97 dead transitions. [2024-11-07 19:13:45,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 97 transitions, 551 flow [2024-11-07 19:13:45,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 19:13:45,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 19:13:45,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-11-07 19:13:45,651 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5570652173913043 [2024-11-07 19:13:45,651 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 271 flow. Second operand 8 states and 205 transitions. [2024-11-07 19:13:45,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 97 transitions, 551 flow [2024-11-07 19:13:45,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 97 transitions, 545 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-07 19:13:45,654 INFO L231 Difference]: Finished difference. Result has 71 places, 49 transitions, 215 flow [2024-11-07 19:13:45,655 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=215, PETRI_PLACES=71, PETRI_TRANSITIONS=49} [2024-11-07 19:13:45,656 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2024-11-07 19:13:45,657 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 49 transitions, 215 flow [2024-11-07 19:13:45,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 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:13:45,657 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:13:45,657 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, 1, 1] [2024-11-07 19:13:45,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 19:13:45,657 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:13:45,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:13:45,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1246174737, now seen corresponding path program 4 times [2024-11-07 19:13:45,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:13:45,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361398992] [2024-11-07 19:13:45,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:13:45,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:13:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:13:46,738 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:13:46,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:13:46,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361398992] [2024-11-07 19:13:46,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361398992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:13:46,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:13:46,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 19:13:46,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820796987] [2024-11-07 19:13:46,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:13:46,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 19:13:46,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:13:46,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 19:13:46,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 19:13:46,756 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-07 19:13:46,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 49 transitions, 215 flow. Second operand has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 9 states have internal predecessors, (181), 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:13:46,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:13:46,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-07 19:13:46,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:13:47,258 INFO L124 PetriNetUnfolderBase]: 739/1477 cut-off events. [2024-11-07 19:13:47,259 INFO L125 PetriNetUnfolderBase]: For 910/950 co-relation queries the response was YES. [2024-11-07 19:13:47,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3567 conditions, 1477 events. 739/1477 cut-off events. For 910/950 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8730 event pairs, 138 based on Foata normal form. 9/1403 useless extension candidates. Maximal degree in co-relation 3547. Up to 472 conditions per place. [2024-11-07 19:13:47,265 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 38 selfloop transitions, 9 changer transitions 31/99 dead transitions. [2024-11-07 19:13:47,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 99 transitions, 540 flow [2024-11-07 19:13:47,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 19:13:47,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 19:13:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 270 transitions. [2024-11-07 19:13:47,268 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5335968379446641 [2024-11-07 19:13:47,268 INFO L175 Difference]: Start difference. First operand has 71 places, 49 transitions, 215 flow. Second operand 11 states and 270 transitions. [2024-11-07 19:13:47,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 99 transitions, 540 flow [2024-11-07 19:13:47,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 99 transitions, 493 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-11-07 19:13:47,273 INFO L231 Difference]: Finished difference. Result has 75 places, 51 transitions, 230 flow [2024-11-07 19:13:47,273 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=230, PETRI_PLACES=75, PETRI_TRANSITIONS=51} [2024-11-07 19:13:47,274 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 24 predicate places. [2024-11-07 19:13:47,274 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 51 transitions, 230 flow [2024-11-07 19:13:47,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 9 states have internal predecessors, (181), 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:13:47,274 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:13:47,274 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, 1, 1] [2024-11-07 19:13:47,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 19:13:47,274 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:13:47,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:13:47,274 INFO L85 PathProgramCache]: Analyzing trace with hash 7792669, now seen corresponding path program 5 times [2024-11-07 19:13:47,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:13:47,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249396464] [2024-11-07 19:13:47,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:13:47,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:13:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:13:47,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:13:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:13:47,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 19:13:47,365 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:13:47,366 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-07 19:13:47,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-07 19:13:47,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-07 19:13:47,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-07 19:13:47,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-07 19:13:47,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-07 19:13:47,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-07 19:13:47,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 19:13:47,368 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-11-07 19:13:47,433 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:13:47,433 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:13:47,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:13:47 BasicIcfg [2024-11-07 19:13:47,438 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:13:47,438 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:13:47,438 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:13:47,438 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:13:47,439 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:13:40" (3/4) ... [2024-11-07 19:13:47,441 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:13:47,442 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:13:47,443 INFO L158 Benchmark]: Toolchain (without parser) took 7854.17ms. Allocated memory was 117.4MB in the beginning and 369.1MB in the end (delta: 251.7MB). Free memory was 90.9MB in the beginning and 135.3MB in the end (delta: -44.4MB). Peak memory consumption was 203.8MB. Max. memory is 16.1GB. [2024-11-07 19:13:47,443 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:13:47,443 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.15ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 67.9MB in the end (delta: 22.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 19:13:47,444 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.41ms. Allocated memory is still 117.4MB. Free memory was 67.9MB in the beginning and 65.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:13:47,444 INFO L158 Benchmark]: Boogie Preprocessor took 56.48ms. Allocated memory is still 117.4MB. Free memory was 65.6MB in the beginning and 62.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:13:47,444 INFO L158 Benchmark]: RCFGBuilder took 663.72ms. Allocated memory is still 117.4MB. Free memory was 62.8MB in the beginning and 59.5MB in the end (delta: 3.3MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-11-07 19:13:47,445 INFO L158 Benchmark]: TraceAbstraction took 6724.89ms. Allocated memory was 117.4MB in the beginning and 369.1MB in the end (delta: 251.7MB). Free memory was 59.0MB in the beginning and 135.3MB in the end (delta: -76.3MB). Peak memory consumption was 173.5MB. Max. memory is 16.1GB. [2024-11-07 19:13:47,445 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 369.1MB. Free memory was 135.3MB in the beginning and 135.3MB in the end (delta: 21.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:13:47,446 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.26ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.15ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 67.9MB in the end (delta: 22.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.41ms. Allocated memory is still 117.4MB. Free memory was 67.9MB in the beginning and 65.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.48ms. Allocated memory is still 117.4MB. Free memory was 65.6MB in the beginning and 62.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 663.72ms. Allocated memory is still 117.4MB. Free memory was 62.8MB in the beginning and 59.5MB in the end (delta: 3.3MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6724.89ms. Allocated memory was 117.4MB in the beginning and 369.1MB in the end (delta: 251.7MB). Free memory was 59.0MB in the beginning and 135.3MB in the end (delta: -76.3MB). Peak memory consumption was 173.5MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 369.1MB. Free memory was 135.3MB in the beginning and 135.3MB in the end (delta: 21.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff1_thd0; [L732] 0 _Bool x$r_buff1_thd1; [L733] 0 _Bool x$r_buff1_thd2; [L734] 0 _Bool x$r_buff1_thd3; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L841] 0 pthread_t t916; [L842] FCALL, FORK 0 pthread_create(&t916, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t916=-3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L843] 0 pthread_t t917; [L844] FCALL, FORK 0 pthread_create(&t917, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t916=-3, t917=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L845] 0 pthread_t t918; [L846] FCALL, FORK 0 pthread_create(&t918, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t916=-3, t917=-2, t918=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L778] 2 x$w_buff1 = x$w_buff0 [L779] 2 x$w_buff0 = 1 [L780] 2 x$w_buff1_used = x$w_buff0_used [L781] 2 x$w_buff0_used = (_Bool)1 [L782] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L782] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L783] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L784] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L785] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L786] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L787] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L790] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L807] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L810] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L813] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L816] 3 __unbuffered_p2_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L753] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 1 x$flush_delayed = weak$$choice2 [L756] 1 x$mem_tmp = x [L757] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L758] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L759] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L760] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L761] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L763] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 __unbuffered_p0_EAX = x [L765] 1 x = x$flush_delayed ? x$mem_tmp : x [L766] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L819] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L820] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L821] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L822] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L823] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L793] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916=-3, t917=-2, t918=-1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L853] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L854] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L855] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L856] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916=-3, t917=-2, t918=-1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L859] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916=-3, t917=-2, t918=-1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L18] 0 __assert_fail ("0", "mix035_power.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 842]: 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: 846]: 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: 844]: 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, 72 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: 6.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 408 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 382 mSDsluCounter, 225 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 202 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1135 IncrementalHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 23 mSDtfsCounter, 1135 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=271occurred in iteration=7, InterpolantAutomatonStates: 54, 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, 2.6s InterpolantComputationTime, 241 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 1379 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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:13:47,471 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/mix035_power.opt_rmo.opt.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 6f7e432a886f0272967b45cc6f21d24dfd6dfdb8fd02a0d13e6bb2d2db636b21 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:13:49,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:13:49,407 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:13:49,411 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:13:49,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:13:49,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:13:49,437 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:13:49,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:13:49,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:13:49,438 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:13:49,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:13:49,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:13:49,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:13:49,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:13:49,439 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:13:49,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:13:49,440 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:13:49,440 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:13:49,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:13:49,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:13:49,440 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:13:49,440 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:13:49,440 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:13:49,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:13:49,441 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:13:49,441 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 19:13:49,441 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:13:49,441 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 19:13:49,441 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:13:49,441 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:13:49,441 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:13:49,441 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:13:49,441 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:13:49,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:13:49,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:13:49,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:13:49,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:13:49,442 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:13:49,442 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 19:13:49,442 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 19:13:49,442 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:13:49,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:13:49,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:13:49,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:13:49,443 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 -> 6f7e432a886f0272967b45cc6f21d24dfd6dfdb8fd02a0d13e6bb2d2db636b21 [2024-11-07 19:13:49,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:13:49,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:13:49,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:13:49,725 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:13:49,725 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:13:49,726 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2024-11-07 19:13:50,912 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:13:51,104 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:13:51,105 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2024-11-07 19:13:51,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2535e4645/31f29e00e1a64084ad154b9cebe1ef45/FLAG9d1b3541c [2024-11-07 19:13:51,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2535e4645/31f29e00e1a64084ad154b9cebe1ef45 [2024-11-07 19:13:51,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:13:51,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:13:51,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:13:51,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:13:51,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:13:51,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:13:51" (1/1) ... [2024-11-07 19:13:51,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67d7fb35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:51, skipping insertion in model container [2024-11-07 19:13:51,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:13:51" (1/1) ... [2024-11-07 19:13:51,507 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:13:51,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:13:51,732 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:13:51,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:13:51,839 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:13:51,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:51 WrapperNode [2024-11-07 19:13:51,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:13:51,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:13:51,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:13:51,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:13:51,849 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:13:51" (1/1) ... [2024-11-07 19:13:51,868 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:13:51" (1/1) ... [2024-11-07 19:13:51,892 INFO L138 Inliner]: procedures = 176, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 123 [2024-11-07 19:13:51,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:13:51,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:13:51,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:13:51,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:13:51,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:51" (1/1) ... [2024-11-07 19:13:51,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:51" (1/1) ... [2024-11-07 19:13:51,906 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:51" (1/1) ... [2024-11-07 19:13:51,930 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:13:51,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:51" (1/1) ... [2024-11-07 19:13:51,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:51" (1/1) ... [2024-11-07 19:13:51,939 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:51" (1/1) ... [2024-11-07 19:13:51,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:51" (1/1) ... [2024-11-07 19:13:51,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:51" (1/1) ... [2024-11-07 19:13:51,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:51" (1/1) ... [2024-11-07 19:13:51,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:13:51,954 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:13:51,954 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:13:51,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:13:51,955 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:51" (1/1) ... [2024-11-07 19:13:51,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:13:51,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:13:51,991 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:13:51,994 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:13:52,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 19:13:52,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:13:52,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 19:13:52,010 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-07 19:13:52,010 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-07 19:13:52,011 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-07 19:13:52,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-07 19:13:52,011 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-07 19:13:52,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-07 19:13:52,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 19:13:52,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:13:52,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:13:52,012 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:13:52,126 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:13:52,128 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:13:52,467 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:13:52,467 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:13:52,633 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:13:52,633 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 19:13:52,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:13:52 BoogieIcfgContainer [2024-11-07 19:13:52,634 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:13:52,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:13:52,636 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:13:52,639 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:13:52,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:13:51" (1/3) ... [2024-11-07 19:13:52,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ef413c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:13:52, skipping insertion in model container [2024-11-07 19:13:52,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:13:51" (2/3) ... [2024-11-07 19:13:52,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ef413c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:13:52, skipping insertion in model container [2024-11-07 19:13:52,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:13:52" (3/3) ... [2024-11-07 19:13:52,642 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_power.opt_rmo.opt.i [2024-11-07 19:13:52,653 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:13:52,654 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-07 19:13:52,654 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:13:52,711 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 19:13:52,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 104 flow [2024-11-07 19:13:52,759 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2024-11-07 19:13:52,760 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:13:52,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 2/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-11-07 19:13:52,764 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 46 transitions, 104 flow [2024-11-07 19:13:52,766 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 43 transitions, 95 flow [2024-11-07 19:13:52,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:13:52,778 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;@3ec63894, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:13:52,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-07 19:13:52,782 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:13:52,783 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-07 19:13:52,783 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:13:52,783 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:13:52,784 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 19:13:52,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:13:52,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:13:52,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1289950281, now seen corresponding path program 1 times [2024-11-07 19:13:52,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:13:52,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327984974] [2024-11-07 19:13:52,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:13:52,795 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:13:52,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:13:52,805 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:13:52,808 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:13:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:13:52,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:13:52,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:13:52,932 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:13:52,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:13:52,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:13:52,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327984974] [2024-11-07 19:13:52,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327984974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:13:52,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:13:52,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:13:52,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322633391] [2024-11-07 19:13:52,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:13:52,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:13:52,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:13:52,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:13:52,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:13:52,967 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 46 [2024-11-07 19:13:52,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 95 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:13:52,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:13:52,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 46 [2024-11-07 19:13:52,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:13:53,272 INFO L124 PetriNetUnfolderBase]: 603/1133 cut-off events. [2024-11-07 19:13:53,272 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-07 19:13:53,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2092 conditions, 1133 events. 603/1133 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7067 event pairs, 192 based on Foata normal form. 72/1175 useless extension candidates. Maximal degree in co-relation 2081. Up to 742 conditions per place. [2024-11-07 19:13:53,285 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 29 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2024-11-07 19:13:53,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 52 transitions, 182 flow [2024-11-07 19:13:53,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:13:53,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:13:53,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-11-07 19:13:53,312 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7536231884057971 [2024-11-07 19:13:53,314 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 95 flow. Second operand 3 states and 104 transitions. [2024-11-07 19:13:53,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 52 transitions, 182 flow [2024-11-07 19:13:53,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 19:13:53,323 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 86 flow [2024-11-07 19:13:53,325 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-11-07 19:13:53,328 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2024-11-07 19:13:53,329 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 86 flow [2024-11-07 19:13:53,329 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:13:53,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:13:53,329 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:13:53,333 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:13:53,532 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:13:53,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:13:53,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:13:53,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1949927629, now seen corresponding path program 1 times [2024-11-07 19:13:53,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:13:53,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398299827] [2024-11-07 19:13:53,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:13:53,534 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:13:53,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:13:53,536 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:13:53,536 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:13:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:13:53,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:13:53,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:13:53,639 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:13:53,639 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:13:53,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:13:53,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398299827] [2024-11-07 19:13:53,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398299827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:13:53,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:13:53,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:13:53,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291565990] [2024-11-07 19:13:53,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:13:53,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:13:53,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:13:53,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:13:53,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:13:53,649 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-07 19:13:53,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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:13:53,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:13:53,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-07 19:13:53,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:13:53,965 INFO L124 PetriNetUnfolderBase]: 1361/2435 cut-off events. [2024-11-07 19:13:53,965 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-11-07 19:13:53,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4675 conditions, 2435 events. 1361/2435 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 16038 event pairs, 147 based on Foata normal form. 80/2447 useless extension candidates. Maximal degree in co-relation 4665. Up to 1297 conditions per place. [2024-11-07 19:13:53,977 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 40 selfloop transitions, 5 changer transitions 1/61 dead transitions. [2024-11-07 19:13:53,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 232 flow [2024-11-07 19:13:53,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:13:53,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:13:53,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2024-11-07 19:13:53,978 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2024-11-07 19:13:53,978 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 86 flow. Second operand 4 states and 120 transitions. [2024-11-07 19:13:53,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 232 flow [2024-11-07 19:13:53,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 61 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:13:53,981 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 116 flow [2024-11-07 19:13:53,981 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2024-11-07 19:13:53,981 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2024-11-07 19:13:53,981 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 116 flow [2024-11-07 19:13:53,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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:13:53,982 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:13:53,982 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:13:53,985 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:13:54,182 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:13:54,183 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:13:54,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:13:54,183 INFO L85 PathProgramCache]: Analyzing trace with hash -673073346, now seen corresponding path program 1 times [2024-11-07 19:13:54,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:13:54,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601195909] [2024-11-07 19:13:54,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:13:54,184 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:13:54,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:13:54,187 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:13:54,188 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:13:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:13:54,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 19:13:54,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:13:54,291 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:13:54,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:13:54,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:13:54,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601195909] [2024-11-07 19:13:54,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601195909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:13:54,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:13:54,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:13:54,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506076576] [2024-11-07 19:13:54,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:13:54,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:13:54,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:13:54,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:13:54,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:13:54,297 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-07 19:13:54,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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:13:54,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:13:54,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-07 19:13:54,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:13:54,512 INFO L124 PetriNetUnfolderBase]: 877/1587 cut-off events. [2024-11-07 19:13:54,512 INFO L125 PetriNetUnfolderBase]: For 396/396 co-relation queries the response was YES. [2024-11-07 19:13:54,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3509 conditions, 1587 events. 877/1587 cut-off events. For 396/396 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 9202 event pairs, 73 based on Foata normal form. 68/1610 useless extension candidates. Maximal degree in co-relation 3497. Up to 625 conditions per place. [2024-11-07 19:13:54,519 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 50 selfloop transitions, 8 changer transitions 1/74 dead transitions. [2024-11-07 19:13:54,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 74 transitions, 321 flow [2024-11-07 19:13:54,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:13:54,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 19:13:54,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2024-11-07 19:13:54,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6565217391304348 [2024-11-07 19:13:54,521 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 116 flow. Second operand 5 states and 151 transitions. [2024-11-07 19:13:54,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 74 transitions, 321 flow [2024-11-07 19:13:54,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 74 transitions, 311 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-07 19:13:54,523 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 156 flow [2024-11-07 19:13:54,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2024-11-07 19:13:54,523 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2024-11-07 19:13:54,523 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 156 flow [2024-11-07 19:13:54,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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:13:54,523 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:13:54,523 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:13:54,526 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:13:54,726 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:13:54,726 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:13:54,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:13:54,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1267375617, now seen corresponding path program 1 times [2024-11-07 19:13:54,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:13:54,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365712104] [2024-11-07 19:13:54,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:13:54,727 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:13:54,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:13:54,730 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:13:54,731 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:13:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:13:54,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:13:54,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:13:54,837 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:13:54,837 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:13:54,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:13:54,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365712104] [2024-11-07 19:13:54,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365712104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:13:54,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:13:54,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:13:54,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875984802] [2024-11-07 19:13:54,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:13:54,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:13:54,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:13:54,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:13:54,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:13:54,845 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-07 19:13:54,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:13:54,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:13:54,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-07 19:13:54,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:13:55,055 INFO L124 PetriNetUnfolderBase]: 489/859 cut-off events. [2024-11-07 19:13:55,055 INFO L125 PetriNetUnfolderBase]: For 730/730 co-relation queries the response was YES. [2024-11-07 19:13:55,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2191 conditions, 859 events. 489/859 cut-off events. For 730/730 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3846 event pairs, 59 based on Foata normal form. 36/860 useless extension candidates. Maximal degree in co-relation 2177. Up to 268 conditions per place. [2024-11-07 19:13:55,060 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 44 selfloop transitions, 11 changer transitions 1/71 dead transitions. [2024-11-07 19:13:55,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 71 transitions, 332 flow [2024-11-07 19:13:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:13:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:13:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2024-11-07 19:13:55,061 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6014492753623188 [2024-11-07 19:13:55,062 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 156 flow. Second operand 6 states and 166 transitions. [2024-11-07 19:13:55,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 71 transitions, 332 flow [2024-11-07 19:13:55,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 307 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-07 19:13:55,067 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 170 flow [2024-11-07 19:13:55,068 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2024-11-07 19:13:55,068 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2024-11-07 19:13:55,069 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 170 flow [2024-11-07 19:13:55,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:13:55,069 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:13:55,069 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, 1, 1] [2024-11-07 19:13:55,073 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 (5)] Forceful destruction successful, exit code 0 [2024-11-07 19:13:55,269 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:13:55,270 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:13:55,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:13:55,271 INFO L85 PathProgramCache]: Analyzing trace with hash 464693216, now seen corresponding path program 1 times [2024-11-07 19:13:55,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:13:55,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059385753] [2024-11-07 19:13:55,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:13:55,271 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:13:55,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:13:55,273 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:13:55,273 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:13:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:13:55,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 19:13:55,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:13:55,382 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:13:55,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:13:55,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:13:55,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059385753] [2024-11-07 19:13:55,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059385753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:13:55,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:13:55,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:13:55,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754098070] [2024-11-07 19:13:55,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:13:55,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:13:55,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:13:55,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:13:55,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:13:55,383 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2024-11-07 19:13:55,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:13:55,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:13:55,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2024-11-07 19:13:55,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:13:55,453 INFO L124 PetriNetUnfolderBase]: 247/551 cut-off events. [2024-11-07 19:13:55,454 INFO L125 PetriNetUnfolderBase]: For 161/167 co-relation queries the response was YES. [2024-11-07 19:13:55,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 551 events. 247/551 cut-off events. For 161/167 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2767 event pairs, 237 based on Foata normal form. 8/508 useless extension candidates. Maximal degree in co-relation 1142. Up to 402 conditions per place. [2024-11-07 19:13:55,456 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 17 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2024-11-07 19:13:55,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 43 transitions, 206 flow [2024-11-07 19:13:55,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:13:55,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:13:55,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2024-11-07 19:13:55,458 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6014492753623188 [2024-11-07 19:13:55,458 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 170 flow. Second operand 3 states and 83 transitions. [2024-11-07 19:13:55,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 43 transitions, 206 flow [2024-11-07 19:13:55,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 150 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-07 19:13:55,461 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 112 flow [2024-11-07 19:13:55,461 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2024-11-07 19:13:55,462 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2024-11-07 19:13:55,463 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 112 flow [2024-11-07 19:13:55,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:13:55,463 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:13:55,463 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, 1, 1] [2024-11-07 19:13:55,467 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:13:55,664 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:13:55,664 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:13:55,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:13:55,665 INFO L85 PathProgramCache]: Analyzing trace with hash 464693109, now seen corresponding path program 1 times [2024-11-07 19:13:55,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:13:55,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729708237] [2024-11-07 19:13:55,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:13:55,665 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:13:55,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:13:55,667 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:13:55,669 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:13:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:13:55,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:13:55,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:13:55,791 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:13:55,791 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:13:55,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:13:55,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729708237] [2024-11-07 19:13:55,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729708237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:13:55,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:13:55,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:13:55,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056068018] [2024-11-07 19:13:55,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:13:55,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:13:55,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:13:55,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:13:55,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:13:55,799 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-11-07 19:13:55,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 112 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 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:13:55,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:13:55,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-11-07 19:13:55,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:13:56,027 INFO L124 PetriNetUnfolderBase]: 614/1171 cut-off events. [2024-11-07 19:13:56,027 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 19:13:56,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2290 conditions, 1171 events. 614/1171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6338 event pairs, 130 based on Foata normal form. 8/1123 useless extension candidates. Maximal degree in co-relation 2283. Up to 500 conditions per place. [2024-11-07 19:13:56,033 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 26 selfloop transitions, 1 changer transitions 23/71 dead transitions. [2024-11-07 19:13:56,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 274 flow [2024-11-07 19:13:56,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:13:56,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:13:56,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2024-11-07 19:13:56,035 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5978260869565217 [2024-11-07 19:13:56,035 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 112 flow. Second operand 6 states and 165 transitions. [2024-11-07 19:13:56,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 274 flow [2024-11-07 19:13:56,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 273 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 19:13:56,036 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 122 flow [2024-11-07 19:13:56,037 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=122, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2024-11-07 19:13:56,037 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2024-11-07 19:13:56,037 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 122 flow [2024-11-07 19:13:56,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 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:13:56,038 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:13:56,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, 1, 1, 1, 1, 1] [2024-11-07 19:13:56,042 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:13:56,241 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:13:56,242 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:13:56,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:13:56,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1330584853, now seen corresponding path program 2 times [2024-11-07 19:13:56,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:13:56,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105146325] [2024-11-07 19:13:56,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 19:13:56,242 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:13:56,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:13:56,244 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:13:56,245 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:13:56,315 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 19:13:56,315 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:13:56,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 19:13:56,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:13:56,631 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:13:56,631 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:13:56,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:13:56,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105146325] [2024-11-07 19:13:56,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105146325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:13:56,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:13:56,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 19:13:56,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26879353] [2024-11-07 19:13:56,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:13:56,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 19:13:56,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:13:56,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 19:13:56,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 19:13:56,643 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2024-11-07 19:13:56,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 122 flow. Second operand has 9 states, 9 states have (on average 22.77777777777778) internal successors, (205), 9 states have internal predecessors, (205), 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:13:56,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:13:56,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2024-11-07 19:13:56,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:13:56,921 INFO L124 PetriNetUnfolderBase]: 423/876 cut-off events. [2024-11-07 19:13:56,921 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-07 19:13:56,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1739 conditions, 876 events. 423/876 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4564 event pairs, 101 based on Foata normal form. 8/835 useless extension candidates. Maximal degree in co-relation 1728. Up to 193 conditions per place. [2024-11-07 19:13:56,924 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 27 selfloop transitions, 4 changer transitions 23/77 dead transitions. [2024-11-07 19:13:56,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 77 transitions, 310 flow [2024-11-07 19:13:56,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 19:13:56,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-07 19:13:56,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 244 transitions. [2024-11-07 19:13:56,925 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5893719806763285 [2024-11-07 19:13:56,925 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 122 flow. Second operand 9 states and 244 transitions. [2024-11-07 19:13:56,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 77 transitions, 310 flow [2024-11-07 19:13:56,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 77 transitions, 299 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-07 19:13:56,927 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 133 flow [2024-11-07 19:13:56,927 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=133, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2024-11-07 19:13:56,928 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2024-11-07 19:13:56,928 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 133 flow [2024-11-07 19:13:56,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.77777777777778) internal successors, (205), 9 states have internal predecessors, (205), 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:13:56,928 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:13:56,928 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, 1, 1] [2024-11-07 19:13:56,933 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 (8)] Ended with exit code 0 [2024-11-07 19:13:57,133 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:13:57,133 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:13:57,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:13:57,134 INFO L85 PathProgramCache]: Analyzing trace with hash -2064368601, now seen corresponding path program 3 times [2024-11-07 19:13:57,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:13:57,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139573211] [2024-11-07 19:13:57,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 19:13:57,134 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:13:57,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:13:57,136 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:13:57,138 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:13:57,203 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-07 19:13:57,203 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:13:57,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:13:57,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:13:57,255 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:13:57,255 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:13:57,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:13:57,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139573211] [2024-11-07 19:13:57,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139573211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:13:57,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:13:57,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:13:57,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244965482] [2024-11-07 19:13:57,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:13:57,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:13:57,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:13:57,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:13:57,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:13:57,269 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-11-07 19:13:57,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 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:13:57,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:13:57,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-11-07 19:13:57,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:13:57,481 INFO L124 PetriNetUnfolderBase]: 541/1151 cut-off events. [2024-11-07 19:13:57,481 INFO L125 PetriNetUnfolderBase]: For 196/200 co-relation queries the response was YES. [2024-11-07 19:13:57,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2448 conditions, 1151 events. 541/1151 cut-off events. For 196/200 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6647 event pairs, 217 based on Foata normal form. 8/1107 useless extension candidates. Maximal degree in co-relation 2435. Up to 423 conditions per place. [2024-11-07 19:13:57,485 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 21 selfloop transitions, 1 changer transitions 23/66 dead transitions. [2024-11-07 19:13:57,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 66 transitions, 290 flow [2024-11-07 19:13:57,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:13:57,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 19:13:57,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 160 transitions. [2024-11-07 19:13:57,486 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5797101449275363 [2024-11-07 19:13:57,486 INFO L175 Difference]: Start difference. First operand has 62 places, 42 transitions, 133 flow. Second operand 6 states and 160 transitions. [2024-11-07 19:13:57,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 66 transitions, 290 flow [2024-11-07 19:13:57,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 264 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-11-07 19:13:57,505 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 130 flow [2024-11-07 19:13:57,505 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=130, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2024-11-07 19:13:57,505 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2024-11-07 19:13:57,505 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 130 flow [2024-11-07 19:13:57,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 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:13:57,506 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:13:57,506 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, 1, 1] [2024-11-07 19:13:57,510 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:13:57,706 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:13:57,706 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-07 19:13:57,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:13:57,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1696714231, now seen corresponding path program 4 times [2024-11-07 19:13:57,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:13:57,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584971053] [2024-11-07 19:13:57,707 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-07 19:13:57,707 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:13:57,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:13:57,712 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:13:57,713 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:13:57,785 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-07 19:13:57,785 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-07 19:13:57,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:13:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:13:57,876 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 19:13:57,877 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:13:57,877 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-07 19:13:57,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-07 19:13:57,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-07 19:13:57,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-07 19:13:57,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-07 19:13:57,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-07 19:13:57,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-07 19:13:57,887 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:13:58,083 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:13:58,083 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-07 19:13:58,145 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:13:58,145 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:13:58,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:13:58 BasicIcfg [2024-11-07 19:13:58,151 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:13:58,151 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:13:58,151 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:13:58,151 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:13:58,152 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:13:52" (3/4) ... [2024-11-07 19:13:58,154 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:13:58,154 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:13:58,155 INFO L158 Benchmark]: Toolchain (without parser) took 6677.94ms. Allocated memory was 109.1MB in the beginning and 167.8MB in the end (delta: 58.7MB). Free memory was 83.4MB in the beginning and 103.3MB in the end (delta: -19.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-07 19:13:58,156 INFO L158 Benchmark]: CDTParser took 2.52ms. Allocated memory is still 83.9MB. Free memory is still 64.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:13:58,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.63ms. Allocated memory is still 109.1MB. Free memory was 83.2MB in the beginning and 60.4MB in the end (delta: 22.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 19:13:58,156 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.60ms. Allocated memory is still 109.1MB. Free memory was 60.1MB in the beginning and 57.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:13:58,156 INFO L158 Benchmark]: Boogie Preprocessor took 59.06ms. Allocated memory is still 109.1MB. Free memory was 57.9MB in the beginning and 55.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:13:58,158 INFO L158 Benchmark]: RCFGBuilder took 680.09ms. Allocated memory is still 109.1MB. Free memory was 55.2MB in the beginning and 37.7MB in the end (delta: 17.5MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2024-11-07 19:13:58,158 INFO L158 Benchmark]: TraceAbstraction took 5515.48ms. Allocated memory was 109.1MB in the beginning and 167.8MB in the end (delta: 58.7MB). Free memory was 37.0MB in the beginning and 103.3MB in the end (delta: -66.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:13:58,158 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 103.3MB in the end (delta: 15.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:13:58,160 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.52ms. Allocated memory is still 83.9MB. Free memory is still 64.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.63ms. Allocated memory is still 109.1MB. Free memory was 83.2MB in the beginning and 60.4MB in the end (delta: 22.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.60ms. Allocated memory is still 109.1MB. Free memory was 60.1MB in the beginning and 57.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.06ms. Allocated memory is still 109.1MB. Free memory was 57.9MB in the beginning and 55.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 680.09ms. Allocated memory is still 109.1MB. Free memory was 55.2MB in the beginning and 37.7MB in the end (delta: 17.5MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5515.48ms. Allocated memory was 109.1MB in the beginning and 167.8MB in the end (delta: 58.7MB). Free memory was 37.0MB in the beginning and 103.3MB in the end (delta: -66.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 103.3MB in the end (delta: 15.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff1_thd0; [L732] 0 _Bool x$r_buff1_thd1; [L733] 0 _Bool x$r_buff1_thd2; [L734] 0 _Bool x$r_buff1_thd3; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L841] 0 pthread_t t916; [L842] FCALL, FORK 0 pthread_create(&t916, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t916=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L843] 0 pthread_t t917; [L844] FCALL, FORK 0 pthread_create(&t917, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t916=0, t917=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L778] 2 x$w_buff1 = x$w_buff0 [L779] 2 x$w_buff0 = 1 [L780] 2 x$w_buff1_used = x$w_buff0_used [L781] 2 x$w_buff0_used = (_Bool)1 [L782] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L782] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L783] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L784] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L785] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L786] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L787] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L845] 0 pthread_t t918; [L846] FCALL, FORK 0 pthread_create(&t918, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t916=0, t917=1, t918=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L790] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L807] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L810] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L813] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L816] 3 __unbuffered_p2_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L753] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 1 x$flush_delayed = weak$$choice2 [L756] 1 x$mem_tmp = x [L757] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L758] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L759] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L760] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L761] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L763] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 __unbuffered_p0_EAX = x [L765] 1 x = x$flush_delayed ? x$mem_tmp : x [L766] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L793] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L819] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L820] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L821] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L822] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L823] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916=0, t917=1, t918=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L853] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L854] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L855] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L856] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916=0, t917=1, t918=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L859] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916=0, t917=1, t918=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L18] 0 __assert_fail ("0", "mix035_power.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 842]: 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: 846]: 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: 844]: 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, 72 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: 5.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 311 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 297 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 987 IncrementalHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 9 mSDtfsCounter, 987 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=4, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 722 SizeOfPredicates, 14 NumberOfNonLiveVariables, 893 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:13:58,181 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