./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix004.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix004.opt.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 89021de777f0aa5756284679b7b3bd19ab661d8d626f08ad7f7db0bc955b507d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:30:09,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:30:10,051 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:30:10,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:30:10,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:30:10,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:30:10,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:30:10,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:30:10,088 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:30:10,088 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:30:10,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:30:10,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:30:10,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:30:10,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:30:10,090 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:30:10,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:30:10,090 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:30:10,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:30:10,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:30:10,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:30:10,095 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:30:10,099 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:30:10,099 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:30:10,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:30:10,100 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:30:10,100 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:30:10,100 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:30:10,100 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:30:10,101 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:30:10,101 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:30:10,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:30:10,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:30:10,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:30:10,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:30:10,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:30:10,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:30:10,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:30:10,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:30:10,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:30:10,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:30:10,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:30:10,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:30:10,105 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/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 -> 89021de777f0aa5756284679b7b3bd19ab661d8d626f08ad7f7db0bc955b507d [2024-10-11 19:30:10,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:30:10,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:30:10,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:30:10,421 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:30:10,422 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:30:10,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix004.opt.i [2024-10-11 19:30:11,961 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:30:12,219 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:30:12,219 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix004.opt.i [2024-10-11 19:30:12,245 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a9be76fd9/3c7aea86d32a46218af94c8369d03e43/FLAG09b6435b9 [2024-10-11 19:30:12,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a9be76fd9/3c7aea86d32a46218af94c8369d03e43 [2024-10-11 19:30:12,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:30:12,265 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:30:12,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:30:12,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:30:12,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:30:12,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:30:12" (1/1) ... [2024-10-11 19:30:12,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71869034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:12, skipping insertion in model container [2024-10-11 19:30:12,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:30:12" (1/1) ... [2024-10-11 19:30:12,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:30:12,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:30:12,788 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:30:12,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:30:12,897 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:30:12,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:12 WrapperNode [2024-10-11 19:30:12,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:30:12,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:30:12,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:30:12,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:30:12,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:12" (1/1) ... [2024-10-11 19:30:12,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:12" (1/1) ... [2024-10-11 19:30:12,976 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 156 [2024-10-11 19:30:12,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:30:12,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:30:12,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:30:12,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:30:12,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:12" (1/1) ... [2024-10-11 19:30:12,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:12" (1/1) ... [2024-10-11 19:30:13,002 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:12" (1/1) ... [2024-10-11 19:30:13,039 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-10-11 19:30:13,040 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:12" (1/1) ... [2024-10-11 19:30:13,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:12" (1/1) ... [2024-10-11 19:30:13,054 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:12" (1/1) ... [2024-10-11 19:30:13,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:12" (1/1) ... [2024-10-11 19:30:13,062 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:12" (1/1) ... [2024-10-11 19:30:13,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:12" (1/1) ... [2024-10-11 19:30:13,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:30:13,076 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:30:13,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:30:13,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:30:13,079 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:12" (1/1) ... [2024-10-11 19:30:13,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:30:13,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:30:13,115 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:30:13,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:30:13,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 19:30:13,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:30:13,174 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-11 19:30:13,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-11 19:30:13,175 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-11 19:30:13,175 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-11 19:30:13,175 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-11 19:30:13,175 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-11 19:30:13,175 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-11 19:30:13,175 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-11 19:30:13,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 19:30:13,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 19:30:13,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:30:13,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:30:13,179 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 19:30:13,343 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:30:13,345 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:30:13,766 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:30:13,767 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:30:13,996 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:30:13,997 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 19:30:13,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:30:13 BoogieIcfgContainer [2024-10-11 19:30:13,998 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:30:14,000 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:30:14,001 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:30:14,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:30:14,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:30:12" (1/3) ... [2024-10-11 19:30:14,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69048efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:30:14, skipping insertion in model container [2024-10-11 19:30:14,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:12" (2/3) ... [2024-10-11 19:30:14,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69048efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:30:14, skipping insertion in model container [2024-10-11 19:30:14,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:30:13" (3/3) ... [2024-10-11 19:30:14,008 INFO L112 eAbstractionObserver]: Analyzing ICFG mix004.opt.i [2024-10-11 19:30:14,029 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:30:14,030 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-11 19:30:14,030 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:30:14,096 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 19:30:14,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2024-10-11 19:30:14,173 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2024-10-11 19:30:14,175 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:30:14,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 109 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-10-11 19:30:14,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2024-10-11 19:30:14,186 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2024-10-11 19:30:14,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:30:14,212 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;@37de5a03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:30:14,212 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 19:30:14,226 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:30:14,226 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2024-10-11 19:30:14,227 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:30:14,227 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:14,227 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:30:14,228 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:14,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:14,234 INFO L85 PathProgramCache]: Analyzing trace with hash -951107217, now seen corresponding path program 1 times [2024-10-11 19:30:14,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:30:14,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806863831] [2024-10-11 19:30:14,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:14,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:30:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:30:14,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:14,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:30:14,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806863831] [2024-10-11 19:30:14,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806863831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:14,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:14,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:30:14,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665220559] [2024-10-11 19:30:14,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:14,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:30:14,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:30:14,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:30:14,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:30:14,894 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2024-10-11 19:30:14,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:14,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:14,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2024-10-11 19:30:14,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:15,481 INFO L124 PetriNetUnfolderBase]: 1175/2003 cut-off events. [2024-10-11 19:30:15,481 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:30:15,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3739 conditions, 2003 events. 1175/2003 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 14303 event pairs, 199 based on Foata normal form. 120/2080 useless extension candidates. Maximal degree in co-relation 3727. Up to 1361 conditions per place. [2024-10-11 19:30:15,508 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 30 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2024-10-11 19:30:15,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 196 flow [2024-10-11 19:30:15,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:30:15,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:30:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2024-10-11 19:30:15,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7454545454545455 [2024-10-11 19:30:15,523 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 123 transitions. [2024-10-11 19:30:15,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 196 flow [2024-10-11 19:30:15,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:30:15,529 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2024-10-11 19:30:15,531 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-10-11 19:30:15,535 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-10-11 19:30:15,535 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2024-10-11 19:30:15,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:15,535 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:15,535 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:30:15,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 19:30:15,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:15,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:15,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1422308279, now seen corresponding path program 1 times [2024-10-11 19:30:15,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:30:15,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333922246] [2024-10-11 19:30:15,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:15,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:30:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:30:15,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:15,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:30:15,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333922246] [2024-10-11 19:30:15,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333922246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:15,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:15,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:30:15,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198012780] [2024-10-11 19:30:15,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:15,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:30:15,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:30:15,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:30:15,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:30:15,629 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2024-10-11 19:30:15,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:15,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:15,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2024-10-11 19:30:15,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:16,006 INFO L124 PetriNetUnfolderBase]: 1027/1867 cut-off events. [2024-10-11 19:30:16,007 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-10-11 19:30:16,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3477 conditions, 1867 events. 1027/1867 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 13980 event pairs, 1027 based on Foata normal form. 60/1860 useless extension candidates. Maximal degree in co-relation 3467. Up to 1484 conditions per place. [2024-10-11 19:30:16,021 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 20 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2024-10-11 19:30:16,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 146 flow [2024-10-11 19:30:16,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:30:16,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:30:16,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-10-11 19:30:16,024 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2024-10-11 19:30:16,024 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 104 transitions. [2024-10-11 19:30:16,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 146 flow [2024-10-11 19:30:16,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:30:16,027 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2024-10-11 19:30:16,028 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-10-11 19:30:16,028 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2024-10-11 19:30:16,029 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2024-10-11 19:30:16,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:16,029 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:16,029 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:30:16,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 19:30:16,030 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:16,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:16,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1422309497, now seen corresponding path program 1 times [2024-10-11 19:30:16,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:30:16,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659147242] [2024-10-11 19:30:16,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:16,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:30:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:30:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:16,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:30:16,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659147242] [2024-10-11 19:30:16,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659147242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:16,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:16,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:30:16,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983913639] [2024-10-11 19:30:16,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:16,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:30:16,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:30:16,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:30:16,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:30:16,320 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2024-10-11 19:30:16,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:16,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:16,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2024-10-11 19:30:16,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:16,906 INFO L124 PetriNetUnfolderBase]: 1327/2239 cut-off events. [2024-10-11 19:30:16,907 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:30:16,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4209 conditions, 2239 events. 1327/2239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 16283 event pairs, 307 based on Foata normal form. 0/2160 useless extension candidates. Maximal degree in co-relation 4203. Up to 853 conditions per place. [2024-10-11 19:30:16,922 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 27 selfloop transitions, 2 changer transitions 36/86 dead transitions. [2024-10-11 19:30:16,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 86 transitions, 312 flow [2024-10-11 19:30:16,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 19:30:16,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 19:30:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 275 transitions. [2024-10-11 19:30:16,928 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-10-11 19:30:16,930 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 8 states and 275 transitions. [2024-10-11 19:30:16,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 86 transitions, 312 flow [2024-10-11 19:30:16,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 86 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:30:16,932 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 111 flow [2024-10-11 19:30:16,933 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=111, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2024-10-11 19:30:16,933 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2024-10-11 19:30:16,933 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 111 flow [2024-10-11 19:30:16,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:16,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:16,934 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-10-11 19:30:16,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 19:30:16,937 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:16,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:16,937 INFO L85 PathProgramCache]: Analyzing trace with hash 160872010, now seen corresponding path program 1 times [2024-10-11 19:30:16,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:30:16,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032978269] [2024-10-11 19:30:16,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:16,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:30:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:30:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:17,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:30:17,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032978269] [2024-10-11 19:30:17,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032978269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:17,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:17,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:30:17,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313415495] [2024-10-11 19:30:17,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:17,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:30:17,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:30:17,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:30:17,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:30:17,267 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-10-11 19:30:17,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 43 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:17,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:17,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-10-11 19:30:17,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:17,728 INFO L124 PetriNetUnfolderBase]: 1251/2087 cut-off events. [2024-10-11 19:30:17,728 INFO L125 PetriNetUnfolderBase]: For 408/408 co-relation queries the response was YES. [2024-10-11 19:30:17,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4379 conditions, 2087 events. 1251/2087 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 13393 event pairs, 357 based on Foata normal form. 48/2098 useless extension candidates. Maximal degree in co-relation 4367. Up to 1285 conditions per place. [2024-10-11 19:30:17,744 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 32 selfloop transitions, 2 changer transitions 25/79 dead transitions. [2024-10-11 19:30:17,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 79 transitions, 316 flow [2024-10-11 19:30:17,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 19:30:17,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 19:30:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 236 transitions. [2024-10-11 19:30:17,746 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.612987012987013 [2024-10-11 19:30:17,746 INFO L175 Difference]: Start difference. First operand has 66 places, 43 transitions, 111 flow. Second operand 7 states and 236 transitions. [2024-10-11 19:30:17,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 79 transitions, 316 flow [2024-10-11 19:30:17,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 79 transitions, 294 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-10-11 19:30:17,753 INFO L231 Difference]: Finished difference. Result has 65 places, 43 transitions, 115 flow [2024-10-11 19:30:17,754 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=115, PETRI_PLACES=65, PETRI_TRANSITIONS=43} [2024-10-11 19:30:17,755 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2024-10-11 19:30:17,755 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 115 flow [2024-10-11 19:30:17,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:17,755 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:17,755 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] [2024-10-11 19:30:17,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 19:30:17,756 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:17,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:17,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1248855652, now seen corresponding path program 1 times [2024-10-11 19:30:17,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:30:17,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273269974] [2024-10-11 19:30:17,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:17,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:30:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:30:17,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:17,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:30:17,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273269974] [2024-10-11 19:30:17,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273269974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:17,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:17,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:30:17,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112870316] [2024-10-11 19:30:17,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:17,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:30:17,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:30:17,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:30:17,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:30:18,002 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-11 19:30:18,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 43 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:18,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:18,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-11 19:30:18,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:18,815 INFO L124 PetriNetUnfolderBase]: 4223/6312 cut-off events. [2024-10-11 19:30:18,816 INFO L125 PetriNetUnfolderBase]: For 700/700 co-relation queries the response was YES. [2024-10-11 19:30:18,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13345 conditions, 6312 events. 4223/6312 cut-off events. For 700/700 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 41156 event pairs, 603 based on Foata normal form. 216/6515 useless extension candidates. Maximal degree in co-relation 13332. Up to 3483 conditions per place. [2024-10-11 19:30:18,879 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 47 selfloop transitions, 6 changer transitions 1/71 dead transitions. [2024-10-11 19:30:18,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 71 transitions, 287 flow [2024-10-11 19:30:18,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:30:18,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:30:18,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2024-10-11 19:30:18,881 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6727272727272727 [2024-10-11 19:30:18,881 INFO L175 Difference]: Start difference. First operand has 65 places, 43 transitions, 115 flow. Second operand 4 states and 148 transitions. [2024-10-11 19:30:18,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 71 transitions, 287 flow [2024-10-11 19:30:18,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 71 transitions, 275 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-10-11 19:30:18,907 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 145 flow [2024-10-11 19:30:18,907 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2024-10-11 19:30:18,908 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -2 predicate places. [2024-10-11 19:30:18,908 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 145 flow [2024-10-11 19:30:18,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:18,908 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:18,908 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] [2024-10-11 19:30:18,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 19:30:18,909 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:18,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:18,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2043278659, now seen corresponding path program 1 times [2024-10-11 19:30:18,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:30:18,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521940106] [2024-10-11 19:30:18,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:18,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:30:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:30:19,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:19,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:30:19,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521940106] [2024-10-11 19:30:19,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521940106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:19,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:19,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:30:19,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633827714] [2024-10-11 19:30:19,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:19,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:30:19,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:30:19,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:30:19,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:30:19,252 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-11 19:30:19,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:19,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:19,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-11 19:30:19,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:19,950 INFO L124 PetriNetUnfolderBase]: 3605/5432 cut-off events. [2024-10-11 19:30:19,950 INFO L125 PetriNetUnfolderBase]: For 1664/1664 co-relation queries the response was YES. [2024-10-11 19:30:19,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13172 conditions, 5432 events. 3605/5432 cut-off events. For 1664/1664 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 34058 event pairs, 213 based on Foata normal form. 208/5627 useless extension candidates. Maximal degree in co-relation 13161. Up to 2673 conditions per place. [2024-10-11 19:30:19,996 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 60 selfloop transitions, 10 changer transitions 1/88 dead transitions. [2024-10-11 19:30:19,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 401 flow [2024-10-11 19:30:19,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:30:19,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:30:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2024-10-11 19:30:19,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6836363636363636 [2024-10-11 19:30:19,998 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 145 flow. Second operand 5 states and 188 transitions. [2024-10-11 19:30:19,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 401 flow [2024-10-11 19:30:20,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 390 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-11 19:30:20,040 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 197 flow [2024-10-11 19:30:20,041 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=197, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2024-10-11 19:30:20,041 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2024-10-11 19:30:20,042 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 197 flow [2024-10-11 19:30:20,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:20,042 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:20,042 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] [2024-10-11 19:30:20,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 19:30:20,042 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:20,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:20,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1705063832, now seen corresponding path program 1 times [2024-10-11 19:30:20,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:30:20,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260017562] [2024-10-11 19:30:20,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:20,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:30:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:30:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:20,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:30:20,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260017562] [2024-10-11 19:30:20,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260017562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:20,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:20,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:30:20,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828735916] [2024-10-11 19:30:20,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:20,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:30:20,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:30:20,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:30:20,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:30:20,446 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-11 19:30:20,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 197 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:20,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:20,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-11 19:30:20,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:21,162 INFO L124 PetriNetUnfolderBase]: 2467/3738 cut-off events. [2024-10-11 19:30:21,162 INFO L125 PetriNetUnfolderBase]: For 3182/3182 co-relation queries the response was YES. [2024-10-11 19:30:21,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10132 conditions, 3738 events. 2467/3738 cut-off events. For 3182/3182 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 20827 event pairs, 81 based on Foata normal form. 164/3889 useless extension candidates. Maximal degree in co-relation 10119. Up to 1249 conditions per place. [2024-10-11 19:30:21,189 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 71 selfloop transitions, 14 changer transitions 1/103 dead transitions. [2024-10-11 19:30:21,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 103 transitions, 525 flow [2024-10-11 19:30:21,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:30:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:30:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 226 transitions. [2024-10-11 19:30:21,191 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6848484848484848 [2024-10-11 19:30:21,191 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 197 flow. Second operand 6 states and 226 transitions. [2024-10-11 19:30:21,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 103 transitions, 525 flow [2024-10-11 19:30:21,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 103 transitions, 495 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-11 19:30:21,201 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 247 flow [2024-10-11 19:30:21,202 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=247, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2024-10-11 19:30:21,203 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2024-10-11 19:30:21,203 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 247 flow [2024-10-11 19:30:21,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:21,203 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:21,203 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, 1, 1] [2024-10-11 19:30:21,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 19:30:21,204 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:21,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:21,204 INFO L85 PathProgramCache]: Analyzing trace with hash 381069913, now seen corresponding path program 1 times [2024-10-11 19:30:21,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:30:21,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343491234] [2024-10-11 19:30:21,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:21,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:30:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:30:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:21,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:30:21,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343491234] [2024-10-11 19:30:21,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343491234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:21,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:21,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:30:21,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081257033] [2024-10-11 19:30:21,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:21,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:30:21,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:30:21,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:30:21,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:30:21,598 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-10-11 19:30:21,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:21,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:21,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-10-11 19:30:21,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:22,686 INFO L124 PetriNetUnfolderBase]: 5174/8459 cut-off events. [2024-10-11 19:30:22,686 INFO L125 PetriNetUnfolderBase]: For 4572/5018 co-relation queries the response was YES. [2024-10-11 19:30:22,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20428 conditions, 8459 events. 5174/8459 cut-off events. For 4572/5018 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 55140 event pairs, 1782 based on Foata normal form. 222/8372 useless extension candidates. Maximal degree in co-relation 20414. Up to 4355 conditions per place. [2024-10-11 19:30:22,769 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 69 selfloop transitions, 12 changer transitions 27/136 dead transitions. [2024-10-11 19:30:22,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 136 transitions, 671 flow [2024-10-11 19:30:22,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 19:30:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 19:30:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 299 transitions. [2024-10-11 19:30:22,773 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.604040404040404 [2024-10-11 19:30:22,773 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 247 flow. Second operand 9 states and 299 transitions. [2024-10-11 19:30:22,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 136 transitions, 671 flow [2024-10-11 19:30:22,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 136 transitions, 624 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-10-11 19:30:22,810 INFO L231 Difference]: Finished difference. Result has 77 places, 65 transitions, 311 flow [2024-10-11 19:30:22,811 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=311, PETRI_PLACES=77, PETRI_TRANSITIONS=65} [2024-10-11 19:30:22,813 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 15 predicate places. [2024-10-11 19:30:22,814 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 65 transitions, 311 flow [2024-10-11 19:30:22,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:22,818 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:22,818 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, 1, 1] [2024-10-11 19:30:22,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 19:30:22,819 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:22,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:22,819 INFO L85 PathProgramCache]: Analyzing trace with hash -2123344887, now seen corresponding path program 2 times [2024-10-11 19:30:22,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:30:22,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425641967] [2024-10-11 19:30:22,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:22,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:30:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:30:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:23,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:30:23,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425641967] [2024-10-11 19:30:23,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425641967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:23,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:23,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:30:23,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115509008] [2024-10-11 19:30:23,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:23,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:30:23,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:30:23,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:30:23,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:30:23,149 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-10-11 19:30:23,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 65 transitions, 311 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:23,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:23,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-10-11 19:30:23,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:24,260 INFO L124 PetriNetUnfolderBase]: 5110/8809 cut-off events. [2024-10-11 19:30:24,260 INFO L125 PetriNetUnfolderBase]: For 8154/8586 co-relation queries the response was YES. [2024-10-11 19:30:24,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24024 conditions, 8809 events. 5110/8809 cut-off events. For 8154/8586 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 63640 event pairs, 1764 based on Foata normal form. 232/8493 useless extension candidates. Maximal degree in co-relation 24004. Up to 2843 conditions per place. [2024-10-11 19:30:24,370 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 56 selfloop transitions, 3 changer transitions 14/109 dead transitions. [2024-10-11 19:30:24,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 109 transitions, 624 flow [2024-10-11 19:30:24,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:30:24,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:30:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 214 transitions. [2024-10-11 19:30:24,372 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6484848484848484 [2024-10-11 19:30:24,372 INFO L175 Difference]: Start difference. First operand has 77 places, 65 transitions, 311 flow. Second operand 6 states and 214 transitions. [2024-10-11 19:30:24,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 109 transitions, 624 flow [2024-10-11 19:30:24,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 109 transitions, 610 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-10-11 19:30:24,409 INFO L231 Difference]: Finished difference. Result has 79 places, 65 transitions, 320 flow [2024-10-11 19:30:24,409 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=79, PETRI_TRANSITIONS=65} [2024-10-11 19:30:24,410 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 17 predicate places. [2024-10-11 19:30:24,410 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 320 flow [2024-10-11 19:30:24,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:24,410 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:24,411 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, 1, 1] [2024-10-11 19:30:24,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 19:30:24,411 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:24,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:24,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1632880507, now seen corresponding path program 3 times [2024-10-11 19:30:24,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:30:24,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682007191] [2024-10-11 19:30:24,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:24,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:30:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:30:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:24,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:30:24,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682007191] [2024-10-11 19:30:24,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682007191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:24,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:24,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:30:24,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125844254] [2024-10-11 19:30:24,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:24,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 19:30:24,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:30:24,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 19:30:24,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 19:30:24,802 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-11 19:30:24,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 65 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:24,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:24,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-11 19:30:24,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:26,060 INFO L124 PetriNetUnfolderBase]: 5813/8712 cut-off events. [2024-10-11 19:30:26,061 INFO L125 PetriNetUnfolderBase]: For 10597/11691 co-relation queries the response was YES. [2024-10-11 19:30:26,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25777 conditions, 8712 events. 5813/8712 cut-off events. For 10597/11691 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 52627 event pairs, 336 based on Foata normal form. 423/8840 useless extension candidates. Maximal degree in co-relation 25755. Up to 2780 conditions per place. [2024-10-11 19:30:26,126 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 62 selfloop transitions, 18 changer transitions 10/113 dead transitions. [2024-10-11 19:30:26,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 113 transitions, 652 flow [2024-10-11 19:30:26,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 19:30:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 19:30:26,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 246 transitions. [2024-10-11 19:30:26,129 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.638961038961039 [2024-10-11 19:30:26,129 INFO L175 Difference]: Start difference. First operand has 79 places, 65 transitions, 320 flow. Second operand 7 states and 246 transitions. [2024-10-11 19:30:26,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 113 transitions, 652 flow [2024-10-11 19:30:26,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 113 transitions, 627 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-10-11 19:30:26,198 INFO L231 Difference]: Finished difference. Result has 80 places, 63 transitions, 335 flow [2024-10-11 19:30:26,199 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=335, PETRI_PLACES=80, PETRI_TRANSITIONS=63} [2024-10-11 19:30:26,200 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 18 predicate places. [2024-10-11 19:30:26,200 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 63 transitions, 335 flow [2024-10-11 19:30:26,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:26,200 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:26,201 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:30:26,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 19:30:26,201 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:26,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:26,201 INFO L85 PathProgramCache]: Analyzing trace with hash 385672050, now seen corresponding path program 1 times [2024-10-11 19:30:26,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:30:26,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213898153] [2024-10-11 19:30:26,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:26,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:30:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:30:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:26,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:30:26,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213898153] [2024-10-11 19:30:26,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213898153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:26,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:26,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:30:26,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17859947] [2024-10-11 19:30:26,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:26,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:30:26,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:30:26,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:30:26,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:30:26,489 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-10-11 19:30:26,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 63 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:26,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:26,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-10-11 19:30:26,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:27,171 INFO L124 PetriNetUnfolderBase]: 3517/6357 cut-off events. [2024-10-11 19:30:27,171 INFO L125 PetriNetUnfolderBase]: For 8069/8408 co-relation queries the response was YES. [2024-10-11 19:30:27,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18276 conditions, 6357 events. 3517/6357 cut-off events. For 8069/8408 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 47024 event pairs, 998 based on Foata normal form. 37/5929 useless extension candidates. Maximal degree in co-relation 18255. Up to 2164 conditions per place. [2024-10-11 19:30:27,211 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 44 selfloop transitions, 2 changer transitions 20/103 dead transitions. [2024-10-11 19:30:27,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 103 transitions, 602 flow [2024-10-11 19:30:27,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:30:27,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:30:27,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2024-10-11 19:30:27,213 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6272727272727273 [2024-10-11 19:30:27,213 INFO L175 Difference]: Start difference. First operand has 80 places, 63 transitions, 335 flow. Second operand 6 states and 207 transitions. [2024-10-11 19:30:27,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 103 transitions, 602 flow [2024-10-11 19:30:27,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 103 transitions, 523 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-10-11 19:30:27,283 INFO L231 Difference]: Finished difference. Result has 81 places, 63 transitions, 285 flow [2024-10-11 19:30:27,283 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=285, PETRI_PLACES=81, PETRI_TRANSITIONS=63} [2024-10-11 19:30:27,284 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 19 predicate places. [2024-10-11 19:30:27,284 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 63 transitions, 285 flow [2024-10-11 19:30:27,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:27,284 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:27,284 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:30:27,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 19:30:27,285 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:27,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:27,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1571977378, now seen corresponding path program 2 times [2024-10-11 19:30:27,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:30:27,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502217451] [2024-10-11 19:30:27,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:27,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:30:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:30:27,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:27,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:30:27,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502217451] [2024-10-11 19:30:27,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502217451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:27,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:27,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:30:27,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788110984] [2024-10-11 19:30:27,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:27,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:30:27,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:30:27,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:30:27,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:30:27,558 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-10-11 19:30:27,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 63 transitions, 285 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:27,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:27,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-10-11 19:30:27,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:28,413 INFO L124 PetriNetUnfolderBase]: 5059/9199 cut-off events. [2024-10-11 19:30:28,413 INFO L125 PetriNetUnfolderBase]: For 5408/5649 co-relation queries the response was YES. [2024-10-11 19:30:28,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23387 conditions, 9199 events. 5059/9199 cut-off events. For 5408/5649 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 74078 event pairs, 1372 based on Foata normal form. 47/8490 useless extension candidates. Maximal degree in co-relation 23366. Up to 2883 conditions per place. [2024-10-11 19:30:28,494 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 38 selfloop transitions, 2 changer transitions 23/99 dead transitions. [2024-10-11 19:30:28,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 99 transitions, 525 flow [2024-10-11 19:30:28,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:30:28,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:30:28,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 202 transitions. [2024-10-11 19:30:28,496 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6121212121212121 [2024-10-11 19:30:28,497 INFO L175 Difference]: Start difference. First operand has 81 places, 63 transitions, 285 flow. Second operand 6 states and 202 transitions. [2024-10-11 19:30:28,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 99 transitions, 525 flow [2024-10-11 19:30:28,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 99 transitions, 485 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-10-11 19:30:28,610 INFO L231 Difference]: Finished difference. Result has 82 places, 62 transitions, 263 flow [2024-10-11 19:30:28,610 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=263, PETRI_PLACES=82, PETRI_TRANSITIONS=62} [2024-10-11 19:30:28,611 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 20 predicate places. [2024-10-11 19:30:28,611 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 62 transitions, 263 flow [2024-10-11 19:30:28,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:28,612 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:28,612 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:30:28,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 19:30:28,612 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:28,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:28,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1647925122, now seen corresponding path program 3 times [2024-10-11 19:30:28,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:30:28,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800756354] [2024-10-11 19:30:28,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:28,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:30:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:30:30,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:30,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:30:30,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800756354] [2024-10-11 19:30:30,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800756354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:30,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:30,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 19:30:30,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503503594] [2024-10-11 19:30:30,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:30,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:30:30,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:30:30,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:30:30,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:30:30,750 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2024-10-11 19:30:30,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 62 transitions, 263 flow. Second operand has 9 states, 9 states have (on average 28.0) internal successors, (252), 9 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:30,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:30,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2024-10-11 19:30:30,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:31,789 INFO L124 PetriNetUnfolderBase]: 4772/8656 cut-off events. [2024-10-11 19:30:31,789 INFO L125 PetriNetUnfolderBase]: For 3366/3665 co-relation queries the response was YES. [2024-10-11 19:30:31,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20060 conditions, 8656 events. 4772/8656 cut-off events. For 3366/3665 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 68992 event pairs, 1795 based on Foata normal form. 56/7780 useless extension candidates. Maximal degree in co-relation 20040. Up to 3014 conditions per place. [2024-10-11 19:30:31,869 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 40 selfloop transitions, 11 changer transitions 16/106 dead transitions. [2024-10-11 19:30:31,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 106 transitions, 511 flow [2024-10-11 19:30:31,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:30:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 19:30:31,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 327 transitions. [2024-10-11 19:30:31,871 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5945454545454546 [2024-10-11 19:30:31,871 INFO L175 Difference]: Start difference. First operand has 82 places, 62 transitions, 263 flow. Second operand 10 states and 327 transitions. [2024-10-11 19:30:31,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 106 transitions, 511 flow [2024-10-11 19:30:31,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 106 transitions, 504 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-10-11 19:30:31,932 INFO L231 Difference]: Finished difference. Result has 91 places, 69 transitions, 327 flow [2024-10-11 19:30:31,933 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=327, PETRI_PLACES=91, PETRI_TRANSITIONS=69} [2024-10-11 19:30:31,934 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 29 predicate places. [2024-10-11 19:30:31,934 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 69 transitions, 327 flow [2024-10-11 19:30:31,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.0) internal successors, (252), 9 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:31,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:31,935 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:30:31,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 19:30:31,935 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:31,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:31,936 INFO L85 PathProgramCache]: Analyzing trace with hash 342966440, now seen corresponding path program 4 times [2024-10-11 19:30:31,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:30:31,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330615326] [2024-10-11 19:30:31,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:31,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:30:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:30:32,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:30:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:30:32,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 19:30:32,141 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:30:32,143 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-10-11 19:30:32,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-10-11 19:30:32,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-10-11 19:30:32,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-10-11 19:30:32,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-10-11 19:30:32,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-10-11 19:30:32,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-10-11 19:30:32,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-10-11 19:30:32,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 19:30:32,147 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:30:32,254 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 19:30:32,254 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 19:30:32,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:30:32 BasicIcfg [2024-10-11 19:30:32,259 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 19:30:32,260 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 19:30:32,260 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 19:30:32,260 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 19:30:32,260 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:30:13" (3/4) ... [2024-10-11 19:30:32,266 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 19:30:32,268 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 19:30:32,268 INFO L158 Benchmark]: Toolchain (without parser) took 20003.14ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 110.9MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 345.9MB. Max. memory is 16.1GB. [2024-10-11 19:30:32,269 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 167.8MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:30:32,269 INFO L158 Benchmark]: CACSL2BoogieTranslator took 631.11ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 84.1MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 19:30:32,269 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.12ms. Allocated memory is still 167.8MB. Free memory was 84.1MB in the beginning and 81.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:30:32,269 INFO L158 Benchmark]: Boogie Preprocessor took 93.85ms. Allocated memory is still 167.8MB. Free memory was 81.0MB in the beginning and 76.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 19:30:32,270 INFO L158 Benchmark]: RCFGBuilder took 922.02ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 76.8MB in the beginning and 162.7MB in the end (delta: -85.8MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2024-10-11 19:30:32,270 INFO L158 Benchmark]: TraceAbstraction took 18259.34ms. Allocated memory was 243.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 161.6MB in the beginning and 1.1GB in the end (delta: -971.1MB). Peak memory consumption was 319.7MB. Max. memory is 16.1GB. [2024-10-11 19:30:32,270 INFO L158 Benchmark]: Witness Printer took 8.14ms. Allocated memory is still 1.5GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:30:32,272 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.23ms. Allocated memory is still 167.8MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 631.11ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 84.1MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.12ms. Allocated memory is still 167.8MB. Free memory was 84.1MB in the beginning and 81.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.85ms. Allocated memory is still 167.8MB. Free memory was 81.0MB in the beginning and 76.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 922.02ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 76.8MB in the beginning and 162.7MB in the end (delta: -85.8MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * TraceAbstraction took 18259.34ms. Allocated memory was 243.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 161.6MB in the beginning and 1.1GB in the end (delta: -971.1MB). Peak memory consumption was 319.7MB. Max. memory is 16.1GB. * Witness Printer took 8.14ms. Allocated memory is still 1.5GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [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 __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t93; [L872] FCALL, FORK 0 pthread_create(&t93, ((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, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t93=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t94; [L874] FCALL, FORK 0 pthread_create(&t94, ((void *)0), P1, ((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, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t93=-1, t94=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t95; [L876] FCALL, FORK 0 pthread_create(&t95, ((void *)0), P2, ((void *)0)) 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, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t93=-1, t94=0, t95=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L877] 0 pthread_t t96; [L878] FCALL, FORK 0 pthread_create(&t96, ((void *)0), P3, ((void *)0)) 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, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t93=-1, t94=0, t95=1, t96=2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \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, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \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, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \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, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 a = 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, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x 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, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 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, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 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, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L786] 3 y = 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, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L789] 3 __unbuffered_p2_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=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EBX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 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, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L810] 3 __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, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 1 __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, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \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, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \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, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t93=-1, t94=0, t95=1, t96=2, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t93=-1, t94=0, t95=1, t96=2, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t93=-1, t94=0, t95=1, t96=2, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix004.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 872]: 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: 874]: 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: 878]: 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 9 procedures, 89 locations, 8 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: 18.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 695 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 655 mSDsluCounter, 118 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1891 IncrementalHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 31 mSDtfsCounter, 1891 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=10, InterpolantAutomatonStates: 80, 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.6s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 400 NumberOfCodeBlocks, 400 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 1788 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-10-11 19:30:32,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix004.opt.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 89021de777f0aa5756284679b7b3bd19ab661d8d626f08ad7f7db0bc955b507d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:30:34,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:30:34,910 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:30:34,915 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:30:34,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:30:34,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:30:34,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:30:34,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:30:34,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:30:34,950 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:30:34,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:30:34,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:30:34,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:30:34,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:30:34,951 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:30:34,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:30:34,953 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:30:34,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:30:34,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:30:34,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:30:34,954 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:30:34,956 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:30:34,956 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:30:34,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:30:34,956 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:30:34,957 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:30:34,957 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:30:34,957 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:30:34,957 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:30:34,958 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:30:34,958 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:30:34,958 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:30:34,958 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:30:34,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:30:34,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:30:34,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:30:34,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:30:34,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:30:34,960 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:30:34,960 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:30:34,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:30:34,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:30:34,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:30:34,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:30:34,962 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:30:34,962 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/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 -> 89021de777f0aa5756284679b7b3bd19ab661d8d626f08ad7f7db0bc955b507d [2024-10-11 19:30:35,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:30:35,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:30:35,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:30:35,355 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:30:35,356 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:30:35,357 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix004.opt.i [2024-10-11 19:30:36,994 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:30:37,272 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:30:37,272 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix004.opt.i [2024-10-11 19:30:37,289 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/733014a6b/d216cd6788154f92b8dc0bbeac7d6dab/FLAG361cd78dc [2024-10-11 19:30:37,308 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/733014a6b/d216cd6788154f92b8dc0bbeac7d6dab [2024-10-11 19:30:37,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:30:37,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:30:37,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:30:37,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:30:37,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:30:37,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:30:37" (1/1) ... [2024-10-11 19:30:37,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1269578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:37, skipping insertion in model container [2024-10-11 19:30:37,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:30:37" (1/1) ... [2024-10-11 19:30:37,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:30:37,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:30:37,850 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:30:37,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:30:37,995 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:30:37,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:37 WrapperNode [2024-10-11 19:30:37,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:30:37,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:30:37,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:30:37,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:30:38,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:37" (1/1) ... [2024-10-11 19:30:38,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:37" (1/1) ... [2024-10-11 19:30:38,074 INFO L138 Inliner]: procedures = 177, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 157 [2024-10-11 19:30:38,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:30:38,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:30:38,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:30:38,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:30:38,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:37" (1/1) ... [2024-10-11 19:30:38,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:37" (1/1) ... [2024-10-11 19:30:38,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:37" (1/1) ... [2024-10-11 19:30:38,123 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-10-11 19:30:38,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:37" (1/1) ... [2024-10-11 19:30:38,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:37" (1/1) ... [2024-10-11 19:30:38,138 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:37" (1/1) ... [2024-10-11 19:30:38,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:37" (1/1) ... [2024-10-11 19:30:38,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:37" (1/1) ... [2024-10-11 19:30:38,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:37" (1/1) ... [2024-10-11 19:30:38,158 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:30:38,159 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:30:38,159 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:30:38,159 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:30:38,160 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:37" (1/1) ... [2024-10-11 19:30:38,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:30:38,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:30:38,198 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:30:38,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:30:38,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 19:30:38,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:30:38,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:30:38,255 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-11 19:30:38,256 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-11 19:30:38,256 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-11 19:30:38,256 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-11 19:30:38,256 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-11 19:30:38,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-11 19:30:38,258 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-11 19:30:38,258 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-11 19:30:38,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 19:30:38,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:30:38,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:30:38,260 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 19:30:38,481 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:30:38,484 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:30:38,934 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:30:38,934 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:30:39,217 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:30:39,219 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 19:30:39,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:30:39 BoogieIcfgContainer [2024-10-11 19:30:39,219 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:30:39,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:30:39,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:30:39,226 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:30:39,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:30:37" (1/3) ... [2024-10-11 19:30:39,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224d6f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:30:39, skipping insertion in model container [2024-10-11 19:30:39,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:30:37" (2/3) ... [2024-10-11 19:30:39,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224d6f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:30:39, skipping insertion in model container [2024-10-11 19:30:39,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:30:39" (3/3) ... [2024-10-11 19:30:39,228 INFO L112 eAbstractionObserver]: Analyzing ICFG mix004.opt.i [2024-10-11 19:30:39,245 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:30:39,245 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-11 19:30:39,245 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:30:39,323 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 19:30:39,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2024-10-11 19:30:39,403 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2024-10-11 19:30:39,403 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:30:39,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 105 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-10-11 19:30:39,407 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2024-10-11 19:30:39,412 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2024-10-11 19:30:39,425 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:30:39,435 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;@d396d67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:30:39,435 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 19:30:39,447 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:30:39,447 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-10-11 19:30:39,447 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:30:39,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:39,448 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:30:39,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:39,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:39,455 INFO L85 PathProgramCache]: Analyzing trace with hash 12604335, now seen corresponding path program 1 times [2024-10-11 19:30:39,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:30:39,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452879951] [2024-10-11 19:30:39,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:39,471 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-10-11 19:30:39,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:30:39,473 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 19:30:39,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:30:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:30:39,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:30:39,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:30:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:39,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:30:39,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:30:39,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452879951] [2024-10-11 19:30:39,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452879951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:39,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:39,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:30:39,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548121698] [2024-10-11 19:30:39,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:39,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:30:39,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:30:39,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:30:39,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:30:39,747 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2024-10-11 19:30:39,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:39,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:39,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2024-10-11 19:30:39,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:40,298 INFO L124 PetriNetUnfolderBase]: 1175/2003 cut-off events. [2024-10-11 19:30:40,298 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:30:40,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3739 conditions, 2003 events. 1175/2003 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 14473 event pairs, 199 based on Foata normal form. 120/2079 useless extension candidates. Maximal degree in co-relation 3727. Up to 1361 conditions per place. [2024-10-11 19:30:40,327 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 30 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2024-10-11 19:30:40,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 196 flow [2024-10-11 19:30:40,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:30:40,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:30:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2024-10-11 19:30:40,341 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7454545454545455 [2024-10-11 19:30:40,343 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 123 transitions. [2024-10-11 19:30:40,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 196 flow [2024-10-11 19:30:40,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:30:40,353 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2024-10-11 19:30:40,357 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-10-11 19:30:40,362 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-10-11 19:30:40,362 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2024-10-11 19:30:40,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:40,362 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:40,362 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:30:40,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:30:40,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 19:30:40,568 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:40,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:40,569 INFO L85 PathProgramCache]: Analyzing trace with hash 83615929, now seen corresponding path program 1 times [2024-10-11 19:30:40,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:30:40,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096996490] [2024-10-11 19:30:40,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:40,570 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-10-11 19:30:40,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:30:40,573 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 19:30:40,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:30:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:30:40,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:30:40,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:30:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:40,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:30:40,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:30:40,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096996490] [2024-10-11 19:30:40,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096996490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:40,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:40,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:30:40,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104038129] [2024-10-11 19:30:40,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:40,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:30:40,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:30:40,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:30:40,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:30:40,781 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-11 19:30:40,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:40,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:40,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-11 19:30:40,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:42,140 INFO L124 PetriNetUnfolderBase]: 5233/8286 cut-off events. [2024-10-11 19:30:42,141 INFO L125 PetriNetUnfolderBase]: For 312/312 co-relation queries the response was YES. [2024-10-11 19:30:42,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15926 conditions, 8286 events. 5233/8286 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 59518 event pairs, 603 based on Foata normal form. 216/8490 useless extension candidates. Maximal degree in co-relation 15916. Up to 4837 conditions per place. [2024-10-11 19:30:42,224 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 48 selfloop transitions, 6 changer transitions 1/74 dead transitions. [2024-10-11 19:30:42,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 280 flow [2024-10-11 19:30:42,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:30:42,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:30:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2024-10-11 19:30:42,229 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6772727272727272 [2024-10-11 19:30:42,230 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 4 states and 149 transitions. [2024-10-11 19:30:42,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 280 flow [2024-10-11 19:30:42,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:30:42,235 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 142 flow [2024-10-11 19:30:42,237 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-10-11 19:30:42,239 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -2 predicate places. [2024-10-11 19:30:42,239 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 142 flow [2024-10-11 19:30:42,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:42,240 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:42,240 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:30:42,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:30:42,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 19:30:42,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:42,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:42,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1948354252, now seen corresponding path program 1 times [2024-10-11 19:30:42,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:30:42,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568783245] [2024-10-11 19:30:42,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:42,443 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-10-11 19:30:42,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:30:42,446 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 19:30:42,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:30:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:30:42,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:30:42,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:30:42,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:42,635 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:30:42,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:30:42,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568783245] [2024-10-11 19:30:42,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568783245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:42,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:42,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:30:42,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244336562] [2024-10-11 19:30:42,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:42,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:30:42,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:30:42,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:30:42,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:30:42,646 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-11 19:30:42,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:42,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:42,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-11 19:30:42,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:43,613 INFO L124 PetriNetUnfolderBase]: 4321/6880 cut-off events. [2024-10-11 19:30:43,614 INFO L125 PetriNetUnfolderBase]: For 1724/1724 co-relation queries the response was YES. [2024-10-11 19:30:43,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15358 conditions, 6880 events. 4321/6880 cut-off events. For 1724/1724 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 47824 event pairs, 213 based on Foata normal form. 208/7076 useless extension candidates. Maximal degree in co-relation 15346. Up to 3649 conditions per place. [2024-10-11 19:30:43,678 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 61 selfloop transitions, 10 changer transitions 1/91 dead transitions. [2024-10-11 19:30:43,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 91 transitions, 397 flow [2024-10-11 19:30:43,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:30:43,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:30:43,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 189 transitions. [2024-10-11 19:30:43,681 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6872727272727273 [2024-10-11 19:30:43,681 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 142 flow. Second operand 5 states and 189 transitions. [2024-10-11 19:30:43,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 91 transitions, 397 flow [2024-10-11 19:30:43,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 91 transitions, 386 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-11 19:30:43,685 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 194 flow [2024-10-11 19:30:43,686 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-10-11 19:30:43,686 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2024-10-11 19:30:43,687 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 194 flow [2024-10-11 19:30:43,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:43,687 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:43,688 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:30:43,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:30:43,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-10-11 19:30:43,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:43,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:43,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1965292897, now seen corresponding path program 1 times [2024-10-11 19:30:43,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:30:43,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959661546] [2024-10-11 19:30:43,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:43,894 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-10-11 19:30:43,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:30:43,896 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-10-11 19:30:43,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:30:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:30:43,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:30:43,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:30:44,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:44,057 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:30:44,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:30:44,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959661546] [2024-10-11 19:30:44,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959661546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:44,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:44,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:30:44,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418007518] [2024-10-11 19:30:44,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:44,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:30:44,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:30:44,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:30:44,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:30:44,085 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-11 19:30:44,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:44,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:44,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-11 19:30:44,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:44,703 INFO L124 PetriNetUnfolderBase]: 2739/4330 cut-off events. [2024-10-11 19:30:44,703 INFO L125 PetriNetUnfolderBase]: For 3214/3214 co-relation queries the response was YES. [2024-10-11 19:30:44,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10920 conditions, 4330 events. 2739/4330 cut-off events. For 3214/3214 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 25833 event pairs, 81 based on Foata normal form. 164/4482 useless extension candidates. Maximal degree in co-relation 10906. Up to 1633 conditions per place. [2024-10-11 19:30:44,743 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 72 selfloop transitions, 14 changer transitions 1/106 dead transitions. [2024-10-11 19:30:44,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 106 transitions, 520 flow [2024-10-11 19:30:44,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:30:44,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:30:44,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 227 transitions. [2024-10-11 19:30:44,746 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6878787878787879 [2024-10-11 19:30:44,748 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 194 flow. Second operand 6 states and 227 transitions. [2024-10-11 19:30:44,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 106 transitions, 520 flow [2024-10-11 19:30:44,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 106 transitions, 490 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-11 19:30:44,762 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 244 flow [2024-10-11 19:30:44,763 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=244, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2024-10-11 19:30:44,764 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2024-10-11 19:30:44,764 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 244 flow [2024-10-11 19:30:44,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:44,765 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:44,765 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, 1] [2024-10-11 19:30:44,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 19:30:44,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-10-11 19:30:44,969 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:44,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:44,969 INFO L85 PathProgramCache]: Analyzing trace with hash 479380354, now seen corresponding path program 1 times [2024-10-11 19:30:44,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:30:44,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406175942] [2024-10-11 19:30:44,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:44,970 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-10-11 19:30:44,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:30:44,974 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-10-11 19:30:44,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:30:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:30:45,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:30:45,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:30:45,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:45,138 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:30:45,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:30:45,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406175942] [2024-10-11 19:30:45,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406175942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:45,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:45,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:30:45,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175738126] [2024-10-11 19:30:45,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:45,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 19:30:45,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:30:45,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 19:30:45,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 19:30:45,149 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-11 19:30:45,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 244 flow. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:45,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:45,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-11 19:30:45,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:45,690 INFO L124 PetriNetUnfolderBase]: 1591/2394 cut-off events. [2024-10-11 19:30:45,690 INFO L125 PetriNetUnfolderBase]: For 3368/3368 co-relation queries the response was YES. [2024-10-11 19:30:45,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6977 conditions, 2394 events. 1591/2394 cut-off events. For 3368/3368 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 11812 event pairs, 47 based on Foata normal form. 80/2462 useless extension candidates. Maximal degree in co-relation 6962. Up to 768 conditions per place. [2024-10-11 19:30:45,708 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 65 selfloop transitions, 18 changer transitions 1/103 dead transitions. [2024-10-11 19:30:45,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 103 transitions, 518 flow [2024-10-11 19:30:45,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 19:30:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 19:30:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 247 transitions. [2024-10-11 19:30:45,710 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6415584415584416 [2024-10-11 19:30:45,710 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 244 flow. Second operand 7 states and 247 transitions. [2024-10-11 19:30:45,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 103 transitions, 518 flow [2024-10-11 19:30:45,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 103 transitions, 472 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-10-11 19:30:45,726 INFO L231 Difference]: Finished difference. Result has 70 places, 58 transitions, 254 flow [2024-10-11 19:30:45,726 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=254, PETRI_PLACES=70, PETRI_TRANSITIONS=58} [2024-10-11 19:30:45,727 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2024-10-11 19:30:45,727 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 58 transitions, 254 flow [2024-10-11 19:30:45,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:45,727 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:45,727 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:30:45,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:30:45,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-10-11 19:30:45,928 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:45,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:45,929 INFO L85 PathProgramCache]: Analyzing trace with hash 664629504, now seen corresponding path program 1 times [2024-10-11 19:30:45,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:30:45,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528385566] [2024-10-11 19:30:45,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:45,930 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-10-11 19:30:45,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:30:45,934 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-10-11 19:30:45,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:30:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:30:46,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:30:46,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:30:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:46,108 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:30:46,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:30:46,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528385566] [2024-10-11 19:30:46,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [528385566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:46,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:46,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:30:46,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999983967] [2024-10-11 19:30:46,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:46,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:30:46,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:30:46,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:30:46,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:30:46,112 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2024-10-11 19:30:46,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:46,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:46,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2024-10-11 19:30:46,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:46,270 INFO L124 PetriNetUnfolderBase]: 704/1307 cut-off events. [2024-10-11 19:30:46,271 INFO L125 PetriNetUnfolderBase]: For 720/767 co-relation queries the response was YES. [2024-10-11 19:30:46,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3009 conditions, 1307 events. 704/1307 cut-off events. For 720/767 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7710 event pairs, 631 based on Foata normal form. 16/1188 useless extension candidates. Maximal degree in co-relation 2993. Up to 988 conditions per place. [2024-10-11 19:30:46,284 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 20 selfloop transitions, 1 changer transitions 1/57 dead transitions. [2024-10-11 19:30:46,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 57 transitions, 296 flow [2024-10-11 19:30:46,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:30:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:30:46,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-10-11 19:30:46,285 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2024-10-11 19:30:46,286 INFO L175 Difference]: Start difference. First operand has 70 places, 58 transitions, 254 flow. Second operand 3 states and 104 transitions. [2024-10-11 19:30:46,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 57 transitions, 296 flow [2024-10-11 19:30:46,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 57 transitions, 200 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-10-11 19:30:46,290 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 156 flow [2024-10-11 19:30:46,291 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2024-10-11 19:30:46,291 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2024-10-11 19:30:46,292 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 156 flow [2024-10-11 19:30:46,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:46,292 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:46,292 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:30:46,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:30:46,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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-10-11 19:30:46,493 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:46,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:46,494 INFO L85 PathProgramCache]: Analyzing trace with hash 120904530, now seen corresponding path program 1 times [2024-10-11 19:30:46,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:30:46,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107053167] [2024-10-11 19:30:46,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:30:46,495 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-10-11 19:30:46,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:30:46,497 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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-10-11 19:30:46,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:30:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:30:46,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:30:46,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:30:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:46,694 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:30:46,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:30:46,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107053167] [2024-10-11 19:30:46,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107053167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:46,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:46,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:30:46,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360954034] [2024-10-11 19:30:46,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:46,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:30:46,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:30:46,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:30:46,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:30:46,710 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-10-11 19:30:46,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:46,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:46,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-10-11 19:30:46,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:47,276 INFO L124 PetriNetUnfolderBase]: 1976/3541 cut-off events. [2024-10-11 19:30:47,276 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:30:47,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6819 conditions, 3541 events. 1976/3541 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 23819 event pairs, 349 based on Foata normal form. 16/3363 useless extension candidates. Maximal degree in co-relation 6812. Up to 1278 conditions per place. [2024-10-11 19:30:47,309 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 43 selfloop transitions, 2 changer transitions 12/89 dead transitions. [2024-10-11 19:30:47,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 89 transitions, 340 flow [2024-10-11 19:30:47,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:30:47,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:30:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 208 transitions. [2024-10-11 19:30:47,311 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2024-10-11 19:30:47,311 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 156 flow. Second operand 6 states and 208 transitions. [2024-10-11 19:30:47,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 89 transitions, 340 flow [2024-10-11 19:30:47,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 89 transitions, 339 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:30:47,313 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 172 flow [2024-10-11 19:30:47,314 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2024-10-11 19:30:47,314 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2024-10-11 19:30:47,314 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 172 flow [2024-10-11 19:30:47,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:47,315 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:47,315 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:30:47,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:30:47,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/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-10-11 19:30:47,520 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:47,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:47,520 INFO L85 PathProgramCache]: Analyzing trace with hash -705044854, now seen corresponding path program 2 times [2024-10-11 19:30:47,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:30:47,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876995117] [2024-10-11 19:30:47,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:30:47,522 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-10-11 19:30:47,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:30:47,525 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-10-11 19:30:47,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:30:47,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 19:30:47,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:30:47,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:30:47,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:30:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:47,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:30:47,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:30:47,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876995117] [2024-10-11 19:30:47,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876995117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:47,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:47,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:30:47,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492267789] [2024-10-11 19:30:47,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:47,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:30:47,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:30:47,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:30:47,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:30:47,748 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-10-11 19:30:47,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:47,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:47,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-10-11 19:30:47,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:48,536 INFO L124 PetriNetUnfolderBase]: 3751/6685 cut-off events. [2024-10-11 19:30:48,536 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-10-11 19:30:48,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13116 conditions, 6685 events. 3751/6685 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 49932 event pairs, 1051 based on Foata normal form. 16/6213 useless extension candidates. Maximal degree in co-relation 13105. Up to 2320 conditions per place. [2024-10-11 19:30:48,575 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 35 selfloop transitions, 1 changer transitions 26/95 dead transitions. [2024-10-11 19:30:48,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 95 transitions, 384 flow [2024-10-11 19:30:48,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:30:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:30:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2024-10-11 19:30:48,577 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6454545454545455 [2024-10-11 19:30:48,577 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 172 flow. Second operand 6 states and 213 transitions. [2024-10-11 19:30:48,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 95 transitions, 384 flow [2024-10-11 19:30:48,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 95 transitions, 377 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-10-11 19:30:48,582 INFO L231 Difference]: Finished difference. Result has 72 places, 57 transitions, 178 flow [2024-10-11 19:30:48,582 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=72, PETRI_TRANSITIONS=57} [2024-10-11 19:30:48,584 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 10 predicate places. [2024-10-11 19:30:48,585 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 57 transitions, 178 flow [2024-10-11 19:30:48,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:48,585 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:48,586 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:30:48,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:30:48,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/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-10-11 19:30:48,787 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:48,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:48,788 INFO L85 PathProgramCache]: Analyzing trace with hash 92782734, now seen corresponding path program 3 times [2024-10-11 19:30:48,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:30:48,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495439707] [2024-10-11 19:30:48,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:30:48,789 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-10-11 19:30:48,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:30:48,793 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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-10-11 19:30:48,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:30:48,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-11 19:30:48,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:30:48,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:30:48,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:30:49,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:49,010 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:30:49,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:30:49,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495439707] [2024-10-11 19:30:49,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495439707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:49,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:49,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:30:49,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778614190] [2024-10-11 19:30:49,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:49,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:30:49,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:30:49,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:30:49,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:30:49,024 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-10-11 19:30:49,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 57 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:49,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:49,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-10-11 19:30:49,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:49,675 INFO L124 PetriNetUnfolderBase]: 3289/5791 cut-off events. [2024-10-11 19:30:49,675 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2024-10-11 19:30:49,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11594 conditions, 5791 events. 3289/5791 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 42899 event pairs, 941 based on Foata normal form. 16/5252 useless extension candidates. Maximal degree in co-relation 11581. Up to 2540 conditions per place. [2024-10-11 19:30:49,712 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 27 selfloop transitions, 1 changer transitions 30/91 dead transitions. [2024-10-11 19:30:49,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 91 transitions, 374 flow [2024-10-11 19:30:49,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:30:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:30:49,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2024-10-11 19:30:49,717 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2024-10-11 19:30:49,717 INFO L175 Difference]: Start difference. First operand has 72 places, 57 transitions, 178 flow. Second operand 6 states and 209 transitions. [2024-10-11 19:30:49,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 91 transitions, 374 flow [2024-10-11 19:30:49,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 363 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-11 19:30:49,722 INFO L231 Difference]: Finished difference. Result has 74 places, 57 transitions, 182 flow [2024-10-11 19:30:49,722 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=182, PETRI_PLACES=74, PETRI_TRANSITIONS=57} [2024-10-11 19:30:49,723 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 12 predicate places. [2024-10-11 19:30:49,723 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 57 transitions, 182 flow [2024-10-11 19:30:49,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:49,724 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:49,724 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:30:49,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 19:30:49,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/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-10-11 19:30:49,925 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:49,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:49,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1839530850, now seen corresponding path program 4 times [2024-10-11 19:30:49,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:30:49,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581334665] [2024-10-11 19:30:49,926 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 19:30:49,926 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-10-11 19:30:49,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:30:49,927 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/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-10-11 19:30:49,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 19:30:50,017 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 19:30:50,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:30:50,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 19:30:50,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:30:50,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:30:50,611 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:30:50,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:30:50,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581334665] [2024-10-11 19:30:50,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581334665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:30:50,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:30:50,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 19:30:50,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424220142] [2024-10-11 19:30:50,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:30:50,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 19:30:50,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:30:50,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 19:30:50,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 19:30:50,629 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2024-10-11 19:30:50,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 57 transitions, 182 flow. Second operand has 8 states, 8 states have (on average 29.25) internal successors, (234), 8 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:50,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:30:50,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2024-10-11 19:30:50,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:30:51,270 INFO L124 PetriNetUnfolderBase]: 2374/4377 cut-off events. [2024-10-11 19:30:51,271 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-10-11 19:30:51,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8691 conditions, 4377 events. 2374/4377 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 31819 event pairs, 419 based on Foata normal form. 16/3974 useless extension candidates. Maximal degree in co-relation 8677. Up to 1014 conditions per place. [2024-10-11 19:30:51,308 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 38 selfloop transitions, 5 changer transitions 12/90 dead transitions. [2024-10-11 19:30:51,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 90 transitions, 364 flow [2024-10-11 19:30:51,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 19:30:51,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 19:30:51,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 272 transitions. [2024-10-11 19:30:51,310 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2024-10-11 19:30:51,310 INFO L175 Difference]: Start difference. First operand has 74 places, 57 transitions, 182 flow. Second operand 8 states and 272 transitions. [2024-10-11 19:30:51,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 90 transitions, 364 flow [2024-10-11 19:30:51,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 90 transitions, 353 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-11 19:30:51,314 INFO L231 Difference]: Finished difference. Result has 79 places, 60 transitions, 209 flow [2024-10-11 19:30:51,314 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=209, PETRI_PLACES=79, PETRI_TRANSITIONS=60} [2024-10-11 19:30:51,315 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 17 predicate places. [2024-10-11 19:30:51,315 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 60 transitions, 209 flow [2024-10-11 19:30:51,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.25) internal successors, (234), 8 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:30:51,316 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:30:51,316 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:30:51,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-11 19:30:51,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/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-10-11 19:30:51,517 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:30:51,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:30:51,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1450624380, now seen corresponding path program 5 times [2024-10-11 19:30:51,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:30:51,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081939293] [2024-10-11 19:30:51,518 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:30:51,518 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-10-11 19:30:51,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:30:51,521 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/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-10-11 19:30:51,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (12)] Waiting until timeout for monitored process [2024-10-11 19:30:51,628 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 19:30:51,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-11 19:30:51,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:30:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:30:51,803 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-11 19:30:51,803 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:30:51,806 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-10-11 19:30:51,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-10-11 19:30:51,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-10-11 19:30:51,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-10-11 19:30:51,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-10-11 19:30:51,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-10-11 19:30:51,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-10-11 19:30:51,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-10-11 19:30:51,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (12)] Forceful destruction successful, exit code 0 [2024-10-11 19:30:52,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/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-10-11 19:30:52,012 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2024-10-11 19:30:52,137 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 19:30:52,137 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 19:30:52,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:30:52 BasicIcfg [2024-10-11 19:30:52,146 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 19:30:52,147 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 19:30:52,147 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 19:30:52,147 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 19:30:52,147 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:30:39" (3/4) ... [2024-10-11 19:30:52,149 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 19:30:52,150 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 19:30:52,151 INFO L158 Benchmark]: Toolchain (without parser) took 14838.41ms. Allocated memory was 67.1MB in the beginning and 868.2MB in the end (delta: 801.1MB). Free memory was 33.3MB in the beginning and 337.9MB in the end (delta: -304.5MB). Peak memory consumption was 495.9MB. Max. memory is 16.1GB. [2024-10-11 19:30:52,151 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 48.2MB. Free memory is still 26.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:30:52,151 INFO L158 Benchmark]: CACSL2BoogieTranslator took 681.82ms. Allocated memory is still 67.1MB. Free memory was 33.2MB in the beginning and 39.9MB in the end (delta: -6.8MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-10-11 19:30:52,152 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.42ms. Allocated memory is still 67.1MB. Free memory was 39.9MB in the beginning and 37.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:30:52,152 INFO L158 Benchmark]: Boogie Preprocessor took 82.85ms. Allocated memory is still 67.1MB. Free memory was 37.0MB in the beginning and 33.1MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 19:30:52,153 INFO L158 Benchmark]: RCFGBuilder took 1060.28ms. Allocated memory was 67.1MB in the beginning and 86.0MB in the end (delta: 18.9MB). Free memory was 33.1MB in the beginning and 42.0MB in the end (delta: -8.9MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2024-10-11 19:30:52,153 INFO L158 Benchmark]: TraceAbstraction took 12924.07ms. Allocated memory was 86.0MB in the beginning and 868.2MB in the end (delta: 782.2MB). Free memory was 41.4MB in the beginning and 338.9MB in the end (delta: -297.6MB). Peak memory consumption was 483.7MB. Max. memory is 16.1GB. [2024-10-11 19:30:52,153 INFO L158 Benchmark]: Witness Printer took 3.61ms. Allocated memory is still 868.2MB. Free memory was 338.9MB in the beginning and 337.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:30:52,155 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.14ms. Allocated memory is still 48.2MB. Free memory is still 26.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 681.82ms. Allocated memory is still 67.1MB. Free memory was 33.2MB in the beginning and 39.9MB in the end (delta: -6.8MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.42ms. Allocated memory is still 67.1MB. Free memory was 39.9MB in the beginning and 37.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.85ms. Allocated memory is still 67.1MB. Free memory was 37.0MB in the beginning and 33.1MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1060.28ms. Allocated memory was 67.1MB in the beginning and 86.0MB in the end (delta: 18.9MB). Free memory was 33.1MB in the beginning and 42.0MB in the end (delta: -8.9MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12924.07ms. Allocated memory was 86.0MB in the beginning and 868.2MB in the end (delta: 782.2MB). Free memory was 41.4MB in the beginning and 338.9MB in the end (delta: -297.6MB). Peak memory consumption was 483.7MB. Max. memory is 16.1GB. * Witness Printer took 3.61ms. Allocated memory is still 868.2MB. Free memory was 338.9MB in the beginning and 337.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [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 __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t93; [L872] FCALL, FORK 0 pthread_create(&t93, ((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, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t93=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t94; [L874] FCALL, FORK 0 pthread_create(&t94, ((void *)0), P1, ((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, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t93=-1, t94=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t95; [L876] FCALL, FORK 0 pthread_create(&t95, ((void *)0), P2, ((void *)0)) 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, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t93=-1, t94=0, t95=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L877] 0 pthread_t t96; [L878] FCALL, FORK 0 pthread_create(&t96, ((void *)0), P3, ((void *)0)) 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, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t93=-1, t94=0, t95=1, t96=2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \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, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \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, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \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, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 a = 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, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x 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, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 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, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 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, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L786] 3 y = 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, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L789] 3 __unbuffered_p2_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=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EBX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 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, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \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, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L764] 1 __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, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L779] 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, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \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, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t93=-1, t94=0, t95=1, t96=2, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t93=-1, t94=0, t95=1, t96=2, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t93=-1, t94=0, t95=1, t96=2, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix004.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 878]: 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: 876]: 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: 872]: 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: 874]: 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 9 procedures, 89 locations, 8 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: 12.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 503 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 481 mSDsluCounter, 88 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1709 IncrementalHoareTripleChecker+Invalid, 1741 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 6 mSDtfsCounter, 1709 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 317 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=5, 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.3s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 343 NumberOfCodeBlocks, 342 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 892 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1278 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-10-11 19:30:52,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample