./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/mix036_power.opt_rmo.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/mix036_power.opt_rmo.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 f5d83fc7ee9b26859e9993ee2fcff801f4a9d92dea17a48a6a39594bb6b759ca --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:33:53,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:33:53,658 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:33:53,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:33:53,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:33:53,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:33:53,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:33:53,690 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:33:53,691 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:33:53,692 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:33:53,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:33:53,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:33:53,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:33:53,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:33:53,695 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:33:53,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:33:53,696 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:33:53,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:33:53,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:33:53,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:33:53,697 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:33:53,702 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:33:53,702 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:33:53,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:33:53,703 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:33:53,703 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:33:53,703 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:33:53,703 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:33:53,704 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:33:53,704 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:33:53,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:33:53,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:33:53,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:33:53,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:33:53,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:33:53,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:33:53,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:33:53,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:33:53,706 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:33:53,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:33:53,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:33:53,707 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:33:53,708 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 -> f5d83fc7ee9b26859e9993ee2fcff801f4a9d92dea17a48a6a39594bb6b759ca [2024-10-11 19:33:53,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:33:53,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:33:53,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:33:53,987 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:33:53,987 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:33:53,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix036_power.opt_rmo.opt.i [2024-10-11 19:33:55,261 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:33:55,491 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:33:55,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix036_power.opt_rmo.opt.i [2024-10-11 19:33:55,505 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/55ebc919a/0149d532b2954757a51b8b27f8fc2bce/FLAG96a3c79d6 [2024-10-11 19:33:55,832 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/55ebc919a/0149d532b2954757a51b8b27f8fc2bce [2024-10-11 19:33:55,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:33:55,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:33:55,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:33:55,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:33:55,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:33:55,844 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:33:55" (1/1) ... [2024-10-11 19:33:55,845 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fb0c37d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:55, skipping insertion in model container [2024-10-11 19:33:55,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:33:55" (1/1) ... [2024-10-11 19:33:55,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:33:56,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:33:56,242 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:33:56,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:33:56,370 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:33:56,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:56 WrapperNode [2024-10-11 19:33:56,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:33:56,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:33:56,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:33:56,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:33:56,377 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:33:56" (1/1) ... [2024-10-11 19:33:56,394 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:33:56" (1/1) ... [2024-10-11 19:33:56,426 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2024-10-11 19:33:56,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:33:56,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:33:56,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:33:56,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:33:56,440 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:56" (1/1) ... [2024-10-11 19:33:56,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:56" (1/1) ... [2024-10-11 19:33:56,449 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:56" (1/1) ... [2024-10-11 19:33:56,470 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:33:56,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:56" (1/1) ... [2024-10-11 19:33:56,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:56" (1/1) ... [2024-10-11 19:33:56,478 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:56" (1/1) ... [2024-10-11 19:33:56,483 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:56" (1/1) ... [2024-10-11 19:33:56,484 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:56" (1/1) ... [2024-10-11 19:33:56,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:56" (1/1) ... [2024-10-11 19:33:56,490 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:33:56,491 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:33:56,491 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:33:56,491 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:33:56,492 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:56" (1/1) ... [2024-10-11 19:33:56,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:33:56,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:33:56,519 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:33:56,521 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:33:56,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 19:33:56,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:33:56,558 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-11 19:33:56,558 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-11 19:33:56,558 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-11 19:33:56,558 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-11 19:33:56,558 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-11 19:33:56,558 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-11 19:33:56,558 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-11 19:33:56,558 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-11 19:33:56,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 19:33:56,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 19:33:56,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:33:56,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:33:56,560 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:33:56,667 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:33:56,669 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:33:56,963 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:33:56,963 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:33:57,108 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:33:57,109 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 19:33:57,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:33:57 BoogieIcfgContainer [2024-10-11 19:33:57,109 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:33:57,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:33:57,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:33:57,113 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:33:57,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:33:55" (1/3) ... [2024-10-11 19:33:57,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708080b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:33:57, skipping insertion in model container [2024-10-11 19:33:57,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:56" (2/3) ... [2024-10-11 19:33:57,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708080b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:33:57, skipping insertion in model container [2024-10-11 19:33:57,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:33:57" (3/3) ... [2024-10-11 19:33:57,116 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_power.opt_rmo.opt.i [2024-10-11 19:33:57,129 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:33:57,129 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-11 19:33:57,129 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:33:57,169 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 19:33:57,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2024-10-11 19:33:57,215 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2024-10-11 19:33:57,215 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:33:57,221 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 107 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:33:57,222 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2024-10-11 19:33:57,224 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2024-10-11 19:33:57,231 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:33:57,237 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;@14053f3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:33:57,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 19:33:57,246 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:33:57,247 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2024-10-11 19:33:57,247 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:33:57,247 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:33:57,248 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:33:57,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:33:57,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:33:57,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1325916273, now seen corresponding path program 1 times [2024-10-11 19:33:57,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:33:57,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563079303] [2024-10-11 19:33:57,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:33:57,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:33:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:33:57,642 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:33:57,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:33:57,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563079303] [2024-10-11 19:33:57,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563079303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:33:57,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:33:57,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:33:57,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630395009] [2024-10-11 19:33:57,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:33:57,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:33:57,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:33:57,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:33:57,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:33:57,738 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2024-10-11 19:33:57,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:33:57,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:33:57,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2024-10-11 19:33:57,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:33:58,285 INFO L124 PetriNetUnfolderBase]: 1525/2593 cut-off events. [2024-10-11 19:33:58,286 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-10-11 19:33:58,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4831 conditions, 2593 events. 1525/2593 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 17980 event pairs, 469 based on Foata normal form. 144/2677 useless extension candidates. Maximal degree in co-relation 4819. Up to 1717 conditions per place. [2024-10-11 19:33:58,311 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 33 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2024-10-11 19:33:58,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 61 transitions, 211 flow [2024-10-11 19:33:58,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:33:58,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:33:58,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2024-10-11 19:33:58,323 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7636363636363637 [2024-10-11 19:33:58,325 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 126 transitions. [2024-10-11 19:33:58,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 61 transitions, 211 flow [2024-10-11 19:33:58,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 61 transitions, 206 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:33:58,332 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2024-10-11 19:33:58,335 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:33:58,338 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-10-11 19:33:58,339 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2024-10-11 19:33:58,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:33:58,340 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:33:58,340 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:33:58,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 19:33:58,341 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:33:58,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:33:58,342 INFO L85 PathProgramCache]: Analyzing trace with hash -895707525, now seen corresponding path program 1 times [2024-10-11 19:33:58,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:33:58,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233506023] [2024-10-11 19:33:58,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:33:58,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:33:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:33:58,412 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:33:58,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:33:58,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233506023] [2024-10-11 19:33:58,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233506023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:33:58,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:33:58,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:33:58,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18597737] [2024-10-11 19:33:58,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:33:58,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:33:58,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:33:58,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:33:58,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:33:58,417 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2024-10-11 19:33:58,418 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:33:58,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:33:58,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2024-10-11 19:33:58,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:33:58,730 INFO L124 PetriNetUnfolderBase]: 1339/2443 cut-off events. [2024-10-11 19:33:58,730 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-10-11 19:33:58,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4559 conditions, 2443 events. 1339/2443 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 18407 event pairs, 1339 based on Foata normal form. 72/2395 useless extension candidates. Maximal degree in co-relation 4549. Up to 1908 conditions per place. [2024-10-11 19:33:58,742 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 20 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2024-10-11 19:33:58,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 146 flow [2024-10-11 19:33:58,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:33:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:33:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-10-11 19:33:58,746 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2024-10-11 19:33:58,746 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:33:58,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 146 flow [2024-10-11 19:33:58,747 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:33:58,749 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2024-10-11 19:33:58,750 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:33:58,751 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2024-10-11 19:33:58,751 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2024-10-11 19:33:58,751 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:33:58,751 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:33:58,751 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:33:58,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 19:33:58,752 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:33:58,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:33:58,753 INFO L85 PathProgramCache]: Analyzing trace with hash -895706242, now seen corresponding path program 1 times [2024-10-11 19:33:58,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:33:58,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008667617] [2024-10-11 19:33:58,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:33:58,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:33:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:33:58,992 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:33:58,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:33:58,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008667617] [2024-10-11 19:33:58,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008667617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:33:58,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:33:58,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:33:58,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086831199] [2024-10-11 19:33:58,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:33:58,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:33:58,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:33:58,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:33:58,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:33:59,005 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-10-11 19:33:59,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:33:59,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:33:59,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-10-11 19:33:59,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:34:00,245 INFO L124 PetriNetUnfolderBase]: 7001/10710 cut-off events. [2024-10-11 19:34:00,245 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:34:00,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20413 conditions, 10710 events. 7001/10710 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 75366 event pairs, 3666 based on Foata normal form. 0/10397 useless extension candidates. Maximal degree in co-relation 20407. Up to 6255 conditions per place. [2024-10-11 19:34:00,296 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 35 selfloop transitions, 5 changer transitions 52/109 dead transitions. [2024-10-11 19:34:00,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 109 transitions, 418 flow [2024-10-11 19:34:00,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 19:34:00,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 19:34:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 270 transitions. [2024-10-11 19:34:00,299 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-10-11 19:34:00,299 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 8 states and 270 transitions. [2024-10-11 19:34:00,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 109 transitions, 418 flow [2024-10-11 19:34:00,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 109 transitions, 417 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:34:00,304 INFO L231 Difference]: Finished difference. Result has 66 places, 47 transitions, 152 flow [2024-10-11 19:34:00,305 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=152, PETRI_PLACES=66, PETRI_TRANSITIONS=47} [2024-10-11 19:34:00,306 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2024-10-11 19:34:00,306 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 47 transitions, 152 flow [2024-10-11 19:34:00,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:34:00,306 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:34:00,306 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:34:00,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 19:34:00,307 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:34:00,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:34:00,308 INFO L85 PathProgramCache]: Analyzing trace with hash -302161564, now seen corresponding path program 1 times [2024-10-11 19:34:00,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:34:00,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191783517] [2024-10-11 19:34:00,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:34:00,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:34:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:34:00,459 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:34:00,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:34:00,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191783517] [2024-10-11 19:34:00,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191783517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:34:00,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:34:00,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:34:00,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791396856] [2024-10-11 19:34:00,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:34:00,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:34:00,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:34:00,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:34:00,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:34:00,480 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-10-11 19:34:00,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 47 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 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:34:00,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:34:00,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-10-11 19:34:00,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:34:01,563 INFO L124 PetriNetUnfolderBase]: 5265/7976 cut-off events. [2024-10-11 19:34:01,564 INFO L125 PetriNetUnfolderBase]: For 9074/9417 co-relation queries the response was YES. [2024-10-11 19:34:01,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22519 conditions, 7976 events. 5265/7976 cut-off events. For 9074/9417 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 53151 event pairs, 865 based on Foata normal form. 215/8106 useless extension candidates. Maximal degree in co-relation 22507. Up to 4894 conditions per place. [2024-10-11 19:34:01,622 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 38 selfloop transitions, 3 changer transitions 43/101 dead transitions. [2024-10-11 19:34:01,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 101 transitions, 540 flow [2024-10-11 19:34:01,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 19:34:01,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 19:34:01,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 236 transitions. [2024-10-11 19:34:01,625 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.612987012987013 [2024-10-11 19:34:01,625 INFO L175 Difference]: Start difference. First operand has 66 places, 47 transitions, 152 flow. Second operand 7 states and 236 transitions. [2024-10-11 19:34:01,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 101 transitions, 540 flow [2024-10-11 19:34:01,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 101 transitions, 527 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-10-11 19:34:01,672 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 162 flow [2024-10-11 19:34:01,673 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=162, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2024-10-11 19:34:01,673 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2024-10-11 19:34:01,674 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 162 flow [2024-10-11 19:34:01,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 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:34:01,674 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:34:01,674 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:34:01,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 19:34:01,674 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:34:01,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:34:01,677 INFO L85 PathProgramCache]: Analyzing trace with hash 159886168, now seen corresponding path program 1 times [2024-10-11 19:34:01,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:34:01,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237149832] [2024-10-11 19:34:01,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:34:01,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:34:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:34:01,832 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:34:01,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:34:01,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237149832] [2024-10-11 19:34:01,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237149832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:34:01,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:34:01,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:34:01,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856630681] [2024-10-11 19:34:01,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:34:01,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:34:01,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:34:01,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:34:01,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:34:01,846 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-11 19:34:01,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 47 transitions, 162 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:34:01,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:34:01,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-11 19:34:01,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:34:03,110 INFO L124 PetriNetUnfolderBase]: 9103/13729 cut-off events. [2024-10-11 19:34:03,111 INFO L125 PetriNetUnfolderBase]: For 10211/10693 co-relation queries the response was YES. [2024-10-11 19:34:03,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33182 conditions, 13729 events. 9103/13729 cut-off events. For 10211/10693 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 94329 event pairs, 1406 based on Foata normal form. 450/13837 useless extension candidates. Maximal degree in co-relation 33166. Up to 7271 conditions per place. [2024-10-11 19:34:03,204 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 49 selfloop transitions, 6 changer transitions 0/75 dead transitions. [2024-10-11 19:34:03,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 75 transitions, 346 flow [2024-10-11 19:34:03,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:34:03,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:34:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2024-10-11 19:34:03,205 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6727272727272727 [2024-10-11 19:34:03,206 INFO L175 Difference]: Start difference. First operand has 68 places, 47 transitions, 162 flow. Second operand 4 states and 148 transitions. [2024-10-11 19:34:03,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 75 transitions, 346 flow [2024-10-11 19:34:03,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 75 transitions, 332 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-10-11 19:34:03,253 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 194 flow [2024-10-11 19:34:03,253 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2024-10-11 19:34:03,254 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2024-10-11 19:34:03,254 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 194 flow [2024-10-11 19:34:03,254 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:34:03,254 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:34:03,254 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:34:03,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 19:34:03,255 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:34:03,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:34:03,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2075970803, now seen corresponding path program 1 times [2024-10-11 19:34:03,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:34:03,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550217917] [2024-10-11 19:34:03,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:34:03,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:34:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:34:03,501 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:34:03,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:34:03,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550217917] [2024-10-11 19:34:03,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550217917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:34:03,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:34:03,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:34:03,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375408035] [2024-10-11 19:34:03,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:34:03,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:34:03,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:34:03,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:34:03,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:34:03,517 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-11 19:34:03,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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:34:03,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:34:03,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-11 19:34:03,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:34:04,809 INFO L124 PetriNetUnfolderBase]: 7753/11823 cut-off events. [2024-10-11 19:34:04,810 INFO L125 PetriNetUnfolderBase]: For 8552/8884 co-relation queries the response was YES. [2024-10-11 19:34:04,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30999 conditions, 11823 events. 7753/11823 cut-off events. For 8552/8884 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 79366 event pairs, 804 based on Foata normal form. 412/11953 useless extension candidates. Maximal degree in co-relation 30985. Up to 4665 conditions per place. [2024-10-11 19:34:04,883 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 63 selfloop transitions, 10 changer transitions 0/93 dead transitions. [2024-10-11 19:34:04,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 93 transitions, 469 flow [2024-10-11 19:34:04,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:34:04,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:34:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 189 transitions. [2024-10-11 19:34:04,885 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6872727272727273 [2024-10-11 19:34:04,885 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 194 flow. Second operand 5 states and 189 transitions. [2024-10-11 19:34:04,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 93 transitions, 469 flow [2024-10-11 19:34:04,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 93 transitions, 466 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:34:04,888 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 259 flow [2024-10-11 19:34:04,889 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2024-10-11 19:34:04,889 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2024-10-11 19:34:04,889 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 259 flow [2024-10-11 19:34:04,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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:34:04,890 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:34:04,890 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:34:04,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 19:34:04,890 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:34:04,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:34:04,891 INFO L85 PathProgramCache]: Analyzing trace with hash 702876430, now seen corresponding path program 1 times [2024-10-11 19:34:04,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:34:04,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533757748] [2024-10-11 19:34:04,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:34:04,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:34:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:34:05,089 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:34:05,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:34:05,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533757748] [2024-10-11 19:34:05,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533757748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:34:05,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:34:05,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:34:05,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939260177] [2024-10-11 19:34:05,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:34:05,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:34:05,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:34:05,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:34:05,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:34:05,102 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-10-11 19:34:05,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 259 flow. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 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:34:05,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:34:05,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-10-11 19:34:05,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:34:06,985 INFO L124 PetriNetUnfolderBase]: 12277/19668 cut-off events. [2024-10-11 19:34:06,986 INFO L125 PetriNetUnfolderBase]: For 23356/27425 co-relation queries the response was YES. [2024-10-11 19:34:07,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55607 conditions, 19668 events. 12277/19668 cut-off events. For 23356/27425 co-relation queries the response was YES. Maximal size of possible extension queue 967. Compared 149788 event pairs, 4012 based on Foata normal form. 517/19121 useless extension candidates. Maximal degree in co-relation 55590. Up to 9072 conditions per place. [2024-10-11 19:34:07,117 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 104 selfloop transitions, 23 changer transitions 0/153 dead transitions. [2024-10-11 19:34:07,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 153 transitions, 873 flow [2024-10-11 19:34:07,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 19:34:07,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 19:34:07,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 315 transitions. [2024-10-11 19:34:07,120 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-10-11 19:34:07,120 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 259 flow. Second operand 9 states and 315 transitions. [2024-10-11 19:34:07,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 153 transitions, 873 flow [2024-10-11 19:34:07,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 153 transitions, 858 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-10-11 19:34:07,127 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 459 flow [2024-10-11 19:34:07,128 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=459, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2024-10-11 19:34:07,129 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 18 predicate places. [2024-10-11 19:34:07,129 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 459 flow [2024-10-11 19:34:07,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 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:34:07,129 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:34:07,130 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:34:07,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 19:34:07,130 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:34:07,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:34:07,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1723145214, now seen corresponding path program 2 times [2024-10-11 19:34:07,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:34:07,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955409660] [2024-10-11 19:34:07,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:34:07,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:34:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:34:07,326 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:34:07,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:34:07,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955409660] [2024-10-11 19:34:07,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955409660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:34:07,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:34:07,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 19:34:07,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186527147] [2024-10-11 19:34:07,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:34:07,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 19:34:07,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:34:07,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 19:34:07,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 19:34:07,341 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-10-11 19:34:07,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 459 flow. Second operand has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 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:34:07,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:34:07,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-10-11 19:34:07,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:34:10,312 INFO L124 PetriNetUnfolderBase]: 16703/26493 cut-off events. [2024-10-11 19:34:10,313 INFO L125 PetriNetUnfolderBase]: For 70494/74010 co-relation queries the response was YES. [2024-10-11 19:34:10,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88232 conditions, 26493 events. 16703/26493 cut-off events. For 70494/74010 co-relation queries the response was YES. Maximal size of possible extension queue 1371. Compared 210212 event pairs, 4456 based on Foata normal form. 436/25245 useless extension candidates. Maximal degree in co-relation 88209. Up to 8837 conditions per place. [2024-10-11 19:34:10,672 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 90 selfloop transitions, 13 changer transitions 17/146 dead transitions. [2024-10-11 19:34:10,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 146 transitions, 1056 flow [2024-10-11 19:34:10,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 19:34:10,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 19:34:10,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 277 transitions. [2024-10-11 19:34:10,674 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6295454545454545 [2024-10-11 19:34:10,674 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 459 flow. Second operand 8 states and 277 transitions. [2024-10-11 19:34:10,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 146 transitions, 1056 flow [2024-10-11 19:34:10,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 146 transitions, 1018 flow, removed 19 selfloop flow, removed 0 redundant places. [2024-10-11 19:34:10,741 INFO L231 Difference]: Finished difference. Result has 90 places, 67 transitions, 414 flow [2024-10-11 19:34:10,741 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=414, PETRI_PLACES=90, PETRI_TRANSITIONS=67} [2024-10-11 19:34:10,741 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 28 predicate places. [2024-10-11 19:34:10,742 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 67 transitions, 414 flow [2024-10-11 19:34:10,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 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:34:10,744 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:34:10,744 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:34:10,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 19:34:10,745 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:34:10,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:34:10,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1064488776, now seen corresponding path program 3 times [2024-10-11 19:34:10,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:34:10,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032629635] [2024-10-11 19:34:10,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:34:10,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:34:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:34:10,897 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:34:10,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:34:10,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032629635] [2024-10-11 19:34:10,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032629635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:34:10,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:34:10,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:34:10,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568083796] [2024-10-11 19:34:10,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:34:10,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:34:10,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:34:10,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:34:10,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:34:10,904 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-11 19:34:10,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 67 transitions, 414 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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:34:10,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:34:10,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-11 19:34:10,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:34:13,250 INFO L124 PetriNetUnfolderBase]: 15213/22775 cut-off events. [2024-10-11 19:34:13,250 INFO L125 PetriNetUnfolderBase]: For 54117/58864 co-relation queries the response was YES. [2024-10-11 19:34:13,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72351 conditions, 22775 events. 15213/22775 cut-off events. For 54117/58864 co-relation queries the response was YES. Maximal size of possible extension queue 1214. Compared 162382 event pairs, 1422 based on Foata normal form. 796/22839 useless extension candidates. Maximal degree in co-relation 72323. Up to 7424 conditions per place. [2024-10-11 19:34:13,396 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 79 selfloop transitions, 14 changer transitions 3/123 dead transitions. [2024-10-11 19:34:13,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 123 transitions, 854 flow [2024-10-11 19:34:13,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:34:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:34:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 228 transitions. [2024-10-11 19:34:13,397 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2024-10-11 19:34:13,397 INFO L175 Difference]: Start difference. First operand has 90 places, 67 transitions, 414 flow. Second operand 6 states and 228 transitions. [2024-10-11 19:34:13,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 123 transitions, 854 flow [2024-10-11 19:34:13,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 123 transitions, 808 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-10-11 19:34:13,432 INFO L231 Difference]: Finished difference. Result has 86 places, 71 transitions, 450 flow [2024-10-11 19:34:13,433 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=450, PETRI_PLACES=86, PETRI_TRANSITIONS=71} [2024-10-11 19:34:13,433 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 24 predicate places. [2024-10-11 19:34:13,433 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 71 transitions, 450 flow [2024-10-11 19:34:13,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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:34:13,434 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:34:13,434 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:34:13,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 19:34:13,434 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:34:13,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:34:13,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1020511675, now seen corresponding path program 1 times [2024-10-11 19:34:13,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:34:13,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735914086] [2024-10-11 19:34:13,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:34:13,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:34:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:34:13,624 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:34:13,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:34:13,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735914086] [2024-10-11 19:34:13,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735914086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:34:13,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:34:13,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:34:13,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992487918] [2024-10-11 19:34:13,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:34:13,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 19:34:13,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:34:13,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 19:34:13,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 19:34:13,649 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-11 19:34:13,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 71 transitions, 450 flow. Second operand has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 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:34:13,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:34:13,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-11 19:34:13,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:34:15,761 INFO L124 PetriNetUnfolderBase]: 13273/19635 cut-off events. [2024-10-11 19:34:15,761 INFO L125 PetriNetUnfolderBase]: For 69965/75949 co-relation queries the response was YES. [2024-10-11 19:34:15,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69710 conditions, 19635 events. 13273/19635 cut-off events. For 69965/75949 co-relation queries the response was YES. Maximal size of possible extension queue 1213. Compared 138412 event pairs, 1338 based on Foata normal form. 342/19253 useless extension candidates. Maximal degree in co-relation 69685. Up to 7424 conditions per place. [2024-10-11 19:34:15,884 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 63 selfloop transitions, 18 changer transitions 14/119 dead transitions. [2024-10-11 19:34:15,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 119 transitions, 812 flow [2024-10-11 19:34:15,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 19:34:15,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 19:34:15,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 249 transitions. [2024-10-11 19:34:15,888 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6467532467532467 [2024-10-11 19:34:15,888 INFO L175 Difference]: Start difference. First operand has 86 places, 71 transitions, 450 flow. Second operand 7 states and 249 transitions. [2024-10-11 19:34:15,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 119 transitions, 812 flow [2024-10-11 19:34:16,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 119 transitions, 728 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-10-11 19:34:16,105 INFO L231 Difference]: Finished difference. Result has 87 places, 67 transitions, 410 flow [2024-10-11 19:34:16,106 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=410, PETRI_PLACES=87, PETRI_TRANSITIONS=67} [2024-10-11 19:34:16,107 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 25 predicate places. [2024-10-11 19:34:16,107 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 67 transitions, 410 flow [2024-10-11 19:34:16,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 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:34:16,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:34:16,108 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:34:16,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 19:34:16,108 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:34:16,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:34:16,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1287293764, now seen corresponding path program 1 times [2024-10-11 19:34:16,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:34:16,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557543151] [2024-10-11 19:34:16,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:34:16,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:34:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:34:16,395 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:34:16,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:34:16,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557543151] [2024-10-11 19:34:16,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557543151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:34:16,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:34:16,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:34:16,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588657117] [2024-10-11 19:34:16,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:34:16,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:34:16,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:34:16,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:34:16,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:34:16,407 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-10-11 19:34:16,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 67 transitions, 410 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:34:16,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:34:16,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-10-11 19:34:16,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:34:18,476 INFO L124 PetriNetUnfolderBase]: 11713/20745 cut-off events. [2024-10-11 19:34:18,476 INFO L125 PetriNetUnfolderBase]: For 49707/53874 co-relation queries the response was YES. [2024-10-11 19:34:18,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63014 conditions, 20745 events. 11713/20745 cut-off events. For 49707/53874 co-relation queries the response was YES. Maximal size of possible extension queue 1620. Compared 191209 event pairs, 3302 based on Foata normal form. 257/18405 useless extension candidates. Maximal degree in co-relation 62989. Up to 6921 conditions per place. [2024-10-11 19:34:18,604 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 42 selfloop transitions, 2 changer transitions 22/106 dead transitions. [2024-10-11 19:34:18,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 106 transitions, 681 flow [2024-10-11 19:34:18,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:34:18,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:34:18,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2024-10-11 19:34:18,606 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6242424242424243 [2024-10-11 19:34:18,606 INFO L175 Difference]: Start difference. First operand has 87 places, 67 transitions, 410 flow. Second operand 6 states and 206 transitions. [2024-10-11 19:34:18,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 106 transitions, 681 flow [2024-10-11 19:34:18,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 106 transitions, 606 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-10-11 19:34:18,996 INFO L231 Difference]: Finished difference. Result has 89 places, 65 transitions, 348 flow [2024-10-11 19:34:18,996 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=348, PETRI_PLACES=89, PETRI_TRANSITIONS=65} [2024-10-11 19:34:18,996 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 27 predicate places. [2024-10-11 19:34:18,996 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 65 transitions, 348 flow [2024-10-11 19:34:18,997 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:34:18,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:34:18,997 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:34:18,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 19:34:18,997 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:34:18,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:34:18,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1465264808, now seen corresponding path program 2 times [2024-10-11 19:34:18,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:34:18,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324424479] [2024-10-11 19:34:18,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:34:18,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:34:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:34:20,106 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:34:20,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:34:20,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324424479] [2024-10-11 19:34:20,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324424479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:34:20,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:34:20,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 19:34:20,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585584394] [2024-10-11 19:34:20,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:34:20,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:34:20,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:34:20,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:34:20,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:34:20,136 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-10-11 19:34:20,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 65 transitions, 348 flow. Second operand has 9 states, 9 states have (on average 24.444444444444443) internal successors, (220), 9 states have internal predecessors, (220), 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:34:20,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:34:20,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-10-11 19:34:20,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:34:23,255 INFO L124 PetriNetUnfolderBase]: 15144/26967 cut-off events. [2024-10-11 19:34:23,256 INFO L125 PetriNetUnfolderBase]: For 46783/48960 co-relation queries the response was YES. [2024-10-11 19:34:23,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78276 conditions, 26967 events. 15144/26967 cut-off events. For 46783/48960 co-relation queries the response was YES. Maximal size of possible extension queue 2211. Compared 257965 event pairs, 5016 based on Foata normal form. 262/24258 useless extension candidates. Maximal degree in co-relation 78250. Up to 7937 conditions per place. [2024-10-11 19:34:23,419 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 56 selfloop transitions, 9 changer transitions 43/142 dead transitions. [2024-10-11 19:34:23,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 142 transitions, 913 flow [2024-10-11 19:34:23,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:34:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 19:34:23,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 318 transitions. [2024-10-11 19:34:23,421 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5781818181818181 [2024-10-11 19:34:23,421 INFO L175 Difference]: Start difference. First operand has 89 places, 65 transitions, 348 flow. Second operand 10 states and 318 transitions. [2024-10-11 19:34:23,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 142 transitions, 913 flow [2024-10-11 19:34:24,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 142 transitions, 853 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-10-11 19:34:24,119 INFO L231 Difference]: Finished difference. Result has 95 places, 68 transitions, 378 flow [2024-10-11 19:34:24,120 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=378, PETRI_PLACES=95, PETRI_TRANSITIONS=68} [2024-10-11 19:34:24,120 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 33 predicate places. [2024-10-11 19:34:24,120 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 68 transitions, 378 flow [2024-10-11 19:34:24,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.444444444444443) internal successors, (220), 9 states have internal predecessors, (220), 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:34:24,121 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:34:24,121 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:34:24,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 19:34:24,121 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:34:24,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:34:24,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1724873344, now seen corresponding path program 3 times [2024-10-11 19:34:24,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:34:24,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579975940] [2024-10-11 19:34:24,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:34:24,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:34:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:34:24,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:34:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:34:24,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 19:34:24,232 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:34:24,233 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-10-11 19:34:24,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-10-11 19:34:24,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-10-11 19:34:24,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-10-11 19:34:24,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-10-11 19:34:24,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-10-11 19:34:24,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-10-11 19:34:24,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-10-11 19:34:24,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 19:34:24,240 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:34:24,333 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 19:34:24,334 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 19:34:24,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:34:24 BasicIcfg [2024-10-11 19:34:24,338 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 19:34:24,338 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 19:34:24,338 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 19:34:24,338 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 19:34:24,339 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:33:57" (3/4) ... [2024-10-11 19:34:24,340 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 19:34:24,341 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 19:34:24,342 INFO L158 Benchmark]: Toolchain (without parser) took 28505.84ms. Allocated memory was 151.0MB in the beginning and 8.7GB in the end (delta: 8.6GB). Free memory was 78.9MB in the beginning and 7.3GB in the end (delta: -7.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-10-11 19:34:24,342 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 151.0MB. Free memory is still 102.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:34:24,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 532.60ms. Allocated memory was 151.0MB in the beginning and 211.8MB in the end (delta: 60.8MB). Free memory was 78.7MB in the beginning and 173.9MB in the end (delta: -95.2MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2024-10-11 19:34:24,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.15ms. Allocated memory is still 211.8MB. Free memory was 173.9MB in the beginning and 171.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:34:24,343 INFO L158 Benchmark]: Boogie Preprocessor took 60.32ms. Allocated memory is still 211.8MB. Free memory was 171.8MB in the beginning and 168.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:34:24,343 INFO L158 Benchmark]: RCFGBuilder took 618.15ms. Allocated memory is still 211.8MB. Free memory was 167.6MB in the beginning and 115.2MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-10-11 19:34:24,343 INFO L158 Benchmark]: TraceAbstraction took 27226.99ms. Allocated memory was 211.8MB in the beginning and 8.7GB in the end (delta: 8.5GB). Free memory was 114.1MB in the beginning and 7.3GB in the end (delta: -7.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-10-11 19:34:24,343 INFO L158 Benchmark]: Witness Printer took 3.20ms. Allocated memory is still 8.7GB. Free memory is still 7.3GB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:34:24,344 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.30ms. Allocated memory is still 151.0MB. Free memory is still 102.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 532.60ms. Allocated memory was 151.0MB in the beginning and 211.8MB in the end (delta: 60.8MB). Free memory was 78.7MB in the beginning and 173.9MB in the end (delta: -95.2MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.15ms. Allocated memory is still 211.8MB. Free memory was 173.9MB in the beginning and 171.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.32ms. Allocated memory is still 211.8MB. Free memory was 171.8MB in the beginning and 168.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 618.15ms. Allocated memory is still 211.8MB. Free memory was 167.6MB in the beginning and 115.2MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 27226.99ms. Allocated memory was 211.8MB in the beginning and 8.7GB in the end (delta: 8.5GB). Free memory was 114.1MB in the beginning and 7.3GB in the end (delta: -7.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 3.20ms. Allocated memory is still 8.7GB. Free memory is still 7.3GB. 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_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L731] 0 _Bool y$flush_delayed; [L732] 0 int y$mem_tmp; [L733] 0 _Bool y$r_buff0_thd0; [L734] 0 _Bool y$r_buff0_thd1; [L735] 0 _Bool y$r_buff0_thd2; [L736] 0 _Bool y$r_buff0_thd3; [L737] 0 _Bool y$r_buff0_thd4; [L738] 0 _Bool y$r_buff1_thd0; [L739] 0 _Bool y$r_buff1_thd1; [L740] 0 _Bool y$r_buff1_thd2; [L741] 0 _Bool y$r_buff1_thd3; [L742] 0 _Bool y$r_buff1_thd4; [L743] 0 _Bool y$read_delayed; [L744] 0 int *y$read_delayed_var; [L745] 0 int y$w_buff0; [L746] 0 _Bool y$w_buff0_used; [L747] 0 int y$w_buff1; [L748] 0 _Bool y$w_buff1_used; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L863] 0 pthread_t t941; [L864] FCALL, FORK 0 pthread_create(&t941, ((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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L865] 0 pthread_t t942; [L866] FCALL, FORK 0 pthread_create(&t942, ((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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941=-2, t942=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L867] 0 pthread_t t943; [L868] FCALL, FORK 0 pthread_create(&t943, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941=-2, t942=-1, t943=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L869] 0 pthread_t t944; [L870] FCALL, FORK 0 pthread_create(&t944, ((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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941=-2, t942=-1, t943=0, t944=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L799] 3 y$w_buff1 = y$w_buff0 [L800] 3 y$w_buff0 = 1 [L801] 3 y$w_buff1_used = y$w_buff0_used [L802] 3 y$w_buff0_used = (_Bool)1 [L803] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L803] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L804] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L805] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L806] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L807] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L808] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L809] 3 y$r_buff0_thd3 = (_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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L812] 3 __unbuffered_p2_EAX = z 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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L829] 4 z = 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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L832] 4 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_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L835] 4 __unbuffered_p3_EAX = a 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L838] 4 __unbuffered_p3_EBX = b 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 1 b = 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EAX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L815] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L841] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L843] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L844] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L845] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L792] 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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1 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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L872] 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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t941=-2, t942=-1, t943=0, t944=1, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L874] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L874] RET 0 assume_abort_if_not(main$tmp_guard0) [L876] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L878] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L879] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L880] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t941=-2, t942=-1, t943=0, t944=1, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t941=-2, t942=-1, t943=0, t944=1, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L885] 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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L17] 0 __assert_fail ("0", "mix036_power.opt_rmo.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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, 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: 861]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 870]: 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: 866]: 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: 868]: 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: 864]: 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: 27.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 23.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 767 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 723 mSDsluCounter, 337 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 291 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1952 IncrementalHoareTripleChecker+Invalid, 1990 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 46 mSDtfsCounter, 1952 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=459occurred in iteration=7, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 2095 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:34:24,373 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/mix036_power.opt_rmo.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 f5d83fc7ee9b26859e9993ee2fcff801f4a9d92dea17a48a6a39594bb6b759ca --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:34:26,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:34:27,059 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:34:27,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:34:27,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:34:27,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:34:27,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:34:27,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:34:27,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:34:27,103 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:34:27,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:34:27,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:34:27,104 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:34:27,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:34:27,105 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:34:27,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:34:27,106 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:34:27,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:34:27,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:34:27,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:34:27,106 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:34:27,110 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:34:27,111 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:34:27,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:34:27,111 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:34:27,111 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:34:27,111 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:34:27,111 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:34:27,111 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:34:27,112 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:34:27,112 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:34:27,112 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:34:27,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:34:27,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:34:27,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:34:27,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:34:27,113 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:34:27,113 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:34:27,113 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:34:27,113 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:34:27,114 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:34:27,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:34:27,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:34:27,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:34:27,116 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:34:27,116 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 -> f5d83fc7ee9b26859e9993ee2fcff801f4a9d92dea17a48a6a39594bb6b759ca [2024-10-11 19:34:27,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:34:27,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:34:27,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:34:27,443 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:34:27,443 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:34:27,444 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix036_power.opt_rmo.opt.i [2024-10-11 19:34:28,880 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:34:29,116 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:34:29,116 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix036_power.opt_rmo.opt.i [2024-10-11 19:34:29,135 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6598bb19e/61968c963963470c8c45ffe49a8bdf24/FLAG099ad1560 [2024-10-11 19:34:29,446 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6598bb19e/61968c963963470c8c45ffe49a8bdf24 [2024-10-11 19:34:29,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:34:29,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:34:29,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:34:29,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:34:29,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:34:29,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:34:29" (1/1) ... [2024-10-11 19:34:29,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a196626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:29, skipping insertion in model container [2024-10-11 19:34:29,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:34:29" (1/1) ... [2024-10-11 19:34:29,499 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:34:29,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:34:29,897 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:34:29,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:34:29,995 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:34:29,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:29 WrapperNode [2024-10-11 19:34:29,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:34:29,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:34:29,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:34:29,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:34:30,003 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:34:29" (1/1) ... [2024-10-11 19:34:30,030 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:34:29" (1/1) ... [2024-10-11 19:34:30,063 INFO L138 Inliner]: procedures = 177, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 135 [2024-10-11 19:34:30,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:34:30,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:34:30,065 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:34:30,065 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:34:30,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:29" (1/1) ... [2024-10-11 19:34:30,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:29" (1/1) ... [2024-10-11 19:34:30,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:29" (1/1) ... [2024-10-11 19:34:30,102 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:34:30,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:29" (1/1) ... [2024-10-11 19:34:30,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:29" (1/1) ... [2024-10-11 19:34:30,109 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:29" (1/1) ... [2024-10-11 19:34:30,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:29" (1/1) ... [2024-10-11 19:34:30,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:29" (1/1) ... [2024-10-11 19:34:30,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:29" (1/1) ... [2024-10-11 19:34:30,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:34:30,117 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:34:30,117 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:34:30,117 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:34:30,118 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:29" (1/1) ... [2024-10-11 19:34:30,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:34:30,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:34:30,145 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:34:30,147 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:34:30,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 19:34:30,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:34:30,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:34:30,182 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-11 19:34:30,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-11 19:34:30,183 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-11 19:34:30,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-11 19:34:30,183 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-11 19:34:30,184 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-11 19:34:30,184 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-11 19:34:30,184 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-11 19:34:30,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 19:34:30,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:34:30,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:34:30,186 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:34:30,313 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:34:30,316 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:34:30,636 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:34:30,637 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:34:30,846 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:34:30,846 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 19:34:30,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:34:30 BoogieIcfgContainer [2024-10-11 19:34:30,847 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:34:30,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:34:30,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:34:30,852 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:34:30,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:34:29" (1/3) ... [2024-10-11 19:34:30,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c69fd2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:34:30, skipping insertion in model container [2024-10-11 19:34:30,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:29" (2/3) ... [2024-10-11 19:34:30,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c69fd2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:34:30, skipping insertion in model container [2024-10-11 19:34:30,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:34:30" (3/3) ... [2024-10-11 19:34:30,857 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_power.opt_rmo.opt.i [2024-10-11 19:34:30,872 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:34:30,872 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-11 19:34:30,872 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:34:30,929 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 19:34:30,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2024-10-11 19:34:30,995 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2024-10-11 19:34:30,996 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:34:31,001 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 107 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:34:31,001 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2024-10-11 19:34:31,005 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2024-10-11 19:34:31,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:34:31,018 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;@18ecab18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:34:31,018 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 19:34:31,022 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:34:31,023 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2024-10-11 19:34:31,023 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:34:31,023 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:34:31,024 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:34:31,024 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:34:31,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:34:31,030 INFO L85 PathProgramCache]: Analyzing trace with hash -301088625, now seen corresponding path program 1 times [2024-10-11 19:34:31,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:34:31,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473362052] [2024-10-11 19:34:31,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:34:31,041 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:34:31,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:34:31,042 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:34:31,043 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:34:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:34:31,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:34:31,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:34:31,161 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:34:31,161 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:34:31,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:34:31,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473362052] [2024-10-11 19:34:31,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473362052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:34:31,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:34:31,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:34:31,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651808327] [2024-10-11 19:34:31,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:34:31,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:34:31,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:34:31,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:34:31,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:34:31,201 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2024-10-11 19:34:31,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:34:31,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:34:31,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2024-10-11 19:34:31,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:34:31,667 INFO L124 PetriNetUnfolderBase]: 1525/2593 cut-off events. [2024-10-11 19:34:31,668 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-10-11 19:34:31,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4831 conditions, 2593 events. 1525/2593 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 17921 event pairs, 469 based on Foata normal form. 144/2677 useless extension candidates. Maximal degree in co-relation 4819. Up to 1717 conditions per place. [2024-10-11 19:34:31,690 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 33 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2024-10-11 19:34:31,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 61 transitions, 211 flow [2024-10-11 19:34:31,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:34:31,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:34:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2024-10-11 19:34:31,702 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7636363636363637 [2024-10-11 19:34:31,703 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 126 transitions. [2024-10-11 19:34:31,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 61 transitions, 211 flow [2024-10-11 19:34:31,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 61 transitions, 206 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:34:31,711 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2024-10-11 19:34:31,714 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:34:31,716 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-10-11 19:34:31,716 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2024-10-11 19:34:31,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:34:31,717 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:34:31,717 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:34:31,724 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:34:31,917 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:34:31,918 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:34:31,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:34:31,918 INFO L85 PathProgramCache]: Analyzing trace with hash 183145597, now seen corresponding path program 1 times [2024-10-11 19:34:31,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:34:31,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071272533] [2024-10-11 19:34:31,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:34:31,919 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:34:31,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:34:31,944 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:34:31,946 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:34:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:34:32,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:34:32,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:34:32,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:34:32,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:34:32,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:34:32,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071272533] [2024-10-11 19:34:32,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071272533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:34:32,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:34:32,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:34:32,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405229632] [2024-10-11 19:34:32,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:34:32,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:34:32,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:34:32,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:34:32,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:34:32,092 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-11 19:34:32,092 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:34:32,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:34:32,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-11 19:34:32,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:34:33,030 INFO L124 PetriNetUnfolderBase]: 5957/9377 cut-off events. [2024-10-11 19:34:33,031 INFO L125 PetriNetUnfolderBase]: For 432/432 co-relation queries the response was YES. [2024-10-11 19:34:33,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18161 conditions, 9377 events. 5957/9377 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 68353 event pairs, 663 based on Foata normal form. 240/9543 useless extension candidates. Maximal degree in co-relation 18151. Up to 5353 conditions per place. [2024-10-11 19:34:33,090 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 48 selfloop transitions, 6 changer transitions 1/74 dead transitions. [2024-10-11 19:34:33,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 280 flow [2024-10-11 19:34:33,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:34:33,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:34:33,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2024-10-11 19:34:33,094 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6772727272727272 [2024-10-11 19:34:33,095 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:34:33,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 280 flow [2024-10-11 19:34:33,096 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:34:33,098 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 142 flow [2024-10-11 19:34:33,099 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:34:33,101 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -2 predicate places. [2024-10-11 19:34:33,102 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 142 flow [2024-10-11 19:34:33,102 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:34:33,102 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:34:33,102 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:34:33,108 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 (3)] Forceful destruction successful, exit code 0 [2024-10-11 19:34:33,305 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:34:33,305 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:34:33,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:34:33,306 INFO L85 PathProgramCache]: Analyzing trace with hash -735942672, now seen corresponding path program 1 times [2024-10-11 19:34:33,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:34:33,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123187648] [2024-10-11 19:34:33,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:34:33,307 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:34:33,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:34:33,309 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:34:33,310 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:34:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:34:33,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:34:33,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:34:33,412 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:34:33,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:34:33,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:34:33,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123187648] [2024-10-11 19:34:33,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123187648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:34:33,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:34:33,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:34:33,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034339199] [2024-10-11 19:34:33,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:34:33,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:34:33,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:34:33,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:34:33,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:34:33,423 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-11 19:34:33,424 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:34:33,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:34:33,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-11 19:34:33,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:34:34,291 INFO L124 PetriNetUnfolderBase]: 4789/7581 cut-off events. [2024-10-11 19:34:34,292 INFO L125 PetriNetUnfolderBase]: For 1895/1895 co-relation queries the response was YES. [2024-10-11 19:34:34,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16899 conditions, 7581 events. 4789/7581 cut-off events. For 1895/1895 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 53201 event pairs, 293 based on Foata normal form. 228/7758 useless extension candidates. Maximal degree in co-relation 16887. Up to 3841 conditions per place. [2024-10-11 19:34:34,331 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 61 selfloop transitions, 10 changer transitions 1/91 dead transitions. [2024-10-11 19:34:34,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 91 transitions, 397 flow [2024-10-11 19:34:34,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:34:34,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:34:34,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 189 transitions. [2024-10-11 19:34:34,333 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6872727272727273 [2024-10-11 19:34:34,333 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:34:34,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 91 transitions, 397 flow [2024-10-11 19:34:34,338 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:34:34,339 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 194 flow [2024-10-11 19:34:34,339 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:34:34,340 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2024-10-11 19:34:34,340 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 194 flow [2024-10-11 19:34:34,340 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:34:34,340 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:34:34,340 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:34:34,351 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:34:34,551 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:34:34,552 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:34:34,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:34:34,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1936936639, now seen corresponding path program 1 times [2024-10-11 19:34:34,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:34:34,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407050997] [2024-10-11 19:34:34,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:34:34,553 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:34:34,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:34:34,555 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:34:34,556 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:34:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:34:34,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:34:34,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:34:34,682 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:34:34,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:34:34,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:34:34,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407050997] [2024-10-11 19:34:34,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [407050997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:34:34,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:34:34,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:34:34,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437186217] [2024-10-11 19:34:34,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:34:34,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:34:34,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:34:34,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:34:34,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:34:34,692 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-11 19:34:34,693 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.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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:34:34,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:34:34,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-11 19:34:34,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:34:35,263 INFO L124 PetriNetUnfolderBase]: 3029/4753 cut-off events. [2024-10-11 19:34:35,263 INFO L125 PetriNetUnfolderBase]: For 3718/3718 co-relation queries the response was YES. [2024-10-11 19:34:35,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11987 conditions, 4753 events. 3029/4753 cut-off events. For 3718/3718 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 29040 event pairs, 137 based on Foata normal form. 172/4884 useless extension candidates. Maximal degree in co-relation 11973. Up to 1633 conditions per place. [2024-10-11 19:34:35,293 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 72 selfloop transitions, 14 changer transitions 1/106 dead transitions. [2024-10-11 19:34:35,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 106 transitions, 520 flow [2024-10-11 19:34:35,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:34:35,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:34:35,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 227 transitions. [2024-10-11 19:34:35,298 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6878787878787879 [2024-10-11 19:34:35,298 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:34:35,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 106 transitions, 520 flow [2024-10-11 19:34:35,309 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:34:35,311 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 244 flow [2024-10-11 19:34:35,312 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:34:35,312 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2024-10-11 19:34:35,314 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 244 flow [2024-10-11 19:34:35,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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:34:35,314 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:34:35,314 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:34:35,318 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:34:35,515 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:34:35,516 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:34:35,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:34:35,516 INFO L85 PathProgramCache]: Analyzing trace with hash 602393722, now seen corresponding path program 1 times [2024-10-11 19:34:35,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:34:35,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371184944] [2024-10-11 19:34:35,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:34:35,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:34:35,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:34:35,522 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:34:35,523 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:34:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:34:35,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:34:35,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:34:35,674 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:34:35,675 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:34:35,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:34:35,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371184944] [2024-10-11 19:34:35,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371184944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:34:35,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:34:35,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:34:35,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693378527] [2024-10-11 19:34:35,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:34:35,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 19:34:35,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:34:35,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 19:34:35,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 19:34:35,692 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-10-11 19:34:35,693 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.857142857142858) internal successors, (181), 7 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:34:35,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:34:35,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-10-11 19:34:35,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:34:36,126 INFO L124 PetriNetUnfolderBase]: 1857/2785 cut-off events. [2024-10-11 19:34:36,126 INFO L125 PetriNetUnfolderBase]: For 3956/3956 co-relation queries the response was YES. [2024-10-11 19:34:36,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7964 conditions, 2785 events. 1857/2785 cut-off events. For 3956/3956 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 14276 event pairs, 99 based on Foata normal form. 80/2825 useless extension candidates. Maximal degree in co-relation 7949. Up to 828 conditions per place. [2024-10-11 19:34:36,146 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 65 selfloop transitions, 18 changer transitions 1/103 dead transitions. [2024-10-11 19:34:36,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 103 transitions, 518 flow [2024-10-11 19:34:36,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 19:34:36,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 19:34:36,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 247 transitions. [2024-10-11 19:34:36,147 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6415584415584416 [2024-10-11 19:34:36,148 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:34:36,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 103 transitions, 518 flow [2024-10-11 19:34:36,162 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:34:36,164 INFO L231 Difference]: Finished difference. Result has 70 places, 58 transitions, 254 flow [2024-10-11 19:34:36,165 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:34:36,166 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2024-10-11 19:34:36,166 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 58 transitions, 254 flow [2024-10-11 19:34:36,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 7 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:34:36,167 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:34:36,167 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:34:36,173 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:34:36,367 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:34:36,368 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:34:36,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:34:36,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1517917127, now seen corresponding path program 1 times [2024-10-11 19:34:36,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:34:36,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359894063] [2024-10-11 19:34:36,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:34:36,369 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:34:36,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:34:36,372 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:34:36,374 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:34:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:34:36,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:34:36,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:34:36,552 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:34:36,553 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:34:36,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:34:36,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359894063] [2024-10-11 19:34:36,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1359894063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:34:36,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:34:36,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:34:36,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405621446] [2024-10-11 19:34:36,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:34:36,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:34:36,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:34:36,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:34:36,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:34:36,559 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2024-10-11 19:34:36,559 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:34:36,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:34:36,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2024-10-11 19:34:36,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:34:36,754 INFO L124 PetriNetUnfolderBase]: 824/1576 cut-off events. [2024-10-11 19:34:36,754 INFO L125 PetriNetUnfolderBase]: For 573/613 co-relation queries the response was YES. [2024-10-11 19:34:36,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3382 conditions, 1576 events. 824/1576 cut-off events. For 573/613 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9649 event pairs, 771 based on Foata normal form. 16/1418 useless extension candidates. Maximal degree in co-relation 3366. Up to 1188 conditions per place. [2024-10-11 19:34:36,766 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 20 selfloop transitions, 1 changer transitions 1/57 dead transitions. [2024-10-11 19:34:36,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 57 transitions, 296 flow [2024-10-11 19:34:36,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:34:36,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:34:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-10-11 19:34:36,767 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2024-10-11 19:34:36,768 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:34:36,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 57 transitions, 296 flow [2024-10-11 19:34:36,771 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:34:36,772 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 156 flow [2024-10-11 19:34:36,772 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:34:36,773 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2024-10-11 19:34:36,774 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 156 flow [2024-10-11 19:34:36,774 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:34:36,774 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:34:36,774 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:34:36,781 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:34:36,974 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:34:36,975 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:34:36,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:34:36,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1194906402, now seen corresponding path program 1 times [2024-10-11 19:34:36,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:34:36,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447252171] [2024-10-11 19:34:36,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:34:36,976 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:34:36,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:34:36,978 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:34:36,978 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:34:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:34:37,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:34:37,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:34:37,121 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:34:37,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:34:37,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:34:37,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1447252171] [2024-10-11 19:34:37,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1447252171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:34:37,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:34:37,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:34:37,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099528408] [2024-10-11 19:34:37,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:34:37,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:34:37,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:34:37,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:34:37,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:34:37,133 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-10-11 19:34:37,135 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:34:37,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:34:37,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-10-11 19:34:37,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:34:37,673 INFO L124 PetriNetUnfolderBase]: 2551/4376 cut-off events. [2024-10-11 19:34:37,673 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:34:37,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8592 conditions, 4376 events. 2551/4376 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 28859 event pairs, 683 based on Foata normal form. 16/4039 useless extension candidates. Maximal degree in co-relation 8585. Up to 1630 conditions per place. [2024-10-11 19:34:37,697 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 34 selfloop transitions, 1 changer transitions 26/93 dead transitions. [2024-10-11 19:34:37,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 93 transitions, 360 flow [2024-10-11 19:34:37,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:34:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:34:37,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2024-10-11 19:34:37,698 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2024-10-11 19:34:37,699 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 156 flow. Second operand 6 states and 212 transitions. [2024-10-11 19:34:37,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 93 transitions, 360 flow [2024-10-11 19:34:37,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 93 transitions, 359 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:34:37,702 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 166 flow [2024-10-11 19:34:37,702 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=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2024-10-11 19:34:37,703 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2024-10-11 19:34:37,703 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 166 flow [2024-10-11 19:34:37,703 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:34:37,704 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:34:37,704 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:34:37,710 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:34:37,904 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:34:37,904 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:34:37,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:34:37,905 INFO L85 PathProgramCache]: Analyzing trace with hash -132182600, now seen corresponding path program 2 times [2024-10-11 19:34:37,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:34:37,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245035637] [2024-10-11 19:34:37,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:34:37,906 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:34:37,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:34:37,909 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:34:37,911 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:34:38,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 19:34:38,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:34:38,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:34:38,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:34:38,092 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:34:38,092 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:34:38,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:34:38,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245035637] [2024-10-11 19:34:38,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245035637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:34:38,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:34:38,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:34:38,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98362540] [2024-10-11 19:34:38,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:34:38,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:34:38,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:34:38,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:34:38,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:34:38,102 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-10-11 19:34:38,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 166 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:34:38,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:34:38,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-10-11 19:34:38,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:34:38,705 INFO L124 PetriNetUnfolderBase]: 2564/4522 cut-off events. [2024-10-11 19:34:38,706 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2024-10-11 19:34:38,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8960 conditions, 4522 events. 2564/4522 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 30663 event pairs, 662 based on Foata normal form. 16/4264 useless extension candidates. Maximal degree in co-relation 8949. Up to 1806 conditions per place. [2024-10-11 19:34:38,732 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 31 selfloop transitions, 1 changer transitions 28/92 dead transitions. [2024-10-11 19:34:38,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 92 transitions, 368 flow [2024-10-11 19:34:38,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:34:38,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:34:38,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2024-10-11 19:34:38,734 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6393939393939394 [2024-10-11 19:34:38,734 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 166 flow. Second operand 6 states and 211 transitions. [2024-10-11 19:34:38,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 92 transitions, 368 flow [2024-10-11 19:34:38,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 92 transitions, 357 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-11 19:34:38,737 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 170 flow [2024-10-11 19:34:38,737 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2024-10-11 19:34:38,738 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2024-10-11 19:34:38,738 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 170 flow [2024-10-11 19:34:38,738 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:34:38,739 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:34:38,739 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:34:38,748 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 (9)] Forceful destruction successful, exit code 0 [2024-10-11 19:34:38,939 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:34:38,940 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:34:38,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:34:38,941 INFO L85 PathProgramCache]: Analyzing trace with hash 380604356, now seen corresponding path program 3 times [2024-10-11 19:34:38,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:34:38,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091091098] [2024-10-11 19:34:38,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:34:38,942 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:34:38,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:34:38,944 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:34:38,945 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:34:39,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-11 19:34:39,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:34:39,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 19:34:39,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:34:39,411 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:34:39,411 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:34:39,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:34:39,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091091098] [2024-10-11 19:34:39,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091091098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:34:39,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:34:39,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 19:34:39,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37822032] [2024-10-11 19:34:39,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:34:39,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:34:39,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:34:39,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:34:39,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:34:39,427 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2024-10-11 19:34:39,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 170 flow. Second operand has 9 states, 9 states have (on average 29.0) internal successors, (261), 9 states have internal predecessors, (261), 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:34:39,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:34:39,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2024-10-11 19:34:39,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:34:39,852 INFO L124 PetriNetUnfolderBase]: 1677/3096 cut-off events. [2024-10-11 19:34:39,853 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-11 19:34:39,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6123 conditions, 3096 events. 1677/3096 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 20294 event pairs, 316 based on Foata normal form. 16/2864 useless extension candidates. Maximal degree in co-relation 6111. Up to 720 conditions per place. [2024-10-11 19:34:39,867 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 42 selfloop transitions, 5 changer transitions 16/97 dead transitions. [2024-10-11 19:34:39,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 97 transitions, 388 flow [2024-10-11 19:34:39,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 19:34:39,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 19:34:39,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 307 transitions. [2024-10-11 19:34:39,869 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6202020202020202 [2024-10-11 19:34:39,869 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 170 flow. Second operand 9 states and 307 transitions. [2024-10-11 19:34:39,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 97 transitions, 388 flow [2024-10-11 19:34:39,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 97 transitions, 377 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-11 19:34:39,872 INFO L231 Difference]: Finished difference. Result has 75 places, 57 transitions, 186 flow [2024-10-11 19:34:39,872 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=186, PETRI_PLACES=75, PETRI_TRANSITIONS=57} [2024-10-11 19:34:39,872 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 13 predicate places. [2024-10-11 19:34:39,872 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 57 transitions, 186 flow [2024-10-11 19:34:39,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.0) internal successors, (261), 9 states have internal predecessors, (261), 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:34:39,873 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:34:39,873 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:34:39,877 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 (10)] Ended with exit code 0 [2024-10-11 19:34:40,073 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:34:40,073 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:34:40,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:34:40,074 INFO L85 PathProgramCache]: Analyzing trace with hash 633151820, now seen corresponding path program 4 times [2024-10-11 19:34:40,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:34:40,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65258034] [2024-10-11 19:34:40,074 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 19:34:40,074 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:34:40,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:34:40,077 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:34:40,078 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:34:40,145 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 19:34:40,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:34:40,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:34:40,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:34:40,192 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:34:40,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:34:40,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:34:40,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65258034] [2024-10-11 19:34:40,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65258034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:34:40,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:34:40,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:34:40,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257177004] [2024-10-11 19:34:40,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:34:40,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:34:40,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:34:40,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:34:40,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:34:40,201 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-10-11 19:34:40,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 57 transitions, 186 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:34:40,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:34:40,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-10-11 19:34:40,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:34:40,633 INFO L124 PetriNetUnfolderBase]: 3279/6091 cut-off events. [2024-10-11 19:34:40,633 INFO L125 PetriNetUnfolderBase]: For 754/790 co-relation queries the response was YES. [2024-10-11 19:34:40,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12725 conditions, 6091 events. 3279/6091 cut-off events. For 754/790 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 46836 event pairs, 1269 based on Foata normal form. 18/5665 useless extension candidates. Maximal degree in co-relation 12711. Up to 2072 conditions per place. [2024-10-11 19:34:40,658 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 24 selfloop transitions, 1 changer transitions 30/87 dead transitions. [2024-10-11 19:34:40,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 87 transitions, 381 flow [2024-10-11 19:34:40,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:34:40,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:34:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2024-10-11 19:34:40,660 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6151515151515151 [2024-10-11 19:34:40,660 INFO L175 Difference]: Start difference. First operand has 75 places, 57 transitions, 186 flow. Second operand 6 states and 203 transitions. [2024-10-11 19:34:40,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 87 transitions, 381 flow [2024-10-11 19:34:40,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 87 transitions, 360 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-10-11 19:34:40,664 INFO L231 Difference]: Finished difference. Result has 75 places, 56 transitions, 180 flow [2024-10-11 19:34:40,664 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=66, 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=180, PETRI_PLACES=75, PETRI_TRANSITIONS=56} [2024-10-11 19:34:40,665 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 13 predicate places. [2024-10-11 19:34:40,665 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 56 transitions, 180 flow [2024-10-11 19:34:40,665 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:34:40,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:34:40,665 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:34:40,669 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:34:40,866 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:34:40,866 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-10-11 19:34:40,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:34:40,867 INFO L85 PathProgramCache]: Analyzing trace with hash -176229210, now seen corresponding path program 5 times [2024-10-11 19:34:40,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:34:40,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731344034] [2024-10-11 19:34:40,867 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:34:40,867 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:34:40,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:34:40,870 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:34:40,871 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:34:40,952 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 19:34:40,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-11 19:34:40,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:34:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:34:41,058 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-11 19:34:41,059 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:34:41,059 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-10-11 19:34:41,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-10-11 19:34:41,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-10-11 19:34:41,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-10-11 19:34:41,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-10-11 19:34:41,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-10-11 19:34:41,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-10-11 19:34:41,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-10-11 19:34:41,068 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 (12)] Ended with exit code 0 [2024-10-11 19:34:41,264 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:34:41,264 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2024-10-11 19:34:41,375 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 19:34:41,375 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 19:34:41,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:34:41 BasicIcfg [2024-10-11 19:34:41,384 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 19:34:41,384 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 19:34:41,385 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 19:34:41,385 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 19:34:41,386 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:34:30" (3/4) ... [2024-10-11 19:34:41,387 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 19:34:41,388 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 19:34:41,389 INFO L158 Benchmark]: Toolchain (without parser) took 11938.78ms. Allocated memory was 71.3MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 47.9MB in the beginning and 571.7MB in the end (delta: -523.7MB). Peak memory consumption was 687.8MB. Max. memory is 16.1GB. [2024-10-11 19:34:41,389 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 44.0MB. Free memory was 25.3MB in the beginning and 25.2MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:34:41,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.81ms. Allocated memory is still 71.3MB. Free memory was 47.7MB in the beginning and 40.1MB in the end (delta: 7.6MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-10-11 19:34:41,389 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.48ms. Allocated memory is still 71.3MB. Free memory was 40.1MB in the beginning and 37.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 19:34:41,390 INFO L158 Benchmark]: Boogie Preprocessor took 52.34ms. Allocated memory is still 71.3MB. Free memory was 37.4MB in the beginning and 33.9MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:34:41,390 INFO L158 Benchmark]: RCFGBuilder took 729.87ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 33.9MB in the beginning and 67.0MB in the end (delta: -33.1MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2024-10-11 19:34:41,392 INFO L158 Benchmark]: TraceAbstraction took 10534.80ms. Allocated memory was 92.3MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 66.4MB in the beginning and 572.7MB in the end (delta: -506.4MB). Peak memory consumption was 684.1MB. Max. memory is 16.1GB. [2024-10-11 19:34:41,392 INFO L158 Benchmark]: Witness Printer took 4.25ms. Allocated memory is still 1.3GB. Free memory is still 571.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:34:41,393 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.10ms. Allocated memory is still 44.0MB. Free memory was 25.3MB in the beginning and 25.2MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 543.81ms. Allocated memory is still 71.3MB. Free memory was 47.7MB in the beginning and 40.1MB in the end (delta: 7.6MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.48ms. Allocated memory is still 71.3MB. Free memory was 40.1MB in the beginning and 37.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.34ms. Allocated memory is still 71.3MB. Free memory was 37.4MB in the beginning and 33.9MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 729.87ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 33.9MB in the beginning and 67.0MB in the end (delta: -33.1MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10534.80ms. Allocated memory was 92.3MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 66.4MB in the beginning and 572.7MB in the end (delta: -506.4MB). Peak memory consumption was 684.1MB. Max. memory is 16.1GB. * Witness Printer took 4.25ms. Allocated memory is still 1.3GB. Free memory is still 571.7MB. 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_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L731] 0 _Bool y$flush_delayed; [L732] 0 int y$mem_tmp; [L733] 0 _Bool y$r_buff0_thd0; [L734] 0 _Bool y$r_buff0_thd1; [L735] 0 _Bool y$r_buff0_thd2; [L736] 0 _Bool y$r_buff0_thd3; [L737] 0 _Bool y$r_buff0_thd4; [L738] 0 _Bool y$r_buff1_thd0; [L739] 0 _Bool y$r_buff1_thd1; [L740] 0 _Bool y$r_buff1_thd2; [L741] 0 _Bool y$r_buff1_thd3; [L742] 0 _Bool y$r_buff1_thd4; [L743] 0 _Bool y$read_delayed; [L744] 0 int *y$read_delayed_var; [L745] 0 int y$w_buff0; [L746] 0 _Bool y$w_buff0_used; [L747] 0 int y$w_buff1; [L748] 0 _Bool y$w_buff1_used; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L863] 0 pthread_t t941; [L864] FCALL, FORK 0 pthread_create(&t941, ((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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L865] 0 pthread_t t942; [L866] FCALL, FORK 0 pthread_create(&t942, ((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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941=0, t942=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L867] 0 pthread_t t943; [L868] FCALL, FORK 0 pthread_create(&t943, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941=0, t942=1, t943=2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L799] 3 y$w_buff1 = y$w_buff0 [L800] 3 y$w_buff0 = 1 [L801] 3 y$w_buff1_used = y$w_buff0_used [L802] 3 y$w_buff0_used = (_Bool)1 [L803] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L803] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L804] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L805] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L806] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L807] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L808] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L809] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L869] 0 pthread_t t944; [L870] FCALL, FORK 0 pthread_create(&t944, ((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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941=0, t942=1, t943=2, t944=3, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L812] 3 __unbuffered_p2_EAX = z 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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L829] 4 z = 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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L832] 4 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_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L835] 4 __unbuffered_p3_EAX = a 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L838] 4 __unbuffered_p3_EBX = b 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 1 b = 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EAX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L815] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L792] 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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L841] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L843] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L844] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L845] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1 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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L872] 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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t941=0, t942=1, t943=2, t944=3, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L874] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L874] RET 0 assume_abort_if_not(main$tmp_guard0) [L876] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L878] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L879] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L880] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t941=0, t942=1, t943=2, t944=3, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t941=0, t942=1, t943=2, t944=3, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L885] 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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L17] 0 __assert_fail ("0", "mix036_power.opt_rmo.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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, 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: 861]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 866]: 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: 868]: 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: 864]: 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: 870]: 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: 10.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 511 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 501 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1739 IncrementalHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 5 mSDtfsCounter, 1739 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=5, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 340 NumberOfCodeBlocks, 339 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 1031 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1251 ConjunctsInSsa, 57 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:34:41,418 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