./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 a75df8feda97f2ebeb5cc4266066f8deba1b6726a771b6143f22a640cfcf63d2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:11:07,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:11:07,282 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 03:11:07,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:11:07,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:11:07,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:11:07,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:11:07,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:11:07,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:11:07,315 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:11:07,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:11:07,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:11:07,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:11:07,317 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:11:07,317 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:11:07,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:11:07,318 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:11:07,318 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:11:07,318 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:11:07,318 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:11:07,319 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:11:07,319 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:11:07,319 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:11:07,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:11:07,320 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:11:07,320 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:11:07,320 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:11:07,320 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:11:07,320 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:11:07,320 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:11:07,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:11:07,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:11:07,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:11:07,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:11:07,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:11:07,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:11:07,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 03:11:07,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 03:11:07,322 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:11:07,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:11:07,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:11:07,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:11:07,323 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/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/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 -> a75df8feda97f2ebeb5cc4266066f8deba1b6726a771b6143f22a640cfcf63d2 [2024-11-17 03:11:07,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:11:07,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:11:07,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:11:07,540 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:11:07,541 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:11:07,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i [2024-11-17 03:11:08,758 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:11:08,973 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:11:08,974 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i [2024-11-17 03:11:08,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2f52fbe9/bee4b9752c9d4dfaab13f8f536394f48/FLAGfb1ab96ef [2024-11-17 03:11:09,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2f52fbe9/bee4b9752c9d4dfaab13f8f536394f48 [2024-11-17 03:11:09,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:11:09,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:11:09,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:11:09,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:11:09,332 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:11:09,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:11:09" (1/1) ... [2024-11-17 03:11:09,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@338e3906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:09, skipping insertion in model container [2024-11-17 03:11:09,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:11:09" (1/1) ... [2024-11-17 03:11:09,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:11:09,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:11:09,702 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:11:09,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:11:09,817 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:11:09,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:09 WrapperNode [2024-11-17 03:11:09,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:11:09,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:11:09,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:11:09,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:11:09,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:09" (1/1) ... [2024-11-17 03:11:09,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:09" (1/1) ... [2024-11-17 03:11:09,854 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 133 [2024-11-17 03:11:09,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:11:09,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:11:09,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:11:09,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:11:09,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:09" (1/1) ... [2024-11-17 03:11:09,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:09" (1/1) ... [2024-11-17 03:11:09,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:09" (1/1) ... [2024-11-17 03:11:09,886 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-17 03:11:09,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:09" (1/1) ... [2024-11-17 03:11:09,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:09" (1/1) ... [2024-11-17 03:11:09,892 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:09" (1/1) ... [2024-11-17 03:11:09,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:09" (1/1) ... [2024-11-17 03:11:09,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:09" (1/1) ... [2024-11-17 03:11:09,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:09" (1/1) ... [2024-11-17 03:11:09,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:11:09,904 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:11:09,904 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:11:09,905 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:11:09,906 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:09" (1/1) ... [2024-11-17 03:11:09,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:11:09,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:11:09,944 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 03:11:09,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 03:11:09,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-17 03:11:09,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:11:09,987 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-17 03:11:09,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-17 03:11:09,987 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-17 03:11:09,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-17 03:11:09,987 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-17 03:11:09,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-17 03:11:09,987 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-17 03:11:09,988 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-17 03:11:09,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 03:11:09,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-17 03:11:09,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:11:09,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:11:09,991 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:11:10,137 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:11:10,139 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:11:10,447 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:11:10,447 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:11:10,598 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:11:10,599 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:11:10,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:11:10 BoogieIcfgContainer [2024-11-17 03:11:10,599 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:11:10,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:11:10,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:11:10,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:11:10,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:11:09" (1/3) ... [2024-11-17 03:11:10,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320b2fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:11:10, skipping insertion in model container [2024-11-17 03:11:10,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:09" (2/3) ... [2024-11-17 03:11:10,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320b2fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:11:10, skipping insertion in model container [2024-11-17 03:11:10,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:11:10" (3/3) ... [2024-11-17 03:11:10,609 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014_power.oepc_pso.oepc_rmo.oepc.i [2024-11-17 03:11:10,622 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:11:10,622 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-17 03:11:10,622 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:11:10,704 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-17 03:11:10,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2024-11-17 03:11:10,754 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2024-11-17 03:11:10,755 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:11:10,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 105 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-11-17 03:11:10,759 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2024-11-17 03:11:10,763 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2024-11-17 03:11:10,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:11:10,776 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;@43e3d38c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:11:10,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-17 03:11:10,779 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:11:10,779 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-17 03:11:10,779 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:11:10,780 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:11:10,780 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-17 03:11:10,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:11:10,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:11:10,786 INFO L85 PathProgramCache]: Analyzing trace with hash 14018606, now seen corresponding path program 1 times [2024-11-17 03:11:10,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:11:10,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494428378] [2024-11-17 03:11:10,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:11:10,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:11:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:11:11,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:11:11,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:11:11,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494428378] [2024-11-17 03:11:11,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494428378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:11:11,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:11:11,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:11:11,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204125114] [2024-11-17 03:11:11,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:11:11,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:11:11,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:11:11,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:11:11,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:11:11,256 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2024-11-17 03:11:11,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:11:11,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:11:11,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2024-11-17 03:11:11,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:11:17,372 INFO L124 PetriNetUnfolderBase]: 59301/78646 cut-off events. [2024-11-17 03:11:17,372 INFO L125 PetriNetUnfolderBase]: For 291/291 co-relation queries the response was YES. [2024-11-17 03:11:17,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156796 conditions, 78646 events. 59301/78646 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 2205. Compared 487353 event pairs, 7351 based on Foata normal form. 3528/82126 useless extension candidates. Maximal degree in co-relation 156784. Up to 67151 conditions per place. [2024-11-17 03:11:17,761 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 67 selfloop transitions, 2 changer transitions 2/79 dead transitions. [2024-11-17 03:11:17,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 79 transitions, 321 flow [2024-11-17 03:11:17,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:11:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:11:17,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-11-17 03:11:17,770 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6787878787878788 [2024-11-17 03:11:17,771 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 112 transitions. [2024-11-17 03:11:17,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 79 transitions, 321 flow [2024-11-17 03:11:17,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 79 transitions, 314 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:11:17,777 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2024-11-17 03:11:17,778 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-11-17 03:11:17,781 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-11-17 03:11:17,781 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2024-11-17 03:11:17,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:11:17,781 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:11:17,782 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:11:17,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 03:11:17,782 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:11:17,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:11:17,783 INFO L85 PathProgramCache]: Analyzing trace with hash -217829202, now seen corresponding path program 1 times [2024-11-17 03:11:17,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:11:17,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418301438] [2024-11-17 03:11:17,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:11:17,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:11:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:11:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:11:17,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:11:17,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418301438] [2024-11-17 03:11:17,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418301438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:11:17,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:11:17,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:11:17,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148163711] [2024-11-17 03:11:17,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:11:17,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:11:17,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:11:17,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:11:17,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:11:17,846 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2024-11-17 03:11:17,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:11:17,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:11:17,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2024-11-17 03:11:17,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:11:22,693 INFO L124 PetriNetUnfolderBase]: 53337/74903 cut-off events. [2024-11-17 03:11:22,693 INFO L125 PetriNetUnfolderBase]: For 2746/2746 co-relation queries the response was YES. [2024-11-17 03:11:22,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148069 conditions, 74903 events. 53337/74903 cut-off events. For 2746/2746 co-relation queries the response was YES. Maximal size of possible extension queue 2228. Compared 498350 event pairs, 53337 based on Foata normal form. 1764/76385 useless extension candidates. Maximal degree in co-relation 148059. Up to 69814 conditions per place. [2024-11-17 03:11:23,082 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 36 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2024-11-17 03:11:23,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 178 flow [2024-11-17 03:11:23,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:11:23,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:11:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-11-17 03:11:23,085 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2024-11-17 03:11:23,085 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 72 transitions. [2024-11-17 03:11:23,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 178 flow [2024-11-17 03:11:23,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:11:23,089 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2024-11-17 03:11:23,089 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-11-17 03:11:23,089 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2024-11-17 03:11:23,090 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2024-11-17 03:11:23,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:11:23,090 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:11:23,090 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:11:23,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 03:11:23,090 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:11:23,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:11:23,092 INFO L85 PathProgramCache]: Analyzing trace with hash -217828609, now seen corresponding path program 1 times [2024-11-17 03:11:23,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:11:23,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871502100] [2024-11-17 03:11:23,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:11:23,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:11:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:11:23,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:11:23,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:11:23,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871502100] [2024-11-17 03:11:23,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871502100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:11:23,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:11:23,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:11:23,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140321302] [2024-11-17 03:11:23,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:11:23,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:11:23,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:11:23,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:11:23,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:11:23,267 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2024-11-17 03:11:23,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:11:23,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:11:23,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2024-11-17 03:11:23,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:11:27,085 INFO L124 PetriNetUnfolderBase]: 42373/60583 cut-off events. [2024-11-17 03:11:27,085 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:11:27,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117639 conditions, 60583 events. 42373/60583 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1878. Compared 412367 event pairs, 5331 based on Foata normal form. 1764/62327 useless extension candidates. Maximal degree in co-relation 117633. Up to 34369 conditions per place. [2024-11-17 03:11:27,382 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 78 selfloop transitions, 6 changer transitions 1/92 dead transitions. [2024-11-17 03:11:27,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 92 transitions, 370 flow [2024-11-17 03:11:27,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:11:27,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:11:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2024-11-17 03:11:27,386 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-11-17 03:11:27,386 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 4 states and 135 transitions. [2024-11-17 03:11:27,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 92 transitions, 370 flow [2024-11-17 03:11:27,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:11:27,391 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 139 flow [2024-11-17 03:11:27,391 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2024-11-17 03:11:27,391 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2024-11-17 03:11:27,392 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 139 flow [2024-11-17 03:11:27,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:11:27,392 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:11:27,392 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:11:27,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 03:11:27,393 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:11:27,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:11:27,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1144707365, now seen corresponding path program 1 times [2024-11-17 03:11:27,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:11:27,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191243563] [2024-11-17 03:11:27,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:11:27,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:11:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:11:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:11:27,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:11:27,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191243563] [2024-11-17 03:11:27,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191243563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:11:27,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:11:27,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:11:27,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556493496] [2024-11-17 03:11:27,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:11:27,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:11:27,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:11:27,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:11:27,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:11:27,632 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2024-11-17 03:11:27,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:11:27,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:11:27,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2024-11-17 03:11:27,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:11:30,657 INFO L124 PetriNetUnfolderBase]: 26373/37703 cut-off events. [2024-11-17 03:11:30,658 INFO L125 PetriNetUnfolderBase]: For 7076/7076 co-relation queries the response was YES. [2024-11-17 03:11:30,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83582 conditions, 37703 events. 26373/37703 cut-off events. For 7076/7076 co-relation queries the response was YES. Maximal size of possible extension queue 944. Compared 236310 event pairs, 3173 based on Foata normal form. 1364/39047 useless extension candidates. Maximal degree in co-relation 83573. Up to 14929 conditions per place. [2024-11-17 03:11:30,785 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 101 selfloop transitions, 10 changer transitions 1/119 dead transitions. [2024-11-17 03:11:30,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 119 transitions, 534 flow [2024-11-17 03:11:30,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:11:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:11:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2024-11-17 03:11:30,787 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6327272727272727 [2024-11-17 03:11:30,787 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 139 flow. Second operand 5 states and 174 transitions. [2024-11-17 03:11:30,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 119 transitions, 534 flow [2024-11-17 03:11:30,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 119 transitions, 523 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-17 03:11:30,802 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 191 flow [2024-11-17 03:11:30,802 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2024-11-17 03:11:30,803 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2024-11-17 03:11:30,804 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 191 flow [2024-11-17 03:11:30,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:11:30,804 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:11:30,804 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:11:30,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 03:11:30,805 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:11:30,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:11:30,805 INFO L85 PathProgramCache]: Analyzing trace with hash 432351945, now seen corresponding path program 1 times [2024-11-17 03:11:30,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:11:30,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873590488] [2024-11-17 03:11:30,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:11:30,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:11:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:11:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:11:31,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:11:31,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873590488] [2024-11-17 03:11:31,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873590488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:11:31,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:11:31,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:11:31,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377241494] [2024-11-17 03:11:31,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:11:31,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:11:31,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:11:31,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:11:31,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:11:31,044 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2024-11-17 03:11:31,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-11-17 03:11:31,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:11:31,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2024-11-17 03:11:31,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:11:32,707 INFO L124 PetriNetUnfolderBase]: 15625/21879 cut-off events. [2024-11-17 03:11:32,708 INFO L125 PetriNetUnfolderBase]: For 13070/13070 co-relation queries the response was YES. [2024-11-17 03:11:32,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53332 conditions, 21879 events. 15625/21879 cut-off events. For 13070/13070 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 120160 event pairs, 2783 based on Foata normal form. 644/22503 useless extension candidates. Maximal degree in co-relation 53321. Up to 6412 conditions per place. [2024-11-17 03:11:32,818 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 122 selfloop transitions, 14 changer transitions 1/144 dead transitions. [2024-11-17 03:11:32,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 144 transitions, 697 flow [2024-11-17 03:11:32,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:11:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:11:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2024-11-17 03:11:32,820 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6393939393939394 [2024-11-17 03:11:32,820 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 191 flow. Second operand 6 states and 211 transitions. [2024-11-17 03:11:32,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 144 transitions, 697 flow [2024-11-17 03:11:32,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 144 transitions, 667 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-17 03:11:32,992 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 241 flow [2024-11-17 03:11:32,992 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2024-11-17 03:11:32,993 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2024-11-17 03:11:32,993 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 241 flow [2024-11-17 03:11:32,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-11-17 03:11:32,994 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:11:32,994 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:11:32,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 03:11:32,994 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:11:32,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:11:32,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1561372700, now seen corresponding path program 1 times [2024-11-17 03:11:32,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:11:32,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855119771] [2024-11-17 03:11:32,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:11:32,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:11:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:11:33,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:11:33,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:11:33,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855119771] [2024-11-17 03:11:33,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855119771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:11:33,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:11:33,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:11:33,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282246599] [2024-11-17 03:11:33,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:11:33,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:11:33,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:11:33,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:11:33,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:11:33,377 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2024-11-17 03:11:33,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 241 flow. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:11:33,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:11:33,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2024-11-17 03:11:33,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:11:34,566 INFO L124 PetriNetUnfolderBase]: 12157/16631 cut-off events. [2024-11-17 03:11:34,566 INFO L125 PetriNetUnfolderBase]: For 12154/12154 co-relation queries the response was YES. [2024-11-17 03:11:34,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42077 conditions, 16631 events. 12157/16631 cut-off events. For 12154/12154 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 86619 event pairs, 2589 based on Foata normal form. 160/16771 useless extension candidates. Maximal degree in co-relation 42065. Up to 6412 conditions per place. [2024-11-17 03:11:34,627 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 105 selfloop transitions, 18 changer transitions 1/131 dead transitions. [2024-11-17 03:11:34,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 131 transitions, 655 flow [2024-11-17 03:11:34,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 03:11:34,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-17 03:11:34,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2024-11-17 03:11:34,629 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-11-17 03:11:34,629 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 241 flow. Second operand 7 states and 210 transitions. [2024-11-17 03:11:34,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 131 transitions, 655 flow [2024-11-17 03:11:34,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 131 transitions, 609 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-17 03:11:34,784 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 251 flow [2024-11-17 03:11:34,784 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=251, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2024-11-17 03:11:34,786 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2024-11-17 03:11:34,786 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 251 flow [2024-11-17 03:11:34,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:11:34,786 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:11:34,786 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-11-17 03:11:34,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 03:11:34,786 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:11:34,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:11:34,787 INFO L85 PathProgramCache]: Analyzing trace with hash -779738091, now seen corresponding path program 1 times [2024-11-17 03:11:34,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:11:34,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73079325] [2024-11-17 03:11:34,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:11:34,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:11:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:11:35,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:11:35,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:11:35,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73079325] [2024-11-17 03:11:35,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73079325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:11:35,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:11:35,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 03:11:35,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219110643] [2024-11-17 03:11:35,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:11:35,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:11:35,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:11:35,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:11:35,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:11:35,185 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2024-11-17 03:11:35,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 251 flow. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:11:35,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:11:35,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2024-11-17 03:11:35,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:11:37,407 INFO L124 PetriNetUnfolderBase]: 23703/32489 cut-off events. [2024-11-17 03:11:37,407 INFO L125 PetriNetUnfolderBase]: For 25142/25142 co-relation queries the response was YES. [2024-11-17 03:11:37,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83476 conditions, 32489 events. 23703/32489 cut-off events. For 25142/25142 co-relation queries the response was YES. Maximal size of possible extension queue 1018. Compared 188032 event pairs, 5025 based on Foata normal form. 32/32518 useless extension candidates. Maximal degree in co-relation 83463. Up to 14117 conditions per place. [2024-11-17 03:11:37,518 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 81 selfloop transitions, 6 changer transitions 74/168 dead transitions. [2024-11-17 03:11:37,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 168 transitions, 1063 flow [2024-11-17 03:11:37,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:11:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-17 03:11:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 235 transitions. [2024-11-17 03:11:37,519 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47474747474747475 [2024-11-17 03:11:37,519 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 251 flow. Second operand 9 states and 235 transitions. [2024-11-17 03:11:37,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 168 transitions, 1063 flow [2024-11-17 03:11:38,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 168 transitions, 781 flow, removed 51 selfloop flow, removed 10 redundant places. [2024-11-17 03:11:38,002 INFO L231 Difference]: Finished difference. Result has 74 places, 59 transitions, 198 flow [2024-11-17 03:11:38,002 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=198, PETRI_PLACES=74, PETRI_TRANSITIONS=59} [2024-11-17 03:11:38,003 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 12 predicate places. [2024-11-17 03:11:38,003 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 59 transitions, 198 flow [2024-11-17 03:11:38,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:11:38,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:11:38,003 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-11-17 03:11:38,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 03:11:38,004 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:11:38,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:11:38,004 INFO L85 PathProgramCache]: Analyzing trace with hash -777689795, now seen corresponding path program 2 times [2024-11-17 03:11:38,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:11:38,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085668899] [2024-11-17 03:11:38,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:11:38,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:11:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:11:38,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:11:38,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:11:38,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085668899] [2024-11-17 03:11:38,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085668899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:11:38,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:11:38,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 03:11:38,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086022624] [2024-11-17 03:11:38,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:11:38,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:11:38,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:11:38,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:11:38,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:11:38,357 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2024-11-17 03:11:38,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 59 transitions, 198 flow. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:11:38,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:11:38,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2024-11-17 03:11:38,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:11:39,746 INFO L124 PetriNetUnfolderBase]: 12577/17397 cut-off events. [2024-11-17 03:11:39,747 INFO L125 PetriNetUnfolderBase]: For 3970/3970 co-relation queries the response was YES. [2024-11-17 03:11:39,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42002 conditions, 17397 events. 12577/17397 cut-off events. For 3970/3970 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 90003 event pairs, 875 based on Foata normal form. 16/17407 useless extension candidates. Maximal degree in co-relation 41987. Up to 9510 conditions per place. [2024-11-17 03:11:39,824 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 83 selfloop transitions, 7 changer transitions 77/174 dead transitions. [2024-11-17 03:11:39,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 174 transitions, 890 flow [2024-11-17 03:11:39,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:11:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-17 03:11:39,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 223 transitions. [2024-11-17 03:11:39,825 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5068181818181818 [2024-11-17 03:11:39,825 INFO L175 Difference]: Start difference. First operand has 74 places, 59 transitions, 198 flow. Second operand 8 states and 223 transitions. [2024-11-17 03:11:39,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 174 transitions, 890 flow [2024-11-17 03:11:39,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 174 transitions, 858 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-11-17 03:11:39,832 INFO L231 Difference]: Finished difference. Result has 76 places, 61 transitions, 229 flow [2024-11-17 03:11:39,833 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=229, PETRI_PLACES=76, PETRI_TRANSITIONS=61} [2024-11-17 03:11:39,833 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 14 predicate places. [2024-11-17 03:11:39,833 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 61 transitions, 229 flow [2024-11-17 03:11:39,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:11:39,833 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:11:39,834 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:11:39,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 03:11:39,834 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:11:39,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:11:39,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1022872243, now seen corresponding path program 3 times [2024-11-17 03:11:39,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:11:39,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234235495] [2024-11-17 03:11:39,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:11:39,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:11:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:11:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:11:40,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:11:40,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234235495] [2024-11-17 03:11:40,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234235495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:11:40,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:11:40,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:11:40,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277526865] [2024-11-17 03:11:40,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:11:40,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:11:40,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:11:40,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:11:40,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:11:40,176 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2024-11-17 03:11:40,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 61 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:11:40,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:11:40,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2024-11-17 03:11:40,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:11:41,278 INFO L124 PetriNetUnfolderBase]: 10799/15207 cut-off events. [2024-11-17 03:11:41,278 INFO L125 PetriNetUnfolderBase]: For 8454/8454 co-relation queries the response was YES. [2024-11-17 03:11:41,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39132 conditions, 15207 events. 10799/15207 cut-off events. For 8454/8454 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 79940 event pairs, 511 based on Foata normal form. 16/15221 useless extension candidates. Maximal degree in co-relation 39115. Up to 8396 conditions per place. [2024-11-17 03:11:41,326 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 93 selfloop transitions, 11 changer transitions 25/136 dead transitions. [2024-11-17 03:11:41,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 136 transitions, 731 flow [2024-11-17 03:11:41,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 03:11:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-17 03:11:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2024-11-17 03:11:41,327 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2024-11-17 03:11:41,327 INFO L175 Difference]: Start difference. First operand has 76 places, 61 transitions, 229 flow. Second operand 7 states and 180 transitions. [2024-11-17 03:11:41,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 136 transitions, 731 flow [2024-11-17 03:11:41,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 136 transitions, 721 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-17 03:11:41,332 INFO L231 Difference]: Finished difference. Result has 79 places, 65 transitions, 301 flow [2024-11-17 03:11:41,332 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=301, PETRI_PLACES=79, PETRI_TRANSITIONS=65} [2024-11-17 03:11:41,333 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 17 predicate places. [2024-11-17 03:11:41,333 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 301 flow [2024-11-17 03:11:41,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:11:41,333 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:11:41,333 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-11-17 03:11:41,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 03:11:41,333 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:11:41,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:11:41,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1805602881, now seen corresponding path program 4 times [2024-11-17 03:11:41,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:11:41,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188460881] [2024-11-17 03:11:41,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:11:41,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:11:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:11:42,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:11:42,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:11:42,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188460881] [2024-11-17 03:11:42,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188460881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:11:42,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:11:42,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 03:11:42,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626003059] [2024-11-17 03:11:42,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:11:42,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 03:11:42,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:11:42,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 03:11:42,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-17 03:11:42,388 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2024-11-17 03:11:42,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 65 transitions, 301 flow. Second operand has 10 states, 10 states have (on average 15.3) internal successors, (153), 10 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:11:42,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:11:42,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2024-11-17 03:11:42,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:11:43,972 INFO L124 PetriNetUnfolderBase]: 14547/20724 cut-off events. [2024-11-17 03:11:43,973 INFO L125 PetriNetUnfolderBase]: For 23463/23463 co-relation queries the response was YES. [2024-11-17 03:11:44,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56140 conditions, 20724 events. 14547/20724 cut-off events. For 23463/23463 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 120206 event pairs, 2591 based on Foata normal form. 16/20739 useless extension candidates. Maximal degree in co-relation 56120. Up to 10821 conditions per place. [2024-11-17 03:11:44,108 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 83 selfloop transitions, 4 changer transitions 77/171 dead transitions. [2024-11-17 03:11:44,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 171 transitions, 1069 flow [2024-11-17 03:11:44,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:11:44,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-17 03:11:44,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2024-11-17 03:11:44,110 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45252525252525255 [2024-11-17 03:11:44,110 INFO L175 Difference]: Start difference. First operand has 79 places, 65 transitions, 301 flow. Second operand 9 states and 224 transitions. [2024-11-17 03:11:44,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 171 transitions, 1069 flow [2024-11-17 03:11:44,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 171 transitions, 1049 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-11-17 03:11:44,122 INFO L231 Difference]: Finished difference. Result has 87 places, 65 transitions, 311 flow [2024-11-17 03:11:44,122 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=311, PETRI_PLACES=87, PETRI_TRANSITIONS=65} [2024-11-17 03:11:44,123 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 25 predicate places. [2024-11-17 03:11:44,123 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 65 transitions, 311 flow [2024-11-17 03:11:44,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.3) internal successors, (153), 10 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:11:44,123 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:11:44,123 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-11-17 03:11:44,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 03:11:44,124 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:11:44,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:11:44,124 INFO L85 PathProgramCache]: Analyzing trace with hash -710773519, now seen corresponding path program 5 times [2024-11-17 03:11:44,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:11:44,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291956187] [2024-11-17 03:11:44,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:11:44,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:11:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:11:44,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:11:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:11:44,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 03:11:44,266 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:11:44,268 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-17 03:11:44,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-17 03:11:44,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-17 03:11:44,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-17 03:11:44,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-17 03:11:44,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-17 03:11:44,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-17 03:11:44,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-17 03:11:44,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 03:11:44,271 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2024-11-17 03:11:44,371 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 03:11:44,371 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:11:44,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:11:44 BasicIcfg [2024-11-17 03:11:44,378 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:11:44,378 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:11:44,379 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:11:44,379 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:11:44,379 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:11:10" (3/4) ... [2024-11-17 03:11:44,381 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 03:11:44,382 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:11:44,383 INFO L158 Benchmark]: Toolchain (without parser) took 35057.72ms. Allocated memory was 159.4MB in the beginning and 13.2GB in the end (delta: 13.0GB). Free memory was 90.8MB in the beginning and 9.7GB in the end (delta: -9.6GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. [2024-11-17 03:11:44,383 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 113.2MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:11:44,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.00ms. Allocated memory is still 159.4MB. Free memory was 90.6MB in the beginning and 123.6MB in the end (delta: -32.9MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2024-11-17 03:11:44,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.01ms. Allocated memory is still 159.4MB. Free memory was 123.6MB in the beginning and 121.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:11:44,383 INFO L158 Benchmark]: Boogie Preprocessor took 45.42ms. Allocated memory is still 159.4MB. Free memory was 121.2MB in the beginning and 117.3MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 03:11:44,383 INFO L158 Benchmark]: IcfgBuilder took 695.29ms. Allocated memory is still 159.4MB. Free memory was 117.3MB in the beginning and 54.4MB in the end (delta: 62.9MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-11-17 03:11:44,384 INFO L158 Benchmark]: TraceAbstraction took 33776.79ms. Allocated memory was 159.4MB in the beginning and 13.2GB in the end (delta: 13.0GB). Free memory was 54.1MB in the beginning and 9.7GB in the end (delta: -9.7GB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. [2024-11-17 03:11:44,384 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 13.2GB. Free memory is still 9.7GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:11:44,385 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.08ms. Allocated memory is still 113.2MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 490.00ms. Allocated memory is still 159.4MB. Free memory was 90.6MB in the beginning and 123.6MB in the end (delta: -32.9MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.01ms. Allocated memory is still 159.4MB. Free memory was 123.6MB in the beginning and 121.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.42ms. Allocated memory is still 159.4MB. Free memory was 121.2MB in the beginning and 117.3MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 695.29ms. Allocated memory is still 159.4MB. Free memory was 117.3MB in the beginning and 54.4MB in the end (delta: 62.9MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * TraceAbstraction took 33776.79ms. Allocated memory was 159.4MB in the beginning and 13.2GB in the end (delta: 13.0GB). Free memory was 54.1MB in the beginning and 9.7GB in the end (delta: -9.7GB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 13.2GB. Free memory is still 9.7GB. 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_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 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; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t353; [L872] FCALL, FORK 0 pthread_create(&t353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t353=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t354; [L874] FCALL, FORK 0 pthread_create(&t354, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t353=-3, t354=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t355; [L876] FCALL, FORK 0 pthread_create(&t355, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t353=-3, t354=-2, t355=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t356; [L878] FCALL, FORK 0 pthread_create(&t356, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t353=-3, t354=-2, t355=-1, t356=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L790] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L807] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L793] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L794] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L795] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L796] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L797] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L810] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L827] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L777] 1 __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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t353=-3, t354=-2, t355=-1, t356=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t353=-3, t354=-2, t355=-1, t356=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t353=-3, t354=-2, t355=-1, t356=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix014_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - 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: 33.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 29.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 979 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 970 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2360 IncrementalHoareTripleChecker+Invalid, 2413 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 1 mSDtfsCounter, 2360 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=311occurred in iteration=10, InterpolantAutomatonStates: 61, 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.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 1749 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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-11-17 03:11:44,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 a75df8feda97f2ebeb5cc4266066f8deba1b6726a771b6143f22a640cfcf63d2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:11:46,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:11:46,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 03:11:46,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:11:46,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:11:46,948 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:11:46,949 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:11:46,949 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:11:46,950 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:11:46,951 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:11:46,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:11:46,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:11:46,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:11:46,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:11:46,954 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:11:46,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:11:46,955 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:11:46,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:11:46,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:11:46,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:11:46,956 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:11:46,957 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:11:46,957 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:11:46,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:11:46,958 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:11:46,958 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 03:11:46,958 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:11:46,958 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 03:11:46,958 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:11:46,959 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:11:46,959 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:11:46,959 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:11:46,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:11:46,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:11:46,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:11:46,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:11:46,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:11:46,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:11:46,961 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 03:11:46,961 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 03:11:46,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:11:46,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:11:46,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:11:46,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:11:46,963 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/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/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 -> a75df8feda97f2ebeb5cc4266066f8deba1b6726a771b6143f22a640cfcf63d2 [2024-11-17 03:11:47,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:11:47,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:11:47,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:11:47,249 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:11:47,249 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:11:47,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i [2024-11-17 03:11:48,564 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:11:48,781 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:11:48,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i [2024-11-17 03:11:48,793 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcf216c9d/7f4f030cc55042f5bfb6656926b152f2/FLAGa18934e96 [2024-11-17 03:11:49,129 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcf216c9d/7f4f030cc55042f5bfb6656926b152f2 [2024-11-17 03:11:49,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:11:49,133 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:11:49,134 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:11:49,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:11:49,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:11:49,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:11:49" (1/1) ... [2024-11-17 03:11:49,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@163910ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:49, skipping insertion in model container [2024-11-17 03:11:49,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:11:49" (1/1) ... [2024-11-17 03:11:49,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:11:49,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:11:49,536 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:11:49,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:11:49,635 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:11:49,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:49 WrapperNode [2024-11-17 03:11:49,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:11:49,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:11:49,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:11:49,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:11:49,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:49" (1/1) ... [2024-11-17 03:11:49,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:49" (1/1) ... [2024-11-17 03:11:49,696 INFO L138 Inliner]: procedures = 177, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2024-11-17 03:11:49,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:11:49,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:11:49,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:11:49,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:11:49,711 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:49" (1/1) ... [2024-11-17 03:11:49,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:49" (1/1) ... [2024-11-17 03:11:49,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:49" (1/1) ... [2024-11-17 03:11:49,736 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-17 03:11:49,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:49" (1/1) ... [2024-11-17 03:11:49,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:49" (1/1) ... [2024-11-17 03:11:49,743 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:49" (1/1) ... [2024-11-17 03:11:49,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:49" (1/1) ... [2024-11-17 03:11:49,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:49" (1/1) ... [2024-11-17 03:11:49,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:49" (1/1) ... [2024-11-17 03:11:49,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:11:49,752 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:11:49,752 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:11:49,752 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:11:49,752 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:49" (1/1) ... [2024-11-17 03:11:49,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:11:49,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:11:49,783 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 03:11:49,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 03:11:49,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-17 03:11:49,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:11:49,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 03:11:49,822 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-17 03:11:49,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-17 03:11:49,822 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-17 03:11:49,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-17 03:11:49,822 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-17 03:11:49,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-17 03:11:49,822 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-17 03:11:49,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-17 03:11:49,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-17 03:11:49,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:11:49,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:11:49,824 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:11:49,997 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:11:49,999 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:11:50,323 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:11:50,323 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:11:50,541 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:11:50,541 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:11:50,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:11:50 BoogieIcfgContainer [2024-11-17 03:11:50,542 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:11:50,544 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:11:50,544 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:11:50,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:11:50,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:11:49" (1/3) ... [2024-11-17 03:11:50,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57802aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:11:50, skipping insertion in model container [2024-11-17 03:11:50,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:11:49" (2/3) ... [2024-11-17 03:11:50,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57802aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:11:50, skipping insertion in model container [2024-11-17 03:11:50,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:11:50" (3/3) ... [2024-11-17 03:11:50,563 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014_power.oepc_pso.oepc_rmo.oepc.i [2024-11-17 03:11:50,577 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:11:50,577 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-17 03:11:50,577 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:11:50,629 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-17 03:11:50,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2024-11-17 03:11:50,690 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2024-11-17 03:11:50,690 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:11:50,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 105 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-11-17 03:11:50,695 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2024-11-17 03:11:50,699 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2024-11-17 03:11:50,708 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:11:50,715 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;@4541bcb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:11:50,716 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-17 03:11:50,719 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:11:50,719 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-17 03:11:50,719 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:11:50,719 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:11:50,719 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-17 03:11:50,720 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:11:50,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:11:50,724 INFO L85 PathProgramCache]: Analyzing trace with hash 14080174, now seen corresponding path program 1 times [2024-11-17 03:11:50,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:11:50,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33023916] [2024-11-17 03:11:50,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:11:50,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:11:50,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:11:50,738 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:11:50,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 03:11:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:11:50,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:11:50,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:11:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:11:50,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:11:50,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:11:50,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33023916] [2024-11-17 03:11:50,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33023916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:11:50,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:11:50,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:11:50,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203239203] [2024-11-17 03:11:50,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:11:50,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:11:50,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:11:50,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:11:50,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:11:50,886 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2024-11-17 03:11:50,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:11:50,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:11:50,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2024-11-17 03:11:50,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:11:56,575 INFO L124 PetriNetUnfolderBase]: 59301/78646 cut-off events. [2024-11-17 03:11:56,576 INFO L125 PetriNetUnfolderBase]: For 291/291 co-relation queries the response was YES. [2024-11-17 03:11:56,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156796 conditions, 78646 events. 59301/78646 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 2205. Compared 486941 event pairs, 7351 based on Foata normal form. 3528/82126 useless extension candidates. Maximal degree in co-relation 156784. Up to 67151 conditions per place. [2024-11-17 03:11:57,027 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 67 selfloop transitions, 2 changer transitions 2/79 dead transitions. [2024-11-17 03:11:57,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 79 transitions, 321 flow [2024-11-17 03:11:57,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:11:57,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:11:57,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-11-17 03:11:57,039 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6787878787878788 [2024-11-17 03:11:57,040 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 112 transitions. [2024-11-17 03:11:57,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 79 transitions, 321 flow [2024-11-17 03:11:57,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 79 transitions, 314 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:11:57,050 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2024-11-17 03:11:57,052 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-11-17 03:11:57,055 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-11-17 03:11:57,056 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2024-11-17 03:11:57,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:11:57,057 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:11:57,057 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:11:57,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-17 03:11:57,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:11:57,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:11:57,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:11:57,261 INFO L85 PathProgramCache]: Analyzing trace with hash 861023920, now seen corresponding path program 1 times [2024-11-17 03:11:57,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:11:57,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963305964] [2024-11-17 03:11:57,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:11:57,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:11:57,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:11:57,265 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:11:57,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-17 03:11:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:11:57,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:11:57,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:11:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:11:57,521 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:11:57,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:11:57,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963305964] [2024-11-17 03:11:57,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963305964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:11:57,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:11:57,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:11:57,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406993427] [2024-11-17 03:11:57,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:11:57,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:11:57,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:11:57,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:11:57,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:11:57,525 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2024-11-17 03:11:57,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:11:57,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:11:57,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2024-11-17 03:11:57,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:01,859 INFO L124 PetriNetUnfolderBase]: 46737/67675 cut-off events. [2024-11-17 03:12:01,859 INFO L125 PetriNetUnfolderBase]: For 2340/2340 co-relation queries the response was YES. [2024-11-17 03:12:02,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132799 conditions, 67675 events. 46737/67675 cut-off events. For 2340/2340 co-relation queries the response was YES. Maximal size of possible extension queue 2063. Compared 477243 event pairs, 5331 based on Foata normal form. 1764/69419 useless extension candidates. Maximal degree in co-relation 132789. Up to 40097 conditions per place. [2024-11-17 03:12:02,204 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 79 selfloop transitions, 6 changer transitions 1/94 dead transitions. [2024-11-17 03:12:02,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 94 transitions, 382 flow [2024-11-17 03:12:02,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:12:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:12:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2024-11-17 03:12:02,206 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2024-11-17 03:12:02,206 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 4 states and 136 transitions. [2024-11-17 03:12:02,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 94 transitions, 382 flow [2024-11-17 03:12:02,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 94 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:12:02,209 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 142 flow [2024-11-17 03:12:02,210 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-11-17 03:12:02,210 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -2 predicate places. [2024-11-17 03:12:02,210 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 142 flow [2024-11-17 03:12:02,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:02,211 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:02,211 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:12:02,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-17 03:12:02,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:02,412 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:02,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:02,413 INFO L85 PathProgramCache]: Analyzing trace with hash 369932106, now seen corresponding path program 1 times [2024-11-17 03:12:02,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:12:02,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349649647] [2024-11-17 03:12:02,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:02,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:02,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:12:02,415 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:12:02,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 03:12:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:02,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 03:12:02,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:12:02,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:12:02,537 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:12:02,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:12:02,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349649647] [2024-11-17 03:12:02,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349649647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:02,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:02,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:12:02,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143226437] [2024-11-17 03:12:02,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:02,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:12:02,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:12:02,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:12:02,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:12:02,540 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2024-11-17 03:12:02,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:02,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:02,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2024-11-17 03:12:02,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:05,238 INFO L124 PetriNetUnfolderBase]: 28217/40835 cut-off events. [2024-11-17 03:12:05,238 INFO L125 PetriNetUnfolderBase]: For 7324/7324 co-relation queries the response was YES. [2024-11-17 03:12:05,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89449 conditions, 40835 events. 28217/40835 cut-off events. For 7324/7324 co-relation queries the response was YES. Maximal size of possible extension queue 992. Compared 264186 event pairs, 3173 based on Foata normal form. 1364/42179 useless extension candidates. Maximal degree in co-relation 89437. Up to 17417 conditions per place. [2024-11-17 03:12:05,438 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 102 selfloop transitions, 10 changer transitions 1/121 dead transitions. [2024-11-17 03:12:05,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 121 transitions, 539 flow [2024-11-17 03:12:05,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:12:05,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:12:05,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2024-11-17 03:12:05,441 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-11-17 03:12:05,441 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 142 flow. Second operand 5 states and 175 transitions. [2024-11-17 03:12:05,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 121 transitions, 539 flow [2024-11-17 03:12:05,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 121 transitions, 528 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-17 03:12:05,462 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 194 flow [2024-11-17 03:12:05,463 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-11-17 03:12:05,465 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2024-11-17 03:12:05,465 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 194 flow [2024-11-17 03:12:05,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:05,465 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:05,466 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:12:05,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-11-17 03:12:05,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:05,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:05,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:05,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2133355834, now seen corresponding path program 1 times [2024-11-17 03:12:05,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:12:05,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951621783] [2024-11-17 03:12:05,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:05,672 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:05,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:12:05,674 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:12:05,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 03:12:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:05,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:12:05,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:12:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:12:05,802 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:12:05,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:12:05,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951621783] [2024-11-17 03:12:05,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951621783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:05,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:05,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:12:05,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58458596] [2024-11-17 03:12:05,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:05,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:12:05,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:12:05,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:12:05,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:12:05,804 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2024-11-17 03:12:05,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-11-17 03:12:05,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:05,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2024-11-17 03:12:05,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:07,645 INFO L124 PetriNetUnfolderBase]: 16017/22591 cut-off events. [2024-11-17 03:12:07,646 INFO L125 PetriNetUnfolderBase]: For 13166/13166 co-relation queries the response was YES. [2024-11-17 03:12:07,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54659 conditions, 22591 events. 16017/22591 cut-off events. For 13166/13166 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 125714 event pairs, 2783 based on Foata normal form. 644/23215 useless extension candidates. Maximal degree in co-relation 54645. Up to 6412 conditions per place. [2024-11-17 03:12:07,725 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 123 selfloop transitions, 14 changer transitions 1/146 dead transitions. [2024-11-17 03:12:07,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 146 transitions, 702 flow [2024-11-17 03:12:07,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:12:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:12:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2024-11-17 03:12:07,727 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2024-11-17 03:12:07,727 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 194 flow. Second operand 6 states and 212 transitions. [2024-11-17 03:12:07,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 146 transitions, 702 flow [2024-11-17 03:12:07,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 146 transitions, 672 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-17 03:12:07,847 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 244 flow [2024-11-17 03:12:07,847 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-11-17 03:12:07,848 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2024-11-17 03:12:07,848 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 244 flow [2024-11-17 03:12:07,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-11-17 03:12:07,848 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:07,848 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:12:07,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-17 03:12:08,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:08,052 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:08,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:08,052 INFO L85 PathProgramCache]: Analyzing trace with hash 770744781, now seen corresponding path program 1 times [2024-11-17 03:12:08,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:12:08,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760882686] [2024-11-17 03:12:08,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:08,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:08,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:12:08,056 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:12:08,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-17 03:12:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:08,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 03:12:08,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:12:08,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:12:08,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:12:08,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:12:08,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760882686] [2024-11-17 03:12:08,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760882686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:08,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:08,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:12:08,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317041249] [2024-11-17 03:12:08,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:08,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:12:08,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:12:08,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:12:08,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:12:08,185 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2024-11-17 03:12:08,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 244 flow. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:08,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:08,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2024-11-17 03:12:08,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:09,406 INFO L124 PetriNetUnfolderBase]: 12189/16695 cut-off events. [2024-11-17 03:12:09,406 INFO L125 PetriNetUnfolderBase]: For 12154/12154 co-relation queries the response was YES. [2024-11-17 03:12:09,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42188 conditions, 16695 events. 12189/16695 cut-off events. For 12154/12154 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 86906 event pairs, 2589 based on Foata normal form. 160/16835 useless extension candidates. Maximal degree in co-relation 42173. Up to 6412 conditions per place. [2024-11-17 03:12:09,478 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 106 selfloop transitions, 18 changer transitions 1/133 dead transitions. [2024-11-17 03:12:09,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 133 transitions, 660 flow [2024-11-17 03:12:09,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 03:12:09,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-17 03:12:09,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions. [2024-11-17 03:12:09,480 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.548051948051948 [2024-11-17 03:12:09,480 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 244 flow. Second operand 7 states and 211 transitions. [2024-11-17 03:12:09,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 133 transitions, 660 flow [2024-11-17 03:12:09,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 133 transitions, 614 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-17 03:12:09,666 INFO L231 Difference]: Finished difference. Result has 70 places, 58 transitions, 254 flow [2024-11-17 03:12:09,666 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-11-17 03:12:09,667 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2024-11-17 03:12:09,667 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 58 transitions, 254 flow [2024-11-17 03:12:09,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:09,667 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:09,667 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-11-17 03:12:09,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-17 03:12:09,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:09,870 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:09,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:09,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1322018054, now seen corresponding path program 1 times [2024-11-17 03:12:09,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:12:09,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930066894] [2024-11-17 03:12:09,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:09,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:09,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:12:09,873 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:12:09,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-17 03:12:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:09,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 03:12:09,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:12:09,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:12:09,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:12:09,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:12:09,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930066894] [2024-11-17 03:12:09,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930066894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:09,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:09,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:12:09,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252229629] [2024-11-17 03:12:09,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:09,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:12:09,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:12:09,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:12:09,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:12:09,998 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2024-11-17 03:12:09,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:09,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:09,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2024-11-17 03:12:09,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:10,790 INFO L124 PetriNetUnfolderBase]: 11813/16151 cut-off events. [2024-11-17 03:12:10,790 INFO L125 PetriNetUnfolderBase]: For 10994/10994 co-relation queries the response was YES. [2024-11-17 03:12:10,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40413 conditions, 16151 events. 11813/16151 cut-off events. For 10994/10994 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 82645 event pairs, 10921 based on Foata normal form. 16/16137 useless extension candidates. Maximal degree in co-relation 40397. Up to 16054 conditions per place. [2024-11-17 03:12:10,882 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 48 selfloop transitions, 1 changer transitions 1/57 dead transitions. [2024-11-17 03:12:10,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 57 transitions, 352 flow [2024-11-17 03:12:10,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:12:10,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:12:10,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-11-17 03:12:10,884 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2024-11-17 03:12:10,884 INFO L175 Difference]: Start difference. First operand has 70 places, 58 transitions, 254 flow. Second operand 3 states and 72 transitions. [2024-11-17 03:12:10,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 57 transitions, 352 flow [2024-11-17 03:12:11,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 57 transitions, 256 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-11-17 03:12:11,141 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 156 flow [2024-11-17 03:12:11,141 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-11-17 03:12:11,141 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2024-11-17 03:12:11,141 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 156 flow [2024-11-17 03:12:11,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:11,142 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:11,142 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-11-17 03:12:11,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-17 03:12:11,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:11,343 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:11,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:11,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1387036749, now seen corresponding path program 1 times [2024-11-17 03:12:11,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:12:11,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907731302] [2024-11-17 03:12:11,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:12:11,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:11,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:12:11,345 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:12:11,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-17 03:12:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:12:11,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:12:11,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:12:11,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:12:11,468 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:12:11,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:12:11,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907731302] [2024-11-17 03:12:11,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907731302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:11,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:11,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:12:11,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849956535] [2024-11-17 03:12:11,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:11,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:12:11,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:12:11,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:12:11,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:12:11,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2024-11-17 03:12:11,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:11,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:11,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2024-11-17 03:12:11,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:13,072 INFO L124 PetriNetUnfolderBase]: 18305/25077 cut-off events. [2024-11-17 03:12:13,073 INFO L125 PetriNetUnfolderBase]: For 2130/2130 co-relation queries the response was YES. [2024-11-17 03:12:13,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55086 conditions, 25077 events. 18305/25077 cut-off events. For 2130/2130 co-relation queries the response was YES. Maximal size of possible extension queue 808. Compared 141152 event pairs, 8569 based on Foata normal form. 16/25066 useless extension candidates. Maximal degree in co-relation 55079. Up to 14179 conditions per place. [2024-11-17 03:12:13,184 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 74 selfloop transitions, 2 changer transitions 25/108 dead transitions. [2024-11-17 03:12:13,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 108 transitions, 501 flow [2024-11-17 03:12:13,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:12:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:12:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-11-17 03:12:13,185 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5018181818181818 [2024-11-17 03:12:13,185 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 156 flow. Second operand 5 states and 138 transitions. [2024-11-17 03:12:13,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 108 transitions, 501 flow [2024-11-17 03:12:13,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 108 transitions, 500 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:12:13,188 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 167 flow [2024-11-17 03:12:13,188 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2024-11-17 03:12:13,188 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2024-11-17 03:12:13,188 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 167 flow [2024-11-17 03:12:13,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:13,189 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:13,189 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-11-17 03:12:13,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-17 03:12:13,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:13,390 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:13,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:13,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1969447499, now seen corresponding path program 2 times [2024-11-17 03:12:13,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:12:13,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460436591] [2024-11-17 03:12:13,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 03:12:13,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:13,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:12:13,392 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:12:13,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-17 03:12:13,473 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 03:12:13,474 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:12:13,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 03:12:13,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:12:13,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:12:13,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:12:13,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:12:13,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460436591] [2024-11-17 03:12:13,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [460436591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:13,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:13,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:12:13,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309487139] [2024-11-17 03:12:13,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:13,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:12:13,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:12:13,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:12:13,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:12:13,537 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2024-11-17 03:12:13,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:13,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:13,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2024-11-17 03:12:13,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:14,549 INFO L124 PetriNetUnfolderBase]: 11613/16100 cut-off events. [2024-11-17 03:12:14,549 INFO L125 PetriNetUnfolderBase]: For 2309/2309 co-relation queries the response was YES. [2024-11-17 03:12:14,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36664 conditions, 16100 events. 11613/16100 cut-off events. For 2309/2309 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 83198 event pairs, 1207 based on Foata normal form. 16/16109 useless extension candidates. Maximal degree in co-relation 36654. Up to 9278 conditions per place. [2024-11-17 03:12:14,621 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 69 selfloop transitions, 1 changer transitions 49/126 dead transitions. [2024-11-17 03:12:14,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 126 transitions, 610 flow [2024-11-17 03:12:14,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:12:14,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:12:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2024-11-17 03:12:14,623 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2024-11-17 03:12:14,623 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 167 flow. Second operand 6 states and 162 transitions. [2024-11-17 03:12:14,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 126 transitions, 610 flow [2024-11-17 03:12:14,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 126 transitions, 592 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-17 03:12:14,627 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 168 flow [2024-11-17 03:12:14,627 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=60, 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=168, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2024-11-17 03:12:14,627 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2024-11-17 03:12:14,627 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 168 flow [2024-11-17 03:12:14,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:14,628 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:14,628 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-11-17 03:12:14,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-17 03:12:14,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:14,829 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:14,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:14,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1261012817, now seen corresponding path program 3 times [2024-11-17 03:12:14,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:12:14,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138151001] [2024-11-17 03:12:14,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 03:12:14,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:14,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:12:14,834 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:12:14,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-17 03:12:14,909 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-17 03:12:14,910 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:12:14,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 03:12:14,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:12:15,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:12:15,271 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:12:15,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:12:15,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138151001] [2024-11-17 03:12:15,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138151001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:15,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:15,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 03:12:15,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585086234] [2024-11-17 03:12:15,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:15,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 03:12:15,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:12:15,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 03:12:15,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-17 03:12:15,279 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2024-11-17 03:12:15,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 168 flow. Second operand has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:15,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:15,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2024-11-17 03:12:15,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:16,529 INFO L124 PetriNetUnfolderBase]: 12418/17480 cut-off events. [2024-11-17 03:12:16,530 INFO L125 PetriNetUnfolderBase]: For 4408/4408 co-relation queries the response was YES. [2024-11-17 03:12:16,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39816 conditions, 17480 events. 12418/17480 cut-off events. For 4408/4408 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 97784 event pairs, 2354 based on Foata normal form. 16/17494 useless extension candidates. Maximal degree in co-relation 39805. Up to 5735 conditions per place. [2024-11-17 03:12:16,630 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 92 selfloop transitions, 5 changer transitions 77/181 dead transitions. [2024-11-17 03:12:16,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 181 transitions, 893 flow [2024-11-17 03:12:16,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:12:16,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-17 03:12:16,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 240 transitions. [2024-11-17 03:12:16,632 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-11-17 03:12:16,632 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 168 flow. Second operand 9 states and 240 transitions. [2024-11-17 03:12:16,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 181 transitions, 893 flow [2024-11-17 03:12:16,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 181 transitions, 879 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-17 03:12:16,637 INFO L231 Difference]: Finished difference. Result has 75 places, 58 transitions, 190 flow [2024-11-17 03:12:16,638 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=190, PETRI_PLACES=75, PETRI_TRANSITIONS=58} [2024-11-17 03:12:16,638 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 13 predicate places. [2024-11-17 03:12:16,638 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 58 transitions, 190 flow [2024-11-17 03:12:16,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:16,639 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:16,639 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-11-17 03:12:16,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-17 03:12:16,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:16,843 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:16,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:16,843 INFO L85 PathProgramCache]: Analyzing trace with hash 187943057, now seen corresponding path program 4 times [2024-11-17 03:12:16,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:12:16,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664937496] [2024-11-17 03:12:16,844 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 03:12:16,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:16,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:12:16,845 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:12:16,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-17 03:12:16,913 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 03:12:16,914 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:12:16,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-17 03:12:16,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:12:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:12:17,210 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:12:17,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:12:17,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664937496] [2024-11-17 03:12:17,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664937496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:17,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:17,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 03:12:17,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118251873] [2024-11-17 03:12:17,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:17,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 03:12:17,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:12:17,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 03:12:17,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-17 03:12:17,225 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2024-11-17 03:12:17,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 58 transitions, 190 flow. Second operand has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:17,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:17,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2024-11-17 03:12:17,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:18,394 INFO L124 PetriNetUnfolderBase]: 9220/12994 cut-off events. [2024-11-17 03:12:18,394 INFO L125 PetriNetUnfolderBase]: For 4270/4270 co-relation queries the response was YES. [2024-11-17 03:12:18,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32145 conditions, 12994 events. 9220/12994 cut-off events. For 4270/4270 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 67609 event pairs, 1520 based on Foata normal form. 16/13008 useless extension candidates. Maximal degree in co-relation 32131. Up to 8094 conditions per place. [2024-11-17 03:12:18,449 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 96 selfloop transitions, 8 changer transitions 49/160 dead transitions. [2024-11-17 03:12:18,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 160 transitions, 802 flow [2024-11-17 03:12:18,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:12:18,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-17 03:12:18,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions. [2024-11-17 03:12:18,451 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49772727272727274 [2024-11-17 03:12:18,451 INFO L175 Difference]: Start difference. First operand has 75 places, 58 transitions, 190 flow. Second operand 8 states and 219 transitions. [2024-11-17 03:12:18,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 160 transitions, 802 flow [2024-11-17 03:12:18,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 160 transitions, 786 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-17 03:12:18,455 INFO L231 Difference]: Finished difference. Result has 78 places, 63 transitions, 238 flow [2024-11-17 03:12:18,456 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=238, PETRI_PLACES=78, PETRI_TRANSITIONS=63} [2024-11-17 03:12:18,458 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 16 predicate places. [2024-11-17 03:12:18,458 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 63 transitions, 238 flow [2024-11-17 03:12:18,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:18,458 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:18,458 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-11-17 03:12:18,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-11-17 03:12:18,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:18,661 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:18,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:18,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1842406455, now seen corresponding path program 5 times [2024-11-17 03:12:18,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:12:18,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933762218] [2024-11-17 03:12:18,662 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 03:12:18,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:18,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:12:18,663 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:12:18,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-17 03:12:18,734 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 03:12:18,734 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:12:18,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 03:12:18,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:12:18,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:12:18,782 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:12:18,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:12:18,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1933762218] [2024-11-17 03:12:18,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1933762218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:12:18,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:12:18,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:12:18,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159873109] [2024-11-17 03:12:18,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:12:18,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:12:18,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:12:18,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:12:18,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:12:18,788 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2024-11-17 03:12:18,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 63 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:18,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:12:18,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2024-11-17 03:12:18,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:12:19,965 INFO L124 PetriNetUnfolderBase]: 11396/16119 cut-off events. [2024-11-17 03:12:19,965 INFO L125 PetriNetUnfolderBase]: For 13676/13676 co-relation queries the response was YES. [2024-11-17 03:12:20,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42855 conditions, 16119 events. 11396/16119 cut-off events. For 13676/13676 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 87074 event pairs, 2102 based on Foata normal form. 16/16126 useless extension candidates. Maximal degree in co-relation 42840. Up to 8130 conditions per place. [2024-11-17 03:12:20,075 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 64 selfloop transitions, 1 changer transitions 70/142 dead transitions. [2024-11-17 03:12:20,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 142 transitions, 827 flow [2024-11-17 03:12:20,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:12:20,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:12:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2024-11-17 03:12:20,076 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4818181818181818 [2024-11-17 03:12:20,077 INFO L175 Difference]: Start difference. First operand has 78 places, 63 transitions, 238 flow. Second operand 6 states and 159 transitions. [2024-11-17 03:12:20,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 142 transitions, 827 flow [2024-11-17 03:12:20,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 142 transitions, 810 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-17 03:12:20,087 INFO L231 Difference]: Finished difference. Result has 80 places, 61 transitions, 225 flow [2024-11-17 03:12:20,087 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=225, PETRI_PLACES=80, PETRI_TRANSITIONS=61} [2024-11-17 03:12:20,087 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 18 predicate places. [2024-11-17 03:12:20,087 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 61 transitions, 225 flow [2024-11-17 03:12:20,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:12:20,088 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:12:20,088 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-11-17 03:12:20,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-17 03:12:20,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:20,288 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-17 03:12:20,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:12:20,289 INFO L85 PathProgramCache]: Analyzing trace with hash -243739323, now seen corresponding path program 6 times [2024-11-17 03:12:20,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:12:20,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228525718] [2024-11-17 03:12:20,289 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-17 03:12:20,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:20,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:12:20,291 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 03:12:20,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (13)] Waiting until timeout for monitored process [2024-11-17 03:12:20,366 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-17 03:12:20,366 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-17 03:12:20,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:12:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:12:20,463 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-17 03:12:20,463 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:12:20,464 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-17 03:12:20,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-17 03:12:20,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-17 03:12:20,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-17 03:12:20,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-17 03:12:20,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-17 03:12:20,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-17 03:12:20,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-17 03:12:20,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (13)] Ended with exit code 0 [2024-11-17 03:12:20,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:12:20,667 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2024-11-17 03:12:20,767 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 03:12:20,768 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:12:20,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:12:20 BasicIcfg [2024-11-17 03:12:20,772 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:12:20,772 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:12:20,773 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:12:20,773 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:12:20,773 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:11:50" (3/4) ... [2024-11-17 03:12:20,775 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 03:12:20,776 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:12:20,776 INFO L158 Benchmark]: Toolchain (without parser) took 31643.38ms. Allocated memory was 65.0MB in the beginning and 12.2GB in the end (delta: 12.1GB). Free memory was 40.3MB in the beginning and 8.0GB in the end (delta: -7.9GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. [2024-11-17 03:12:20,776 INFO L158 Benchmark]: CDTParser took 1.34ms. Allocated memory is still 65.0MB. Free memory was 41.0MB in the beginning and 40.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:12:20,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.44ms. Allocated memory was 65.0MB in the beginning and 83.9MB in the end (delta: 18.9MB). Free memory was 40.1MB in the beginning and 49.1MB in the end (delta: -9.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-17 03:12:20,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.96ms. Allocated memory is still 83.9MB. Free memory was 48.7MB in the beginning and 46.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:12:20,778 INFO L158 Benchmark]: Boogie Preprocessor took 50.14ms. Allocated memory is still 83.9MB. Free memory was 46.2MB in the beginning and 42.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 03:12:20,778 INFO L158 Benchmark]: IcfgBuilder took 790.24ms. Allocated memory is still 83.9MB. Free memory was 42.5MB in the beginning and 22.6MB in the end (delta: 19.9MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2024-11-17 03:12:20,779 INFO L158 Benchmark]: TraceAbstraction took 30228.36ms. Allocated memory was 83.9MB in the beginning and 12.2GB in the end (delta: 12.1GB). Free memory was 21.9MB in the beginning and 8.0GB in the end (delta: -8.0GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. [2024-11-17 03:12:20,779 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 12.2GB. Free memory is still 8.0GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:12:20,780 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.34ms. Allocated memory is still 65.0MB. Free memory was 41.0MB in the beginning and 40.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 502.44ms. Allocated memory was 65.0MB in the beginning and 83.9MB in the end (delta: 18.9MB). Free memory was 40.1MB in the beginning and 49.1MB in the end (delta: -9.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.96ms. Allocated memory is still 83.9MB. Free memory was 48.7MB in the beginning and 46.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.14ms. Allocated memory is still 83.9MB. Free memory was 46.2MB in the beginning and 42.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 790.24ms. Allocated memory is still 83.9MB. Free memory was 42.5MB in the beginning and 22.6MB in the end (delta: 19.9MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * TraceAbstraction took 30228.36ms. Allocated memory was 83.9MB in the beginning and 12.2GB in the end (delta: 12.1GB). Free memory was 21.9MB in the beginning and 8.0GB in the end (delta: -8.0GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 12.2GB. Free memory is still 8.0GB. 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_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 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; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t353; [L872] FCALL, FORK 0 pthread_create(&t353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t353=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t354; [L874] FCALL, FORK 0 pthread_create(&t354, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t353=0, t354=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t355; [L767] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L876] FCALL, FORK 0 pthread_create(&t355, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t353=0, t354=1, t355=2, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L877] 0 pthread_t t356; [L784] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L878] FCALL, FORK 0 pthread_create(&t356, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t353=0, t354=1, t355=2, t356=3, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L790] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L807] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L810] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L793] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L794] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L795] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L796] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L797] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L827] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t353=0, t354=1, t355=2, t356=3, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t353=0, t354=1, t355=2, t356=3, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t353=0, t354=1, t355=2, t356=3, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix014_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 89 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 30.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 25.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 916 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 906 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3286 IncrementalHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 6 mSDtfsCounter, 3286 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 354 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=5, InterpolantAutomatonStates: 62, 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, 1.2s InterpolantComputationTime, 376 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 326 ConstructedInterpolants, 0 QuantifiedInterpolants, 1347 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1444 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-17 03:12:20,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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