./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 17:30:16,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:30:16,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 17:30:16,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:30:16,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:30:16,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:30:16,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:30:16,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:30:16,755 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:30:16,756 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:30:16,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:30:16,757 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:30:16,758 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:30:16,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:30:16,760 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:30:16,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:30:16,761 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:30:16,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:30:16,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:30:16,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:30:16,762 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:30:16,763 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:30:16,766 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:30:16,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:30:16,767 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:30:16,767 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:30:16,767 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:30:16,768 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:30:16,768 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:30:16,768 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:30:16,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:30:16,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:30:16,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:30:16,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:30:16,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:30:16,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:30:16,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 17:30:16,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 17:30:16,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:30:16,771 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:30:16,771 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:30:16,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:30:16,773 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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2024-11-20 17:30:17,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:30:17,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:30:17,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:30:17,073 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:30:17,074 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:30:17,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-20 17:30:18,525 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:30:18,839 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:30:18,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-20 17:30:18,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8418b4162/31965aba2429429682b57bdaa4d4aa04/FLAG87a43c9c1 [2024-11-20 17:30:18,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8418b4162/31965aba2429429682b57bdaa4d4aa04 [2024-11-20 17:30:18,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:30:18,885 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:30:18,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:30:18,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:30:18,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:30:18,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:30:18" (1/1) ... [2024-11-20 17:30:18,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4476624b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:18, skipping insertion in model container [2024-11-20 17:30:18,897 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:30:18" (1/1) ... [2024-11-20 17:30:18,949 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:30:19,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:30:19,438 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:30:19,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:30:19,548 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:30:19,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:19 WrapperNode [2024-11-20 17:30:19,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:30:19,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:30:19,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:30:19,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:30:19,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:19" (1/1) ... [2024-11-20 17:30:19,577 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:19" (1/1) ... [2024-11-20 17:30:19,611 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-11-20 17:30:19,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:30:19,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:30:19,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:30:19,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:30:19,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:19" (1/1) ... [2024-11-20 17:30:19,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:19" (1/1) ... [2024-11-20 17:30:19,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:19" (1/1) ... [2024-11-20 17:30:19,664 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-20 17:30:19,665 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:19" (1/1) ... [2024-11-20 17:30:19,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:19" (1/1) ... [2024-11-20 17:30:19,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:19" (1/1) ... [2024-11-20 17:30:19,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:19" (1/1) ... [2024-11-20 17:30:19,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:19" (1/1) ... [2024-11-20 17:30:19,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:19" (1/1) ... [2024-11-20 17:30:19,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:30:19,702 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:30:19,702 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:30:19,702 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:30:19,703 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:19" (1/1) ... [2024-11-20 17:30:19,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:30:19,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:30:19,740 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-20 17:30:19,747 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-20 17:30:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-20 17:30:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:30:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-20 17:30:19,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-20 17:30:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-20 17:30:19,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-20 17:30:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-20 17:30:19,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-20 17:30:19,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 17:30:19,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-20 17:30:19,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:30:19,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:30:19,796 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 17:30:19,926 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:30:19,927 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:30:20,354 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 17:30:20,354 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:30:20,607 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:30:20,608 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 17:30:20,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:30:20 BoogieIcfgContainer [2024-11-20 17:30:20,610 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:30:20,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:30:20,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:30:20,617 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:30:20,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:30:18" (1/3) ... [2024-11-20 17:30:20,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aeb5174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:30:20, skipping insertion in model container [2024-11-20 17:30:20,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:19" (2/3) ... [2024-11-20 17:30:20,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aeb5174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:30:20, skipping insertion in model container [2024-11-20 17:30:20,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:30:20" (3/3) ... [2024-11-20 17:30:20,622 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-20 17:30:20,640 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:30:20,640 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-20 17:30:20,641 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 17:30:20,716 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 17:30:20,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 104 flow [2024-11-20 17:30:20,790 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2024-11-20 17:30:20,790 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:30:20,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 2/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 81 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-11-20 17:30:20,796 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 46 transitions, 104 flow [2024-11-20 17:30:20,799 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 43 transitions, 95 flow [2024-11-20 17:30:20,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:30:20,819 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;@7a3cf292, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:30:20,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-20 17:30:20,830 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 17:30:20,831 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2024-11-20 17:30:20,831 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:30:20,831 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:30:20,832 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:30:20,832 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:30:20,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:30:20,838 INFO L85 PathProgramCache]: Analyzing trace with hash -472731195, now seen corresponding path program 1 times [2024-11-20 17:30:20,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:30:20,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628795775] [2024-11-20 17:30:20,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:30:20,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:30:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:30:21,332 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-20 17:30:21,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:30:21,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628795775] [2024-11-20 17:30:21,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628795775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:30:21,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:30:21,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 17:30:21,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553103748] [2024-11-20 17:30:21,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:30:21,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:30:21,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:30:21,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:30:21,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:30:21,369 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-11-20 17:30:21,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-20 17:30:21,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:30:21,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-11-20 17:30:21,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:30:22,026 INFO L124 PetriNetUnfolderBase]: 1186/2131 cut-off events. [2024-11-20 17:30:22,026 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-20 17:30:22,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3937 conditions, 2131 events. 1186/2131 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 14322 event pairs, 232 based on Foata normal form. 120/2232 useless extension candidates. Maximal degree in co-relation 3926. Up to 1360 conditions per place. [2024-11-20 17:30:22,047 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 33 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-11-20 17:30:22,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 189 flow [2024-11-20 17:30:22,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:30:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:30:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-11-20 17:30:22,058 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.717391304347826 [2024-11-20 17:30:22,059 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 95 flow. Second operand 3 states and 99 transitions. [2024-11-20 17:30:22,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 189 flow [2024-11-20 17:30:22,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-20 17:30:22,064 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 86 flow [2024-11-20 17:30:22,066 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-11-20 17:30:22,069 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2024-11-20 17:30:22,070 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 86 flow [2024-11-20 17:30:22,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-20 17:30:22,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:30:22,070 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:30:22,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 17:30:22,071 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:30:22,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:30:22,072 INFO L85 PathProgramCache]: Analyzing trace with hash 803760326, now seen corresponding path program 1 times [2024-11-20 17:30:22,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:30:22,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619373154] [2024-11-20 17:30:22,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:30:22,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:30:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:30:22,184 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-20 17:30:22,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:30:22,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619373154] [2024-11-20 17:30:22,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619373154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:30:22,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:30:22,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 17:30:22,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474668695] [2024-11-20 17:30:22,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:30:22,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:30:22,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:30:22,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:30:22,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:30:22,190 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-20 17:30:22,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 86 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-20 17:30:22,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:30:22,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-20 17:30:22,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:30:22,529 INFO L124 PetriNetUnfolderBase]: 1053/1845 cut-off events. [2024-11-20 17:30:22,530 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2024-11-20 17:30:22,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3577 conditions, 1845 events. 1053/1845 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12521 event pairs, 1053 based on Foata normal form. 60/1859 useless extension candidates. Maximal degree in co-relation 3567. Up to 1570 conditions per place. [2024-11-20 17:30:22,571 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 20 selfloop transitions, 1 changer transitions 1/37 dead transitions. [2024-11-20 17:30:22,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 37 transitions, 128 flow [2024-11-20 17:30:22,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:30:22,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:30:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-11-20 17:30:22,575 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5579710144927537 [2024-11-20 17:30:22,575 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 86 flow. Second operand 3 states and 77 transitions. [2024-11-20 17:30:22,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 37 transitions, 128 flow [2024-11-20 17:30:22,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 17:30:22,578 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 80 flow [2024-11-20 17:30:22,578 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-20 17:30:22,580 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2024-11-20 17:30:22,580 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 80 flow [2024-11-20 17:30:22,581 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-20 17:30:22,581 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:30:22,581 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:30:22,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 17:30:22,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:30:22,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:30:22,583 INFO L85 PathProgramCache]: Analyzing trace with hash 803760305, now seen corresponding path program 1 times [2024-11-20 17:30:22,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:30:22,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866355439] [2024-11-20 17:30:22,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:30:22,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:30:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:30:23,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-20 17:30:23,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:30:23,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866355439] [2024-11-20 17:30:23,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866355439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:30:23,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:30:23,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:30:23,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413144124] [2024-11-20 17:30:23,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:30:23,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:30:23,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:30:23,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:30:23,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:30:23,204 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-11-20 17:30:23,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 80 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:30:23,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:30:23,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-11-20 17:30:23,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:30:24,362 INFO L124 PetriNetUnfolderBase]: 2381/3818 cut-off events. [2024-11-20 17:30:24,363 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:30:24,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7374 conditions, 3818 events. 2381/3818 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 24347 event pairs, 435 based on Foata normal form. 0/3727 useless extension candidates. Maximal degree in co-relation 7368. Up to 1520 conditions per place. [2024-11-20 17:30:24,379 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 38 selfloop transitions, 8 changer transitions 73/131 dead transitions. [2024-11-20 17:30:24,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 131 transitions, 510 flow [2024-11-20 17:30:24,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 17:30:24,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-20 17:30:24,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 314 transitions. [2024-11-20 17:30:24,382 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5688405797101449 [2024-11-20 17:30:24,382 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 80 flow. Second operand 12 states and 314 transitions. [2024-11-20 17:30:24,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 131 transitions, 510 flow [2024-11-20 17:30:24,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 131 transitions, 509 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:30:24,388 INFO L231 Difference]: Finished difference. Result has 66 places, 41 transitions, 179 flow [2024-11-20 17:30:24,389 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=179, PETRI_PLACES=66, PETRI_TRANSITIONS=41} [2024-11-20 17:30:24,390 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2024-11-20 17:30:24,391 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 41 transitions, 179 flow [2024-11-20 17:30:24,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:30:24,391 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:30:24,391 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:30:24,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 17:30:24,392 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:30:24,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:30:24,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1976567037, now seen corresponding path program 1 times [2024-11-20 17:30:24,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:30:24,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114261680] [2024-11-20 17:30:24,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:30:24,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:30:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:30:24,814 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-20 17:30:24,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:30:24,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114261680] [2024-11-20 17:30:24,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114261680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:30:24,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:30:24,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:30:24,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575525084] [2024-11-20 17:30:24,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:30:24,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:30:24,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:30:24,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:30:24,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:30:24,829 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-11-20 17:30:24,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 41 transitions, 179 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 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-20 17:30:24,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:30:24,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-11-20 17:30:24,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:30:25,724 INFO L124 PetriNetUnfolderBase]: 1742/2955 cut-off events. [2024-11-20 17:30:25,724 INFO L125 PetriNetUnfolderBase]: For 7007/7007 co-relation queries the response was YES. [2024-11-20 17:30:25,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10206 conditions, 2955 events. 1742/2955 cut-off events. For 7007/7007 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 18488 event pairs, 582 based on Foata normal form. 71/3008 useless extension candidates. Maximal degree in co-relation 10188. Up to 1882 conditions per place. [2024-11-20 17:30:25,759 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 39 selfloop transitions, 17 changer transitions 44/112 dead transitions. [2024-11-20 17:30:25,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 112 transitions, 767 flow [2024-11-20 17:30:25,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 17:30:25,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-20 17:30:25,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 257 transitions. [2024-11-20 17:30:25,762 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.558695652173913 [2024-11-20 17:30:25,762 INFO L175 Difference]: Start difference. First operand has 66 places, 41 transitions, 179 flow. Second operand 10 states and 257 transitions. [2024-11-20 17:30:25,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 112 transitions, 767 flow [2024-11-20 17:30:25,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 112 transitions, 689 flow, removed 37 selfloop flow, removed 5 redundant places. [2024-11-20 17:30:25,784 INFO L231 Difference]: Finished difference. Result has 69 places, 50 transitions, 295 flow [2024-11-20 17:30:25,784 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=295, PETRI_PLACES=69, PETRI_TRANSITIONS=50} [2024-11-20 17:30:25,786 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2024-11-20 17:30:25,788 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 50 transitions, 295 flow [2024-11-20 17:30:25,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 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-20 17:30:25,788 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:30:25,788 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:30:25,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 17:30:25,789 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:30:25,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:30:25,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2034638724, now seen corresponding path program 1 times [2024-11-20 17:30:25,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:30:25,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545256880] [2024-11-20 17:30:25,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:30:25,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:30:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:30:26,441 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-20 17:30:26,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:30:26,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545256880] [2024-11-20 17:30:26,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545256880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:30:26,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:30:26,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:30:26,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887925657] [2024-11-20 17:30:26,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:30:26,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:30:26,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:30:26,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:30:26,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:30:26,450 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-20 17:30:26,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 50 transitions, 295 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 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-20 17:30:26,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:30:26,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-20 17:30:26,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:30:27,154 INFO L124 PetriNetUnfolderBase]: 1634/2821 cut-off events. [2024-11-20 17:30:27,154 INFO L125 PetriNetUnfolderBase]: For 7025/7271 co-relation queries the response was YES. [2024-11-20 17:30:27,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10449 conditions, 2821 events. 1634/2821 cut-off events. For 7025/7271 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 17958 event pairs, 205 based on Foata normal form. 94/2858 useless extension candidates. Maximal degree in co-relation 10426. Up to 1666 conditions per place. [2024-11-20 17:30:27,181 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 48 selfloop transitions, 8 changer transitions 31/106 dead transitions. [2024-11-20 17:30:27,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 106 transitions, 786 flow [2024-11-20 17:30:27,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 17:30:27,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 17:30:27,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2024-11-20 17:30:27,184 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5706521739130435 [2024-11-20 17:30:27,184 INFO L175 Difference]: Start difference. First operand has 69 places, 50 transitions, 295 flow. Second operand 8 states and 210 transitions. [2024-11-20 17:30:27,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 106 transitions, 786 flow [2024-11-20 17:30:27,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 106 transitions, 742 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-11-20 17:30:27,204 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 359 flow [2024-11-20 17:30:27,205 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=359, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2024-11-20 17:30:27,206 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2024-11-20 17:30:27,207 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 359 flow [2024-11-20 17:30:27,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 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-20 17:30:27,207 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:30:27,207 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:30:27,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 17:30:27,208 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:30:27,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:30:27,208 INFO L85 PathProgramCache]: Analyzing trace with hash -834806610, now seen corresponding path program 2 times [2024-11-20 17:30:27,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:30:27,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419481392] [2024-11-20 17:30:27,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:30:27,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:30:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:30:28,146 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-20 17:30:28,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:30:28,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419481392] [2024-11-20 17:30:28,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419481392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:30:28,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:30:28,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 17:30:28,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495419100] [2024-11-20 17:30:28,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:30:28,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 17:30:28,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:30:28,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 17:30:28,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-20 17:30:28,155 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-20 17:30:28,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 359 flow. Second operand has 9 states, 9 states have (on average 18.666666666666668) internal successors, (168), 9 states have internal predecessors, (168), 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-20 17:30:28,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:30:28,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-20 17:30:28,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:30:29,134 INFO L124 PetriNetUnfolderBase]: 1759/3070 cut-off events. [2024-11-20 17:30:29,134 INFO L125 PetriNetUnfolderBase]: For 8377/8650 co-relation queries the response was YES. [2024-11-20 17:30:29,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11972 conditions, 3070 events. 1759/3070 cut-off events. For 8377/8650 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 19754 event pairs, 200 based on Foata normal form. 95/3125 useless extension candidates. Maximal degree in co-relation 11949. Up to 1713 conditions per place. [2024-11-20 17:30:29,164 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 55 selfloop transitions, 17 changer transitions 33/124 dead transitions. [2024-11-20 17:30:29,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 124 transitions, 993 flow [2024-11-20 17:30:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 17:30:29,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-20 17:30:29,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 239 transitions. [2024-11-20 17:30:29,168 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5772946859903382 [2024-11-20 17:30:29,168 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 359 flow. Second operand 9 states and 239 transitions. [2024-11-20 17:30:29,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 124 transitions, 993 flow [2024-11-20 17:30:29,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 124 transitions, 961 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-11-20 17:30:29,183 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 519 flow [2024-11-20 17:30:29,183 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=519, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2024-11-20 17:30:29,184 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 23 predicate places. [2024-11-20 17:30:29,184 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 519 flow [2024-11-20 17:30:29,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.666666666666668) internal successors, (168), 9 states have internal predecessors, (168), 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-20 17:30:29,185 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:30:29,185 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-20 17:30:29,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 17:30:29,185 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:30:29,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:30:29,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1811793609, now seen corresponding path program 1 times [2024-11-20 17:30:29,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:30:29,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81315766] [2024-11-20 17:30:29,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:30:29,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:30:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:30:29,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:30:29,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:30:29,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81315766] [2024-11-20 17:30:29,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81315766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:30:29,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:30:29,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:30:29,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189883496] [2024-11-20 17:30:29,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:30:29,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:30:29,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:30:29,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:30:29,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:30:29,432 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-11-20 17:30:29,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 519 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:30:29,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:30:29,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-11-20 17:30:29,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:30:30,269 INFO L124 PetriNetUnfolderBase]: 2430/4251 cut-off events. [2024-11-20 17:30:30,269 INFO L125 PetriNetUnfolderBase]: For 16188/16216 co-relation queries the response was YES. [2024-11-20 17:30:30,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17706 conditions, 4251 events. 2430/4251 cut-off events. For 16188/16216 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 29539 event pairs, 794 based on Foata normal form. 83/4275 useless extension candidates. Maximal degree in co-relation 17679. Up to 1915 conditions per place. [2024-11-20 17:30:30,301 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 59 selfloop transitions, 7 changer transitions 29/109 dead transitions. [2024-11-20 17:30:30,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 109 transitions, 1016 flow [2024-11-20 17:30:30,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 17:30:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-20 17:30:30,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2024-11-20 17:30:30,303 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5590062111801242 [2024-11-20 17:30:30,303 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 519 flow. Second operand 7 states and 180 transitions. [2024-11-20 17:30:30,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 109 transitions, 1016 flow [2024-11-20 17:30:30,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 109 transitions, 982 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-11-20 17:30:30,329 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 532 flow [2024-11-20 17:30:30,330 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=532, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2024-11-20 17:30:30,330 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places. [2024-11-20 17:30:30,331 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 532 flow [2024-11-20 17:30:30,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:30:30,331 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:30:30,332 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:30:30,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 17:30:30,332 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:30:30,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:30:30,332 INFO L85 PathProgramCache]: Analyzing trace with hash -792655860, now seen corresponding path program 1 times [2024-11-20 17:30:30,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:30:30,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032997242] [2024-11-20 17:30:30,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:30:30,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:30:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:30:31,343 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-20 17:30:31,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:30:31,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032997242] [2024-11-20 17:30:31,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032997242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:30:31,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:30:31,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 17:30:31,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610014478] [2024-11-20 17:30:31,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:30:31,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 17:30:31,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:30:31,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 17:30:31,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 17:30:31,349 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-20 17:30:31,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 532 flow. Second operand has 8 states, 8 states have (on average 19.0) internal successors, (152), 8 states have internal predecessors, (152), 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-20 17:30:31,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:30:31,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-20 17:30:31,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:30:32,624 INFO L124 PetriNetUnfolderBase]: 2717/4758 cut-off events. [2024-11-20 17:30:32,624 INFO L125 PetriNetUnfolderBase]: For 21522/21942 co-relation queries the response was YES. [2024-11-20 17:30:32,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20348 conditions, 4758 events. 2717/4758 cut-off events. For 21522/21942 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 33576 event pairs, 336 based on Foata normal form. 176/4826 useless extension candidates. Maximal degree in co-relation 20320. Up to 2475 conditions per place. [2024-11-20 17:30:32,656 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 69 selfloop transitions, 25 changer transitions 41/154 dead transitions. [2024-11-20 17:30:32,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 154 transitions, 1471 flow [2024-11-20 17:30:32,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 17:30:32,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-20 17:30:32,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 273 transitions. [2024-11-20 17:30:32,658 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5395256916996047 [2024-11-20 17:30:32,658 INFO L175 Difference]: Start difference. First operand has 76 places, 67 transitions, 532 flow. Second operand 11 states and 273 transitions. [2024-11-20 17:30:32,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 154 transitions, 1471 flow [2024-11-20 17:30:32,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 154 transitions, 1448 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-11-20 17:30:32,684 INFO L231 Difference]: Finished difference. Result has 83 places, 80 transitions, 759 flow [2024-11-20 17:30:32,684 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=759, PETRI_PLACES=83, PETRI_TRANSITIONS=80} [2024-11-20 17:30:32,685 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 32 predicate places. [2024-11-20 17:30:32,685 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 80 transitions, 759 flow [2024-11-20 17:30:32,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.0) internal successors, (152), 8 states have internal predecessors, (152), 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-20 17:30:32,686 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:30:32,686 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:30:32,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 17:30:32,686 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:30:32,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:30:32,687 INFO L85 PathProgramCache]: Analyzing trace with hash -514727042, now seen corresponding path program 2 times [2024-11-20 17:30:32,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:30:32,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4561522] [2024-11-20 17:30:32,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:30:32,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:30:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:30:33,981 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-20 17:30:33,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:30:33,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4561522] [2024-11-20 17:30:33,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4561522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:30:33,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:30:33,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 17:30:33,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640572030] [2024-11-20 17:30:33,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:30:33,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 17:30:33,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:30:33,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 17:30:33,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 17:30:33,989 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-20 17:30:33,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 80 transitions, 759 flow. Second operand has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:30:33,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:30:33,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-20 17:30:33,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:30:35,127 INFO L124 PetriNetUnfolderBase]: 2700/4741 cut-off events. [2024-11-20 17:30:35,128 INFO L125 PetriNetUnfolderBase]: For 35012/35385 co-relation queries the response was YES. [2024-11-20 17:30:35,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24405 conditions, 4741 events. 2700/4741 cut-off events. For 35012/35385 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 33375 event pairs, 408 based on Foata normal form. 162/4812 useless extension candidates. Maximal degree in co-relation 24374. Up to 2996 conditions per place. [2024-11-20 17:30:35,167 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 71 selfloop transitions, 29 changer transitions 36/155 dead transitions. [2024-11-20 17:30:35,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 155 transitions, 1848 flow [2024-11-20 17:30:35,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 17:30:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-20 17:30:35,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 252 transitions. [2024-11-20 17:30:35,170 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5478260869565217 [2024-11-20 17:30:35,170 INFO L175 Difference]: Start difference. First operand has 83 places, 80 transitions, 759 flow. Second operand 10 states and 252 transitions. [2024-11-20 17:30:35,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 155 transitions, 1848 flow [2024-11-20 17:30:35,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 155 transitions, 1837 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-20 17:30:35,207 INFO L231 Difference]: Finished difference. Result has 91 places, 92 transitions, 1074 flow [2024-11-20 17:30:35,207 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1074, PETRI_PLACES=91, PETRI_TRANSITIONS=92} [2024-11-20 17:30:35,208 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 40 predicate places. [2024-11-20 17:30:35,209 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 92 transitions, 1074 flow [2024-11-20 17:30:35,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:30:35,210 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:30:35,210 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:30:35,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 17:30:35,210 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:30:35,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:30:35,211 INFO L85 PathProgramCache]: Analyzing trace with hash -2018317914, now seen corresponding path program 3 times [2024-11-20 17:30:35,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:30:35,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453740817] [2024-11-20 17:30:35,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:30:35,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:30:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:30:36,266 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-20 17:30:36,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:30:36,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453740817] [2024-11-20 17:30:36,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453740817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:30:36,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:30:36,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 17:30:36,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855240841] [2024-11-20 17:30:36,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:30:36,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 17:30:36,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:30:36,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 17:30:36,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:30:36,279 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-20 17:30:36,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 92 transitions, 1074 flow. Second operand has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 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-20 17:30:36,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:30:36,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-20 17:30:36,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:30:37,317 INFO L124 PetriNetUnfolderBase]: 2796/4926 cut-off events. [2024-11-20 17:30:37,317 INFO L125 PetriNetUnfolderBase]: For 58913/59382 co-relation queries the response was YES. [2024-11-20 17:30:37,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29191 conditions, 4926 events. 2796/4926 cut-off events. For 58913/59382 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 35331 event pairs, 510 based on Foata normal form. 216/5011 useless extension candidates. Maximal degree in co-relation 29155. Up to 2853 conditions per place. [2024-11-20 17:30:37,353 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 65 selfloop transitions, 37 changer transitions 43/164 dead transitions. [2024-11-20 17:30:37,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 164 transitions, 2358 flow [2024-11-20 17:30:37,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 17:30:37,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-20 17:30:37,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 232 transitions. [2024-11-20 17:30:37,355 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5603864734299517 [2024-11-20 17:30:37,355 INFO L175 Difference]: Start difference. First operand has 91 places, 92 transitions, 1074 flow. Second operand 9 states and 232 transitions. [2024-11-20 17:30:37,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 164 transitions, 2358 flow [2024-11-20 17:30:37,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 164 transitions, 2122 flow, removed 99 selfloop flow, removed 7 redundant places. [2024-11-20 17:30:37,436 INFO L231 Difference]: Finished difference. Result has 94 places, 101 transitions, 1293 flow [2024-11-20 17:30:37,437 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1293, PETRI_PLACES=94, PETRI_TRANSITIONS=101} [2024-11-20 17:30:37,437 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 43 predicate places. [2024-11-20 17:30:37,438 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 101 transitions, 1293 flow [2024-11-20 17:30:37,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 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-20 17:30:37,438 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:30:37,438 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:30:37,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 17:30:37,439 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:30:37,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:30:37,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1550530148, now seen corresponding path program 1 times [2024-11-20 17:30:37,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:30:37,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198020806] [2024-11-20 17:30:37,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:30:37,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:30:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:30:37,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:30:37,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:30:37,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198020806] [2024-11-20 17:30:37,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198020806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:30:37,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:30:37,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:30:37,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771320865] [2024-11-20 17:30:37,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:30:37,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:30:37,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:30:37,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:30:37,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:30:37,691 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-11-20 17:30:37,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 101 transitions, 1293 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-20 17:30:37,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:30:37,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-11-20 17:30:37,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:30:38,741 INFO L124 PetriNetUnfolderBase]: 5335/8358 cut-off events. [2024-11-20 17:30:38,742 INFO L125 PetriNetUnfolderBase]: For 129214/130626 co-relation queries the response was YES. [2024-11-20 17:30:38,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46461 conditions, 8358 events. 5335/8358 cut-off events. For 129214/130626 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 53925 event pairs, 572 based on Foata normal form. 947/9118 useless extension candidates. Maximal degree in co-relation 46423. Up to 4129 conditions per place. [2024-11-20 17:30:38,796 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 143 selfloop transitions, 5 changer transitions 37/204 dead transitions. [2024-11-20 17:30:38,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 204 transitions, 3143 flow [2024-11-20 17:30:38,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:30:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 17:30:38,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2024-11-20 17:30:38,798 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6195652173913043 [2024-11-20 17:30:38,798 INFO L175 Difference]: Start difference. First operand has 94 places, 101 transitions, 1293 flow. Second operand 4 states and 114 transitions. [2024-11-20 17:30:38,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 204 transitions, 3143 flow [2024-11-20 17:30:38,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 204 transitions, 2857 flow, removed 100 selfloop flow, removed 6 redundant places. [2024-11-20 17:30:38,906 INFO L231 Difference]: Finished difference. Result has 89 places, 102 transitions, 1171 flow [2024-11-20 17:30:38,906 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1159, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1171, PETRI_PLACES=89, PETRI_TRANSITIONS=102} [2024-11-20 17:30:38,906 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 38 predicate places. [2024-11-20 17:30:38,907 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 102 transitions, 1171 flow [2024-11-20 17:30:38,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-20 17:30:38,907 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:30:38,907 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:30:38,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 17:30:38,907 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:30:38,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:30:38,908 INFO L85 PathProgramCache]: Analyzing trace with hash -97875301, now seen corresponding path program 1 times [2024-11-20 17:30:38,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:30:38,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701469276] [2024-11-20 17:30:38,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:30:38,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:30:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:30:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:30:41,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:30:41,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701469276] [2024-11-20 17:30:41,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701469276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:30:41,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:30:41,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 17:30:41,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595758141] [2024-11-20 17:30:41,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:30:41,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 17:30:41,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:30:41,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 17:30:41,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:30:41,339 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-20 17:30:41,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 102 transitions, 1171 flow. Second operand has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:30:41,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:30:41,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-20 17:30:41,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:30:42,531 INFO L124 PetriNetUnfolderBase]: 3545/6395 cut-off events. [2024-11-20 17:30:42,532 INFO L125 PetriNetUnfolderBase]: For 57008/58000 co-relation queries the response was YES. [2024-11-20 17:30:42,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32832 conditions, 6395 events. 3545/6395 cut-off events. For 57008/58000 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 48216 event pairs, 848 based on Foata normal form. 279/6346 useless extension candidates. Maximal degree in co-relation 32796. Up to 2736 conditions per place. [2024-11-20 17:30:42,583 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 85 selfloop transitions, 31 changer transitions 37/176 dead transitions. [2024-11-20 17:30:42,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 176 transitions, 2261 flow [2024-11-20 17:30:42,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 17:30:42,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-20 17:30:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 294 transitions. [2024-11-20 17:30:42,585 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.532608695652174 [2024-11-20 17:30:42,585 INFO L175 Difference]: Start difference. First operand has 89 places, 102 transitions, 1171 flow. Second operand 12 states and 294 transitions. [2024-11-20 17:30:42,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 176 transitions, 2261 flow [2024-11-20 17:30:42,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 176 transitions, 2259 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:30:42,634 INFO L231 Difference]: Finished difference. Result has 106 places, 107 transitions, 1405 flow [2024-11-20 17:30:42,635 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1405, PETRI_PLACES=106, PETRI_TRANSITIONS=107} [2024-11-20 17:30:42,635 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 55 predicate places. [2024-11-20 17:30:42,637 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 107 transitions, 1405 flow [2024-11-20 17:30:42,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:30:42,638 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:30:42,638 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:30:42,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 17:30:42,638 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:30:42,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:30:42,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1349537711, now seen corresponding path program 2 times [2024-11-20 17:30:42,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:30:42,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065908558] [2024-11-20 17:30:42,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:30:42,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:30:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:30:42,866 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-20 17:30:42,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:30:42,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065908558] [2024-11-20 17:30:42,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065908558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:30:42,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:30:42,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:30:42,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408976862] [2024-11-20 17:30:42,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:30:42,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:30:42,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:30:42,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:30:42,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:30:42,877 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-11-20 17:30:42,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 107 transitions, 1405 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-20 17:30:42,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:30:42,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-11-20 17:30:42,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:30:43,812 INFO L124 PetriNetUnfolderBase]: 4149/6659 cut-off events. [2024-11-20 17:30:43,813 INFO L125 PetriNetUnfolderBase]: For 101175/102397 co-relation queries the response was YES. [2024-11-20 17:30:43,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37519 conditions, 6659 events. 4149/6659 cut-off events. For 101175/102397 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 42493 event pairs, 384 based on Foata normal form. 871/7371 useless extension candidates. Maximal degree in co-relation 37475. Up to 2361 conditions per place. [2024-11-20 17:30:43,845 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 121 selfloop transitions, 8 changer transitions 40/188 dead transitions. [2024-11-20 17:30:43,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 188 transitions, 2852 flow [2024-11-20 17:30:43,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:30:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:30:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2024-11-20 17:30:43,847 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6304347826086957 [2024-11-20 17:30:43,847 INFO L175 Difference]: Start difference. First operand has 106 places, 107 transitions, 1405 flow. Second operand 5 states and 145 transitions. [2024-11-20 17:30:43,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 188 transitions, 2852 flow [2024-11-20 17:30:43,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 188 transitions, 2570 flow, removed 108 selfloop flow, removed 8 redundant places. [2024-11-20 17:30:43,925 INFO L231 Difference]: Finished difference. Result has 100 places, 94 transitions, 1065 flow [2024-11-20 17:30:43,925 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1145, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1065, PETRI_PLACES=100, PETRI_TRANSITIONS=94} [2024-11-20 17:30:43,926 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 49 predicate places. [2024-11-20 17:30:43,926 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 1065 flow [2024-11-20 17:30:43,926 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-20 17:30:43,926 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:30:43,927 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] [2024-11-20 17:30:43,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 17:30:43,927 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:30:43,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:30:43,927 INFO L85 PathProgramCache]: Analyzing trace with hash 217114750, now seen corresponding path program 1 times [2024-11-20 17:30:43,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:30:43,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824563225] [2024-11-20 17:30:43,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:30:43,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:30:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:30:44,164 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-20 17:30:44,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:30:44,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824563225] [2024-11-20 17:30:44,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824563225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:30:44,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:30:44,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:30:44,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761013066] [2024-11-20 17:30:44,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:30:44,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:30:44,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:30:44,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:30:44,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:30:44,180 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-11-20 17:30:44,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 94 transitions, 1065 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 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-20 17:30:44,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:30:44,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-11-20 17:30:44,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:30:44,961 INFO L124 PetriNetUnfolderBase]: 3352/5326 cut-off events. [2024-11-20 17:30:44,962 INFO L125 PetriNetUnfolderBase]: For 71687/72785 co-relation queries the response was YES. [2024-11-20 17:30:44,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29751 conditions, 5326 events. 3352/5326 cut-off events. For 71687/72785 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 33415 event pairs, 354 based on Foata normal form. 617/5804 useless extension candidates. Maximal degree in co-relation 29710. Up to 2237 conditions per place. [2024-11-20 17:30:44,991 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 97 selfloop transitions, 11 changer transitions 38/164 dead transitions. [2024-11-20 17:30:44,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 164 transitions, 2166 flow [2024-11-20 17:30:44,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:30:44,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:30:44,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2024-11-20 17:30:44,993 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2024-11-20 17:30:44,993 INFO L175 Difference]: Start difference. First operand has 100 places, 94 transitions, 1065 flow. Second operand 6 states and 156 transitions. [2024-11-20 17:30:44,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 164 transitions, 2166 flow [2024-11-20 17:30:45,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 164 transitions, 1954 flow, removed 73 selfloop flow, removed 8 redundant places. [2024-11-20 17:30:45,169 INFO L231 Difference]: Finished difference. Result has 98 places, 88 transitions, 884 flow [2024-11-20 17:30:45,169 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=884, PETRI_PLACES=98, PETRI_TRANSITIONS=88} [2024-11-20 17:30:45,170 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 47 predicate places. [2024-11-20 17:30:45,170 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 88 transitions, 884 flow [2024-11-20 17:30:45,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 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-20 17:30:45,170 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:30:45,170 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:30:45,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 17:30:45,171 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:30:45,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:30:45,171 INFO L85 PathProgramCache]: Analyzing trace with hash 463503394, now seen corresponding path program 1 times [2024-11-20 17:30:45,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:30:45,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226060388] [2024-11-20 17:30:45,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:30:45,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:30:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:30:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:30:45,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:30:45,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226060388] [2024-11-20 17:30:45,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226060388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:30:45,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:30:45,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 17:30:45,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181550982] [2024-11-20 17:30:45,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:30:45,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 17:30:45,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:30:45,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 17:30:45,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:30:45,847 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-20 17:30:45,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 88 transitions, 884 flow. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 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-20 17:30:45,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:30:45,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-20 17:30:45,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:30:46,606 INFO L124 PetriNetUnfolderBase]: 2199/4321 cut-off events. [2024-11-20 17:30:46,606 INFO L125 PetriNetUnfolderBase]: For 28439/29217 co-relation queries the response was YES. [2024-11-20 17:30:46,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18536 conditions, 4321 events. 2199/4321 cut-off events. For 28439/29217 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 34165 event pairs, 680 based on Foata normal form. 122/3976 useless extension candidates. Maximal degree in co-relation 18499. Up to 1701 conditions per place. [2024-11-20 17:30:46,631 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 43 selfloop transitions, 25 changer transitions 33/128 dead transitions. [2024-11-20 17:30:46,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 128 transitions, 1353 flow [2024-11-20 17:30:46,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 17:30:46,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 17:30:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-11-20 17:30:46,633 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5489130434782609 [2024-11-20 17:30:46,633 INFO L175 Difference]: Start difference. First operand has 98 places, 88 transitions, 884 flow. Second operand 8 states and 202 transitions. [2024-11-20 17:30:46,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 128 transitions, 1353 flow [2024-11-20 17:30:46,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 128 transitions, 1153 flow, removed 83 selfloop flow, removed 13 redundant places. [2024-11-20 17:30:46,694 INFO L231 Difference]: Finished difference. Result has 96 places, 90 transitions, 833 flow [2024-11-20 17:30:46,694 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=833, PETRI_PLACES=96, PETRI_TRANSITIONS=90} [2024-11-20 17:30:46,695 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 45 predicate places. [2024-11-20 17:30:46,695 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 90 transitions, 833 flow [2024-11-20 17:30:46,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 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-20 17:30:46,696 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:30:46,696 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:30:46,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 17:30:46,703 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:30:46,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:30:46,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1714802386, now seen corresponding path program 2 times [2024-11-20 17:30:46,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:30:46,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847380127] [2024-11-20 17:30:46,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:30:46,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:30:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:30:48,354 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-20 17:30:48,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:30:48,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847380127] [2024-11-20 17:30:48,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847380127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:30:48,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:30:48,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 17:30:48,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636733439] [2024-11-20 17:30:48,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:30:48,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 17:30:48,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:30:48,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 17:30:48,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-20 17:30:48,364 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-20 17:30:48,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 90 transitions, 833 flow. Second operand has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 11 states have internal predecessors, (206), 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-20 17:30:48,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:30:48,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-20 17:30:48,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:30:48,953 INFO L124 PetriNetUnfolderBase]: 1764/3512 cut-off events. [2024-11-20 17:30:48,953 INFO L125 PetriNetUnfolderBase]: For 14389/14788 co-relation queries the response was YES. [2024-11-20 17:30:48,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13712 conditions, 3512 events. 1764/3512 cut-off events. For 14389/14788 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 26372 event pairs, 406 based on Foata normal form. 142/3272 useless extension candidates. Maximal degree in co-relation 13679. Up to 1411 conditions per place. [2024-11-20 17:30:48,971 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 52 selfloop transitions, 25 changer transitions 21/125 dead transitions. [2024-11-20 17:30:48,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 125 transitions, 1228 flow [2024-11-20 17:30:48,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 17:30:48,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-20 17:30:48,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 237 transitions. [2024-11-20 17:30:48,972 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5152173913043478 [2024-11-20 17:30:48,972 INFO L175 Difference]: Start difference. First operand has 96 places, 90 transitions, 833 flow. Second operand 10 states and 237 transitions. [2024-11-20 17:30:48,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 125 transitions, 1228 flow [2024-11-20 17:30:48,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 125 transitions, 1154 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-11-20 17:30:48,994 INFO L231 Difference]: Finished difference. Result has 98 places, 89 transitions, 846 flow [2024-11-20 17:30:48,994 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=846, PETRI_PLACES=98, PETRI_TRANSITIONS=89} [2024-11-20 17:30:48,995 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 47 predicate places. [2024-11-20 17:30:48,995 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 89 transitions, 846 flow [2024-11-20 17:30:48,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 11 states have internal predecessors, (206), 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-20 17:30:48,995 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:30:48,995 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:30:48,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 17:30:48,996 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:30:48,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:30:48,996 INFO L85 PathProgramCache]: Analyzing trace with hash 2121449984, now seen corresponding path program 3 times [2024-11-20 17:30:48,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:30:48,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013382395] [2024-11-20 17:30:48,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:30:48,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:30:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:30:50,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-20 17:30:50,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:30:50,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013382395] [2024-11-20 17:30:50,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013382395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:30:50,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:30:50,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 17:30:50,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244807409] [2024-11-20 17:30:50,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:30:50,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 17:30:50,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:30:50,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 17:30:50,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-20 17:30:50,279 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-20 17:30:50,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 846 flow. Second operand has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 11 states have internal predecessors, (206), 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-20 17:30:50,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:30:50,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-20 17:30:50,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:30:51,087 INFO L124 PetriNetUnfolderBase]: 1876/3675 cut-off events. [2024-11-20 17:30:51,087 INFO L125 PetriNetUnfolderBase]: For 16276/16700 co-relation queries the response was YES. [2024-11-20 17:30:51,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14341 conditions, 3675 events. 1876/3675 cut-off events. For 16276/16700 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 28076 event pairs, 403 based on Foata normal form. 138/3399 useless extension candidates. Maximal degree in co-relation 14308. Up to 1564 conditions per place. [2024-11-20 17:30:51,103 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 58 selfloop transitions, 24 changer transitions 23/132 dead transitions. [2024-11-20 17:30:51,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 132 transitions, 1270 flow [2024-11-20 17:30:51,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 17:30:51,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-20 17:30:51,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 296 transitions. [2024-11-20 17:30:51,105 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49498327759197325 [2024-11-20 17:30:51,105 INFO L175 Difference]: Start difference. First operand has 98 places, 89 transitions, 846 flow. Second operand 13 states and 296 transitions. [2024-11-20 17:30:51,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 132 transitions, 1270 flow [2024-11-20 17:30:51,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 132 transitions, 1207 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-11-20 17:30:51,119 INFO L231 Difference]: Finished difference. Result has 103 places, 85 transitions, 830 flow [2024-11-20 17:30:51,119 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=830, PETRI_PLACES=103, PETRI_TRANSITIONS=85} [2024-11-20 17:30:51,120 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 52 predicate places. [2024-11-20 17:30:51,120 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 85 transitions, 830 flow [2024-11-20 17:30:51,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 11 states have internal predecessors, (206), 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-20 17:30:51,120 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:30:51,120 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:30:51,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 17:30:51,120 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:30:51,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:30:51,121 INFO L85 PathProgramCache]: Analyzing trace with hash 728249794, now seen corresponding path program 4 times [2024-11-20 17:30:51,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:30:51,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107819198] [2024-11-20 17:30:51,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:30:51,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:30:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:30:52,116 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-20 17:30:52,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:30:52,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107819198] [2024-11-20 17:30:52,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107819198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:30:52,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:30:52,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 17:30:52,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208403146] [2024-11-20 17:30:52,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:30:52,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 17:30:52,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:30:52,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 17:30:52,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 17:30:52,125 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-20 17:30:52,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 85 transitions, 830 flow. Second operand has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 9 states have internal predecessors, (172), 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-20 17:30:52,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:30:52,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-20 17:30:52,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:30:52,874 INFO L124 PetriNetUnfolderBase]: 1900/3755 cut-off events. [2024-11-20 17:30:52,874 INFO L125 PetriNetUnfolderBase]: For 16882/17199 co-relation queries the response was YES. [2024-11-20 17:30:52,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14782 conditions, 3755 events. 1900/3755 cut-off events. For 16882/17199 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 28819 event pairs, 341 based on Foata normal form. 123/3503 useless extension candidates. Maximal degree in co-relation 14746. Up to 1857 conditions per place. [2024-11-20 17:30:52,898 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 39 selfloop transitions, 24 changer transitions 19/109 dead transitions. [2024-11-20 17:30:52,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 109 transitions, 1152 flow [2024-11-20 17:30:52,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 17:30:52,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-20 17:30:52,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-11-20 17:30:52,900 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.515527950310559 [2024-11-20 17:30:52,900 INFO L175 Difference]: Start difference. First operand has 103 places, 85 transitions, 830 flow. Second operand 7 states and 166 transitions. [2024-11-20 17:30:52,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 109 transitions, 1152 flow [2024-11-20 17:30:52,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 109 transitions, 1067 flow, removed 19 selfloop flow, removed 13 redundant places. [2024-11-20 17:30:52,923 INFO L231 Difference]: Finished difference. Result has 97 places, 85 transitions, 880 flow [2024-11-20 17:30:52,923 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=880, PETRI_PLACES=97, PETRI_TRANSITIONS=85} [2024-11-20 17:30:52,923 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 46 predicate places. [2024-11-20 17:30:52,924 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 85 transitions, 880 flow [2024-11-20 17:30:52,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 9 states have internal predecessors, (172), 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-20 17:30:52,924 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:30:52,924 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:30:52,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 17:30:52,924 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:30:52,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:30:52,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1482923410, now seen corresponding path program 5 times [2024-11-20 17:30:52,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:30:52,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171964441] [2024-11-20 17:30:52,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:30:52,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:30:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:30:53,634 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-20 17:30:53,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:30:53,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171964441] [2024-11-20 17:30:53,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171964441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:30:53,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:30:53,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 17:30:53,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189394973] [2024-11-20 17:30:53,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:30:53,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 17:30:53,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:30:53,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 17:30:53,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 17:30:53,640 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-20 17:30:53,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 85 transitions, 880 flow. Second operand has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:30:53,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:30:53,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-20 17:30:53,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:30:54,325 INFO L124 PetriNetUnfolderBase]: 2088/4180 cut-off events. [2024-11-20 17:30:54,325 INFO L125 PetriNetUnfolderBase]: For 20314/20697 co-relation queries the response was YES. [2024-11-20 17:30:54,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16116 conditions, 4180 events. 2088/4180 cut-off events. For 20314/20697 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 33438 event pairs, 514 based on Foata normal form. 151/3885 useless extension candidates. Maximal degree in co-relation 16082. Up to 1572 conditions per place. [2024-11-20 17:30:54,347 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 48 selfloop transitions, 18 changer transitions 23/116 dead transitions. [2024-11-20 17:30:54,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 116 transitions, 1254 flow [2024-11-20 17:30:54,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 17:30:54,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 17:30:54,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2024-11-20 17:30:54,348 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5244565217391305 [2024-11-20 17:30:54,348 INFO L175 Difference]: Start difference. First operand has 97 places, 85 transitions, 880 flow. Second operand 8 states and 193 transitions. [2024-11-20 17:30:54,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 116 transitions, 1254 flow [2024-11-20 17:30:54,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 116 transitions, 1208 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-11-20 17:30:54,361 INFO L231 Difference]: Finished difference. Result has 98 places, 84 transitions, 888 flow [2024-11-20 17:30:54,361 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=888, PETRI_PLACES=98, PETRI_TRANSITIONS=84} [2024-11-20 17:30:54,361 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 47 predicate places. [2024-11-20 17:30:54,361 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 84 transitions, 888 flow [2024-11-20 17:30:54,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:30:54,362 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:30:54,362 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:30:54,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 17:30:54,362 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:30:54,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:30:54,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1320782048, now seen corresponding path program 6 times [2024-11-20 17:30:54,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:30:54,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753267] [2024-11-20 17:30:54,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:30:54,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:30:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:30:54,978 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-20 17:30:54,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:30:54,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753267] [2024-11-20 17:30:54,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:30:54,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:30:54,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 17:30:54,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024563321] [2024-11-20 17:30:54,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:30:54,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 17:30:54,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:30:54,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 17:30:54,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-20 17:30:54,990 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-20 17:30:54,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 84 transitions, 888 flow. Second operand has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 11 states have internal predecessors, (206), 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-20 17:30:54,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:30:54,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-20 17:30:54,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:30:55,701 INFO L124 PetriNetUnfolderBase]: 2117/4332 cut-off events. [2024-11-20 17:30:55,702 INFO L125 PetriNetUnfolderBase]: For 20770/21206 co-relation queries the response was YES. [2024-11-20 17:30:55,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16770 conditions, 4332 events. 2117/4332 cut-off events. For 20770/21206 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 35730 event pairs, 756 based on Foata normal form. 177/4019 useless extension candidates. Maximal degree in co-relation 16735. Up to 2094 conditions per place. [2024-11-20 17:30:55,737 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 51 selfloop transitions, 20 changer transitions 29/127 dead transitions. [2024-11-20 17:30:55,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 127 transitions, 1431 flow [2024-11-20 17:30:55,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 17:30:55,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-20 17:30:55,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 255 transitions. [2024-11-20 17:30:55,739 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5039525691699605 [2024-11-20 17:30:55,739 INFO L175 Difference]: Start difference. First operand has 98 places, 84 transitions, 888 flow. Second operand 11 states and 255 transitions. [2024-11-20 17:30:55,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 127 transitions, 1431 flow [2024-11-20 17:30:55,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 127 transitions, 1357 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-11-20 17:30:55,756 INFO L231 Difference]: Finished difference. Result has 106 places, 88 transitions, 977 flow [2024-11-20 17:30:55,756 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=977, PETRI_PLACES=106, PETRI_TRANSITIONS=88} [2024-11-20 17:30:55,756 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 55 predicate places. [2024-11-20 17:30:55,757 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 88 transitions, 977 flow [2024-11-20 17:30:55,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 11 states have internal predecessors, (206), 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-20 17:30:55,757 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:30:55,757 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:30:55,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 17:30:55,757 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:30:55,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:30:55,758 INFO L85 PathProgramCache]: Analyzing trace with hash 984780386, now seen corresponding path program 7 times [2024-11-20 17:30:55,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:30:55,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071527346] [2024-11-20 17:30:55,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:30:55,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:30:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:30:56,258 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-20 17:30:56,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:30:56,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071527346] [2024-11-20 17:30:56,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071527346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:30:56,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:30:56,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 17:30:56,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045422986] [2024-11-20 17:30:56,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:30:56,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 17:30:56,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:30:56,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 17:30:56,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 17:30:56,265 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-20 17:30:56,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 88 transitions, 977 flow. Second operand has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:30:56,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:30:56,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-20 17:30:56,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:30:56,878 INFO L124 PetriNetUnfolderBase]: 2065/4153 cut-off events. [2024-11-20 17:30:56,878 INFO L125 PetriNetUnfolderBase]: For 19036/19453 co-relation queries the response was YES. [2024-11-20 17:30:56,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15551 conditions, 4153 events. 2065/4153 cut-off events. For 19036/19453 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 33719 event pairs, 546 based on Foata normal form. 156/3841 useless extension candidates. Maximal degree in co-relation 15514. Up to 1344 conditions per place. [2024-11-20 17:30:56,895 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 40 selfloop transitions, 30 changer transitions 22/119 dead transitions. [2024-11-20 17:30:56,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 119 transitions, 1338 flow [2024-11-20 17:30:56,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 17:30:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-20 17:30:56,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 232 transitions. [2024-11-20 17:30:56,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5043478260869565 [2024-11-20 17:30:56,896 INFO L175 Difference]: Start difference. First operand has 106 places, 88 transitions, 977 flow. Second operand 10 states and 232 transitions. [2024-11-20 17:30:56,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 119 transitions, 1338 flow [2024-11-20 17:30:56,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 119 transitions, 1257 flow, removed 12 selfloop flow, removed 10 redundant places. [2024-11-20 17:30:56,911 INFO L231 Difference]: Finished difference. Result has 105 places, 83 transitions, 915 flow [2024-11-20 17:30:56,911 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=915, PETRI_PLACES=105, PETRI_TRANSITIONS=83} [2024-11-20 17:30:56,911 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 54 predicate places. [2024-11-20 17:30:56,912 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 83 transitions, 915 flow [2024-11-20 17:30:56,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:30:56,912 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:30:56,912 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:30:56,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 17:30:56,912 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:30:56,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:30:56,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1705273182, now seen corresponding path program 8 times [2024-11-20 17:30:56,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:30:56,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356616562] [2024-11-20 17:30:56,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:30:56,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:30:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:30:58,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:30:58,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:30:58,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356616562] [2024-11-20 17:30:58,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356616562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:30:58,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:30:58,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 17:30:58,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913688965] [2024-11-20 17:30:58,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:30:58,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 17:30:58,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:30:58,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 17:30:58,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:30:58,226 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-20 17:30:58,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 83 transitions, 915 flow. Second operand has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 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-20 17:30:58,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:30:58,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-20 17:30:58,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:30:58,886 INFO L124 PetriNetUnfolderBase]: 1828/3737 cut-off events. [2024-11-20 17:30:58,886 INFO L125 PetriNetUnfolderBase]: For 16442/16808 co-relation queries the response was YES. [2024-11-20 17:30:58,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14242 conditions, 3737 events. 1828/3737 cut-off events. For 16442/16808 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 29952 event pairs, 519 based on Foata normal form. 114/3419 useless extension candidates. Maximal degree in co-relation 14206. Up to 1623 conditions per place. [2024-11-20 17:30:58,904 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 48 selfloop transitions, 29 changer transitions 20/124 dead transitions. [2024-11-20 17:30:58,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 124 transitions, 1399 flow [2024-11-20 17:30:58,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 17:30:58,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-20 17:30:58,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 272 transitions. [2024-11-20 17:30:58,906 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4927536231884058 [2024-11-20 17:30:58,906 INFO L175 Difference]: Start difference. First operand has 105 places, 83 transitions, 915 flow. Second operand 12 states and 272 transitions. [2024-11-20 17:30:58,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 124 transitions, 1399 flow [2024-11-20 17:30:58,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 124 transitions, 1310 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-11-20 17:30:58,922 INFO L231 Difference]: Finished difference. Result has 113 places, 91 transitions, 1079 flow [2024-11-20 17:30:58,922 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1079, PETRI_PLACES=113, PETRI_TRANSITIONS=91} [2024-11-20 17:30:58,922 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 62 predicate places. [2024-11-20 17:30:58,923 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 91 transitions, 1079 flow [2024-11-20 17:30:58,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 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-20 17:30:58,923 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:30:58,923 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:30:58,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 17:30:58,923 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:30:58,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:30:58,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1310736092, now seen corresponding path program 9 times [2024-11-20 17:30:58,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:30:58,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678676096] [2024-11-20 17:30:58,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:30:58,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:30:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:30:59,713 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-20 17:30:59,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:30:59,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678676096] [2024-11-20 17:30:59,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678676096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:30:59,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:30:59,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 17:30:59,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230249375] [2024-11-20 17:30:59,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:30:59,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 17:30:59,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:30:59,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 17:30:59,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:30:59,720 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-20 17:30:59,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 91 transitions, 1079 flow. Second operand has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 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-20 17:30:59,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:30:59,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-20 17:30:59,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:31:00,282 INFO L124 PetriNetUnfolderBase]: 1722/3527 cut-off events. [2024-11-20 17:31:00,282 INFO L125 PetriNetUnfolderBase]: For 16508/16821 co-relation queries the response was YES. [2024-11-20 17:31:00,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13711 conditions, 3527 events. 1722/3527 cut-off events. For 16508/16821 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 27762 event pairs, 469 based on Foata normal form. 95/3218 useless extension candidates. Maximal degree in co-relation 13672. Up to 2012 conditions per place. [2024-11-20 17:31:00,302 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 52 selfloop transitions, 13 changer transitions 27/119 dead transitions. [2024-11-20 17:31:00,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 119 transitions, 1373 flow [2024-11-20 17:31:00,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 17:31:00,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-20 17:31:00,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 248 transitions. [2024-11-20 17:31:00,304 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4901185770750988 [2024-11-20 17:31:00,304 INFO L175 Difference]: Start difference. First operand has 113 places, 91 transitions, 1079 flow. Second operand 11 states and 248 transitions. [2024-11-20 17:31:00,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 119 transitions, 1373 flow [2024-11-20 17:31:00,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 119 transitions, 1323 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-11-20 17:31:00,328 INFO L231 Difference]: Finished difference. Result has 118 places, 85 transitions, 984 flow [2024-11-20 17:31:00,328 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=984, PETRI_PLACES=118, PETRI_TRANSITIONS=85} [2024-11-20 17:31:00,328 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 67 predicate places. [2024-11-20 17:31:00,328 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 85 transitions, 984 flow [2024-11-20 17:31:00,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 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-20 17:31:00,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:31:00,329 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:31:00,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 17:31:00,329 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:31:00,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:31:00,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1369117012, now seen corresponding path program 10 times [2024-11-20 17:31:00,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:31:00,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299115104] [2024-11-20 17:31:00,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:31:00,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:31:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:31:01,618 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-20 17:31:01,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:31:01,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299115104] [2024-11-20 17:31:01,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299115104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:31:01,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:31:01,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 17:31:01,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770626764] [2024-11-20 17:31:01,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:31:01,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 17:31:01,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:31:01,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 17:31:01,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-20 17:31:01,626 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-20 17:31:01,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 85 transitions, 984 flow. Second operand has 12 states, 12 states have (on average 18.583333333333332) internal successors, (223), 12 states have internal predecessors, (223), 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-20 17:31:01,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:31:01,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-20 17:31:01,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:31:02,335 INFO L124 PetriNetUnfolderBase]: 2286/4717 cut-off events. [2024-11-20 17:31:02,336 INFO L125 PetriNetUnfolderBase]: For 21738/22208 co-relation queries the response was YES. [2024-11-20 17:31:02,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17721 conditions, 4717 events. 2286/4717 cut-off events. For 21738/22208 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 40244 event pairs, 451 based on Foata normal form. 134/4305 useless extension candidates. Maximal degree in co-relation 17680. Up to 1621 conditions per place. [2024-11-20 17:31:02,365 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 51 selfloop transitions, 23 changer transitions 32/133 dead transitions. [2024-11-20 17:31:02,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 133 transitions, 1549 flow [2024-11-20 17:31:02,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 17:31:02,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-20 17:31:02,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 263 transitions. [2024-11-20 17:31:02,366 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5197628458498024 [2024-11-20 17:31:02,366 INFO L175 Difference]: Start difference. First operand has 118 places, 85 transitions, 984 flow. Second operand 11 states and 263 transitions. [2024-11-20 17:31:02,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 133 transitions, 1549 flow [2024-11-20 17:31:02,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 133 transitions, 1442 flow, removed 22 selfloop flow, removed 12 redundant places. [2024-11-20 17:31:02,389 INFO L231 Difference]: Finished difference. Result has 115 places, 89 transitions, 1087 flow [2024-11-20 17:31:02,389 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1087, PETRI_PLACES=115, PETRI_TRANSITIONS=89} [2024-11-20 17:31:02,389 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 64 predicate places. [2024-11-20 17:31:02,389 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 89 transitions, 1087 flow [2024-11-20 17:31:02,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.583333333333332) internal successors, (223), 12 states have internal predecessors, (223), 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-20 17:31:02,389 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:31:02,390 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:31:02,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 17:31:02,390 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:31:02,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:31:02,390 INFO L85 PathProgramCache]: Analyzing trace with hash 261702084, now seen corresponding path program 11 times [2024-11-20 17:31:02,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:31:02,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586718788] [2024-11-20 17:31:02,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:31:02,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:31:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:31:03,033 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-20 17:31:03,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:31:03,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586718788] [2024-11-20 17:31:03,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586718788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:31:03,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:31:03,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 17:31:03,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852246498] [2024-11-20 17:31:03,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:31:03,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 17:31:03,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:31:03,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 17:31:03,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 17:31:03,038 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-20 17:31:03,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 89 transitions, 1087 flow. Second operand has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 9 states have internal predecessors, (172), 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-20 17:31:03,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:31:03,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-20 17:31:03,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:31:03,730 INFO L124 PetriNetUnfolderBase]: 1734/3611 cut-off events. [2024-11-20 17:31:03,730 INFO L125 PetriNetUnfolderBase]: For 17874/18251 co-relation queries the response was YES. [2024-11-20 17:31:03,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14164 conditions, 3611 events. 1734/3611 cut-off events. For 17874/18251 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 29132 event pairs, 714 based on Foata normal form. 99/3268 useless extension candidates. Maximal degree in co-relation 14122. Up to 1973 conditions per place. [2024-11-20 17:31:03,761 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 53 selfloop transitions, 2 changer transitions 32/114 dead transitions. [2024-11-20 17:31:03,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 114 transitions, 1354 flow [2024-11-20 17:31:03,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 17:31:03,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-20 17:31:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 207 transitions. [2024-11-20 17:31:03,762 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-20 17:31:03,762 INFO L175 Difference]: Start difference. First operand has 115 places, 89 transitions, 1087 flow. Second operand 9 states and 207 transitions. [2024-11-20 17:31:03,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 114 transitions, 1354 flow [2024-11-20 17:31:03,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 114 transitions, 1312 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-11-20 17:31:03,790 INFO L231 Difference]: Finished difference. Result has 116 places, 81 transitions, 909 flow [2024-11-20 17:31:03,790 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=909, PETRI_PLACES=116, PETRI_TRANSITIONS=81} [2024-11-20 17:31:03,791 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 65 predicate places. [2024-11-20 17:31:03,791 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 81 transitions, 909 flow [2024-11-20 17:31:03,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 9 states have internal predecessors, (172), 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-20 17:31:03,792 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:31:03,792 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:31:03,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 17:31:03,792 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:31:03,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:31:03,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1483781116, now seen corresponding path program 12 times [2024-11-20 17:31:03,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:31:03,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735137070] [2024-11-20 17:31:03,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:31:03,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:31:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:31:04,723 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-20 17:31:04,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:31:04,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735137070] [2024-11-20 17:31:04,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735137070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:31:04,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:31:04,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 17:31:04,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535023263] [2024-11-20 17:31:04,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:31:04,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 17:31:04,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:31:04,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 17:31:04,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:31:04,729 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-20 17:31:04,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 81 transitions, 909 flow. Second operand has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 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-20 17:31:04,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:31:04,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-20 17:31:04,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:31:05,464 INFO L124 PetriNetUnfolderBase]: 1942/3950 cut-off events. [2024-11-20 17:31:05,464 INFO L125 PetriNetUnfolderBase]: For 17431/17847 co-relation queries the response was YES. [2024-11-20 17:31:05,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14493 conditions, 3950 events. 1942/3950 cut-off events. For 17431/17847 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 32277 event pairs, 296 based on Foata normal form. 112/3634 useless extension candidates. Maximal degree in co-relation 14452. Up to 981 conditions per place. [2024-11-20 17:31:05,487 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 47 selfloop transitions, 23 changer transitions 19/116 dead transitions. [2024-11-20 17:31:05,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 116 transitions, 1269 flow [2024-11-20 17:31:05,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 17:31:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-20 17:31:05,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 235 transitions. [2024-11-20 17:31:05,488 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5108695652173914 [2024-11-20 17:31:05,488 INFO L175 Difference]: Start difference. First operand has 116 places, 81 transitions, 909 flow. Second operand 10 states and 235 transitions. [2024-11-20 17:31:05,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 116 transitions, 1269 flow [2024-11-20 17:31:05,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 116 transitions, 1179 flow, removed 16 selfloop flow, removed 13 redundant places. [2024-11-20 17:31:05,514 INFO L231 Difference]: Finished difference. Result has 106 places, 79 transitions, 856 flow [2024-11-20 17:31:05,515 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=856, PETRI_PLACES=106, PETRI_TRANSITIONS=79} [2024-11-20 17:31:05,515 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 55 predicate places. [2024-11-20 17:31:05,515 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 79 transitions, 856 flow [2024-11-20 17:31:05,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 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-20 17:31:05,515 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:31:05,515 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:31:05,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-20 17:31:05,516 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:31:05,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:31:05,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1144964386, now seen corresponding path program 13 times [2024-11-20 17:31:05,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:31:05,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353793596] [2024-11-20 17:31:05,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:31:05,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:31:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:31:05,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 17:31:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:31:05,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 17:31:05,678 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 17:31:05,679 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-20 17:31:05,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-20 17:31:05,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-20 17:31:05,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-20 17:31:05,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-20 17:31:05,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-20 17:31:05,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-20 17:31:05,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-20 17:31:05,684 INFO L407 BasicCegarLoop]: Path program histogram: [13, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:31:05,765 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 17:31:05,766 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 17:31:05,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:31:05 BasicIcfg [2024-11-20 17:31:05,770 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 17:31:05,771 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 17:31:05,771 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 17:31:05,771 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 17:31:05,771 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:30:20" (3/4) ... [2024-11-20 17:31:05,773 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 17:31:05,774 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 17:31:05,775 INFO L158 Benchmark]: Toolchain (without parser) took 46890.12ms. Allocated memory was 180.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 121.0MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 333.3MB. Max. memory is 16.1GB. [2024-11-20 17:31:05,776 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 146.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:31:05,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 662.48ms. Allocated memory is still 180.4MB. Free memory was 121.0MB in the beginning and 92.3MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-20 17:31:05,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.50ms. Allocated memory is still 180.4MB. Free memory was 92.3MB in the beginning and 89.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 17:31:05,776 INFO L158 Benchmark]: Boogie Preprocessor took 89.13ms. Allocated memory is still 180.4MB. Free memory was 89.2MB in the beginning and 84.6MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 17:31:05,776 INFO L158 Benchmark]: RCFGBuilder took 907.96ms. Allocated memory was 180.4MB in the beginning and 249.6MB in the end (delta: 69.2MB). Free memory was 84.6MB in the beginning and 164.7MB in the end (delta: -80.1MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. [2024-11-20 17:31:05,777 INFO L158 Benchmark]: TraceAbstraction took 45157.33ms. Allocated memory was 249.6MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 163.7MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 303.3MB. Max. memory is 16.1GB. [2024-11-20 17:31:05,777 INFO L158 Benchmark]: Witness Printer took 3.33ms. Allocated memory is still 2.2GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 17:31:05,779 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.11ms. Allocated memory is still 180.4MB. Free memory is still 146.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 662.48ms. Allocated memory is still 180.4MB. Free memory was 121.0MB in the beginning and 92.3MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.50ms. Allocated memory is still 180.4MB. Free memory was 92.3MB in the beginning and 89.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.13ms. Allocated memory is still 180.4MB. Free memory was 89.2MB in the beginning and 84.6MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 907.96ms. Allocated memory was 180.4MB in the beginning and 249.6MB in the end (delta: 69.2MB). Free memory was 84.6MB in the beginning and 164.7MB in the end (delta: -80.1MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. * TraceAbstraction took 45157.33ms. Allocated memory was 249.6MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 163.7MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 303.3MB. Max. memory is 16.1GB. * Witness Printer took 3.33ms. Allocated memory is still 2.2GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-2, t2538=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-2, t2538=-1, t2539=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L824] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L742] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L772] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-2, t2538=-1, t2539=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-2, t2538=-1, t2539=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-2, t2538=-1, t2539=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L18] 0 __assert_fail ("0", "safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 850]: 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: 852]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 72 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 44.9s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.0s, AutomataDifference: 23.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1401 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1354 mSDsluCounter, 393 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 330 mSDsCounter, 325 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5290 IncrementalHoareTripleChecker+Invalid, 5615 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 325 mSolverCounterUnsat, 63 mSDtfsCounter, 5290 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1405occurred in iteration=12, InterpolantAutomatonStates: 229, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 20.0s InterpolantComputationTime, 708 NumberOfCodeBlocks, 708 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 650 ConstructedInterpolants, 0 QuantifiedInterpolants, 7647 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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-20 17:31:05,802 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 17:31:08,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:31:08,345 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-20 17:31:08,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:31:08,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:31:08,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:31:08,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:31:08,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:31:08,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:31:08,389 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:31:08,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:31:08,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:31:08,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:31:08,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:31:08,392 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:31:08,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:31:08,393 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:31:08,393 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:31:08,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:31:08,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:31:08,394 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:31:08,398 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:31:08,398 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:31:08,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:31:08,399 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:31:08,399 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 17:31:08,399 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:31:08,399 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 17:31:08,400 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:31:08,400 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:31:08,400 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:31:08,401 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:31:08,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:31:08,401 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:31:08,401 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:31:08,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:31:08,402 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:31:08,402 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:31:08,402 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 17:31:08,403 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 17:31:08,403 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:31:08,403 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:31:08,403 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:31:08,403 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:31:08,404 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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2024-11-20 17:31:08,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:31:08,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:31:08,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:31:08,752 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:31:08,752 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:31:08,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-20 17:31:10,276 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:31:10,544 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:31:10,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-20 17:31:10,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3bb3831b/af53dfc5584e4703bbf67eda519f2a85/FLAG89c0827a7 [2024-11-20 17:31:10,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3bb3831b/af53dfc5584e4703bbf67eda519f2a85 [2024-11-20 17:31:10,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:31:10,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:31:10,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:31:10,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:31:10,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:31:10,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:31:10" (1/1) ... [2024-11-20 17:31:10,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e96362e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:10, skipping insertion in model container [2024-11-20 17:31:10,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:31:10" (1/1) ... [2024-11-20 17:31:10,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:31:11,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:31:11,136 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:31:11,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:31:11,238 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:31:11,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:11 WrapperNode [2024-11-20 17:31:11,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:31:11,240 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:31:11,240 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:31:11,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:31:11,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:11" (1/1) ... [2024-11-20 17:31:11,265 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:11" (1/1) ... [2024-11-20 17:31:11,301 INFO L138 Inliner]: procedures = 176, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-11-20 17:31:11,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:31:11,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:31:11,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:31:11,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:31:11,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:11" (1/1) ... [2024-11-20 17:31:11,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:11" (1/1) ... [2024-11-20 17:31:11,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:11" (1/1) ... [2024-11-20 17:31:11,366 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-20 17:31:11,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:11" (1/1) ... [2024-11-20 17:31:11,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:11" (1/1) ... [2024-11-20 17:31:11,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:11" (1/1) ... [2024-11-20 17:31:11,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:11" (1/1) ... [2024-11-20 17:31:11,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:11" (1/1) ... [2024-11-20 17:31:11,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:11" (1/1) ... [2024-11-20 17:31:11,405 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:31:11,406 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:31:11,406 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:31:11,406 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:31:11,407 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:11" (1/1) ... [2024-11-20 17:31:11,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:31:11,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:31:11,450 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-20 17:31:11,457 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-20 17:31:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-20 17:31:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:31:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 17:31:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-20 17:31:11,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-20 17:31:11,505 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-20 17:31:11,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-20 17:31:11,505 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-20 17:31:11,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-20 17:31:11,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-20 17:31:11,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:31:11,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:31:11,508 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 17:31:11,678 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:31:11,679 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:31:12,080 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 17:31:12,080 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:31:12,332 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:31:12,333 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 17:31:12,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:31:12 BoogieIcfgContainer [2024-11-20 17:31:12,334 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:31:12,336 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:31:12,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:31:12,339 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:31:12,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:31:10" (1/3) ... [2024-11-20 17:31:12,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7166fcc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:31:12, skipping insertion in model container [2024-11-20 17:31:12,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:11" (2/3) ... [2024-11-20 17:31:12,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7166fcc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:31:12, skipping insertion in model container [2024-11-20 17:31:12,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:31:12" (3/3) ... [2024-11-20 17:31:12,342 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-20 17:31:12,358 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:31:12,358 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-20 17:31:12,359 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 17:31:12,425 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 17:31:12,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 104 flow [2024-11-20 17:31:12,499 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2024-11-20 17:31:12,499 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:31:12,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 2/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 81 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-11-20 17:31:12,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 46 transitions, 104 flow [2024-11-20 17:31:12,508 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 43 transitions, 95 flow [2024-11-20 17:31:12,520 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:31:12,526 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;@d6fd6d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:31:12,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-20 17:31:12,542 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 17:31:12,542 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2024-11-20 17:31:12,542 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:31:12,542 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:31:12,543 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:31:12,545 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:31:12,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:31:12,550 INFO L85 PathProgramCache]: Analyzing trace with hash 552096453, now seen corresponding path program 1 times [2024-11-20 17:31:12,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:31:12,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723731429] [2024-11-20 17:31:12,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:31:12,564 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-20 17:31:12,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:31:12,566 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-20 17:31:12,567 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-20 17:31:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:31:12,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:31:12,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:31:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:31:12,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:31:12,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:31:12,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723731429] [2024-11-20 17:31:12,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723731429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:31:12,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:31:12,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 17:31:12,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579131202] [2024-11-20 17:31:12,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:31:12,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:31:12,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:31:12,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:31:12,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:31:12,778 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-11-20 17:31:12,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-20 17:31:12,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:31:12,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-11-20 17:31:12,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:31:13,416 INFO L124 PetriNetUnfolderBase]: 1186/2131 cut-off events. [2024-11-20 17:31:13,417 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-20 17:31:13,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3937 conditions, 2131 events. 1186/2131 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 14322 event pairs, 232 based on Foata normal form. 120/2232 useless extension candidates. Maximal degree in co-relation 3926. Up to 1360 conditions per place. [2024-11-20 17:31:13,442 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 33 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-11-20 17:31:13,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 189 flow [2024-11-20 17:31:13,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:31:13,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:31:13,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-11-20 17:31:13,456 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.717391304347826 [2024-11-20 17:31:13,458 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 95 flow. Second operand 3 states and 99 transitions. [2024-11-20 17:31:13,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 189 flow [2024-11-20 17:31:13,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-20 17:31:13,466 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 86 flow [2024-11-20 17:31:13,468 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-11-20 17:31:13,474 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2024-11-20 17:31:13,476 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 86 flow [2024-11-20 17:31:13,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-20 17:31:13,477 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:31:13,477 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:31:13,482 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-20 17:31:13,678 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-20 17:31:13,679 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:31:13,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:31:13,680 INFO L85 PathProgramCache]: Analyzing trace with hash 197062408, now seen corresponding path program 1 times [2024-11-20 17:31:13,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:31:13,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430488283] [2024-11-20 17:31:13,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:31:13,681 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-20 17:31:13,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:31:13,682 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-20 17:31:13,684 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-20 17:31:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:31:13,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:31:13,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:31:13,825 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-20 17:31:13,826 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:31:13,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:31:13,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430488283] [2024-11-20 17:31:13,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430488283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:31:13,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:31:13,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:31:13,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051257099] [2024-11-20 17:31:13,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:31:13,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:31:13,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:31:13,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:31:13,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:31:13,837 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-11-20 17:31:13,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:31:13,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:31:13,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-11-20 17:31:13,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:31:14,521 INFO L124 PetriNetUnfolderBase]: 2223/3712 cut-off events. [2024-11-20 17:31:14,521 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2024-11-20 17:31:14,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7270 conditions, 3712 events. 2223/3712 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 24199 event pairs, 231 based on Foata normal form. 120/3815 useless extension candidates. Maximal degree in co-relation 7260. Up to 2171 conditions per place. [2024-11-20 17:31:14,544 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 47 selfloop transitions, 5 changer transitions 1/65 dead transitions. [2024-11-20 17:31:14,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 65 transitions, 254 flow [2024-11-20 17:31:14,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:31:14,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 17:31:14,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2024-11-20 17:31:14,547 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-11-20 17:31:14,547 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 86 flow. Second operand 4 states and 115 transitions. [2024-11-20 17:31:14,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 65 transitions, 254 flow [2024-11-20 17:31:14,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 17:31:14,553 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 116 flow [2024-11-20 17:31:14,554 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2024-11-20 17:31:14,555 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2024-11-20 17:31:14,555 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 116 flow [2024-11-20 17:31:14,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:31:14,556 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:31:14,557 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:31:14,563 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-20 17:31:14,757 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-20 17:31:14,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:31:14,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:31:14,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1019353847, now seen corresponding path program 1 times [2024-11-20 17:31:14,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:31:14,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468088039] [2024-11-20 17:31:14,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:31:14,760 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-20 17:31:14,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:31:14,762 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-20 17:31:14,763 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-20 17:31:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:31:14,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:31:14,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:31:14,908 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-20 17:31:14,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:31:14,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:31:14,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468088039] [2024-11-20 17:31:14,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468088039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:31:14,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:31:14,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:31:14,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652061999] [2024-11-20 17:31:14,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:31:14,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:31:14,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:31:14,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:31:14,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:31:14,919 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-11-20 17:31:14,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:31:14,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:31:14,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-11-20 17:31:14,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:31:15,365 INFO L124 PetriNetUnfolderBase]: 1293/2186 cut-off events. [2024-11-20 17:31:15,366 INFO L125 PetriNetUnfolderBase]: For 482/482 co-relation queries the response was YES. [2024-11-20 17:31:15,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4892 conditions, 2186 events. 1293/2186 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 12311 event pairs, 129 based on Foata normal form. 96/2265 useless extension candidates. Maximal degree in co-relation 4880. Up to 897 conditions per place. [2024-11-20 17:31:15,380 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 59 selfloop transitions, 8 changer transitions 1/80 dead transitions. [2024-11-20 17:31:15,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 80 transitions, 351 flow [2024-11-20 17:31:15,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:31:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:31:15,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2024-11-20 17:31:15,383 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6304347826086957 [2024-11-20 17:31:15,383 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 116 flow. Second operand 5 states and 145 transitions. [2024-11-20 17:31:15,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 80 transitions, 351 flow [2024-11-20 17:31:15,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 80 transitions, 341 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-20 17:31:15,386 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 156 flow [2024-11-20 17:31:15,386 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2024-11-20 17:31:15,387 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2024-11-20 17:31:15,387 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 156 flow [2024-11-20 17:31:15,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:31:15,387 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:31:15,388 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:31:15,393 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 (4)] Ended with exit code 0 [2024-11-20 17:31:15,588 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-20 17:31:15,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:31:15,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:31:15,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1760586442, now seen corresponding path program 1 times [2024-11-20 17:31:15,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:31:15,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435445458] [2024-11-20 17:31:15,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:31:15,590 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-20 17:31:15,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:31:15,594 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-20 17:31:15,595 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-20 17:31:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:31:15,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:31:15,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:31:15,763 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-20 17:31:15,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:31:15,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:31:15,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435445458] [2024-11-20 17:31:15,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435445458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:31:15,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:31:15,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:31:15,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204436108] [2024-11-20 17:31:15,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:31:15,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:31:15,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:31:15,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:31:15,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:31:15,773 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-11-20 17:31:15,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:31:15,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:31:15,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-11-20 17:31:15,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:31:16,232 INFO L124 PetriNetUnfolderBase]: 695/1140 cut-off events. [2024-11-20 17:31:16,232 INFO L125 PetriNetUnfolderBase]: For 856/856 co-relation queries the response was YES. [2024-11-20 17:31:16,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2920 conditions, 1140 events. 695/1140 cut-off events. For 856/856 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5327 event pairs, 109 based on Foata normal form. 44/1167 useless extension candidates. Maximal degree in co-relation 2906. Up to 364 conditions per place. [2024-11-20 17:31:16,240 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 51 selfloop transitions, 11 changer transitions 1/75 dead transitions. [2024-11-20 17:31:16,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 354 flow [2024-11-20 17:31:16,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:31:16,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:31:16,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2024-11-20 17:31:16,242 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5615942028985508 [2024-11-20 17:31:16,243 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 156 flow. Second operand 6 states and 155 transitions. [2024-11-20 17:31:16,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 354 flow [2024-11-20 17:31:16,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 75 transitions, 329 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-20 17:31:16,253 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 170 flow [2024-11-20 17:31:16,254 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2024-11-20 17:31:16,254 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2024-11-20 17:31:16,255 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 170 flow [2024-11-20 17:31:16,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:31:16,256 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:31:16,256 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:31:16,262 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 (5)] Forceful destruction successful, exit code 0 [2024-11-20 17:31:16,456 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-20 17:31:16,457 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:31:16,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:31:16,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1033267823, now seen corresponding path program 1 times [2024-11-20 17:31:16,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:31:16,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26517103] [2024-11-20 17:31:16,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:31:16,458 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-20 17:31:16,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:31:16,461 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-20 17:31:16,462 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-20 17:31:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:31:16,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:31:16,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:31:16,629 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-20 17:31:16,629 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:31:16,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:31:16,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26517103] [2024-11-20 17:31:16,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26517103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:31:16,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:31:16,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 17:31:16,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881432635] [2024-11-20 17:31:16,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:31:16,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:31:16,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:31:16,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:31:16,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:31:16,635 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-20 17:31:16,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:31:16,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:31:16,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-20 17:31:16,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:31:16,781 INFO L124 PetriNetUnfolderBase]: 385/713 cut-off events. [2024-11-20 17:31:16,782 INFO L125 PetriNetUnfolderBase]: For 288/295 co-relation queries the response was YES. [2024-11-20 17:31:16,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1631 conditions, 713 events. 385/713 cut-off events. For 288/295 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3661 event pairs, 357 based on Foata normal form. 8/667 useless extension candidates. Maximal degree in co-relation 1616. Up to 588 conditions per place. [2024-11-20 17:31:16,787 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 20 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2024-11-20 17:31:16,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 43 transitions, 212 flow [2024-11-20 17:31:16,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:31:16,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:31:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-11-20 17:31:16,789 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5579710144927537 [2024-11-20 17:31:16,789 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 170 flow. Second operand 3 states and 77 transitions. [2024-11-20 17:31:16,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 43 transitions, 212 flow [2024-11-20 17:31:16,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 156 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-20 17:31:16,792 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 112 flow [2024-11-20 17:31:16,793 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2024-11-20 17:31:16,793 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2024-11-20 17:31:16,794 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 112 flow [2024-11-20 17:31:16,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:31:16,794 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:31:16,794 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:31:16,801 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-20 17:31:16,995 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-20 17:31:16,995 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:31:16,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:31:16,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1008187964, now seen corresponding path program 1 times [2024-11-20 17:31:16,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:31:16,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317485656] [2024-11-20 17:31:16,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:31:16,997 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-20 17:31:16,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:31:17,000 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-20 17:31:17,002 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-20 17:31:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:31:17,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:31:17,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:31:17,447 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-20 17:31:17,447 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:31:17,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:31:17,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317485656] [2024-11-20 17:31:17,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317485656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:31:17,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:31:17,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 17:31:17,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028455833] [2024-11-20 17:31:17,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:31:17,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:31:17,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:31:17,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:31:17,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:31:17,454 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-20 17:31:17,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 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-20 17:31:17,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:31:17,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-20 17:31:17,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:31:17,725 INFO L124 PetriNetUnfolderBase]: 821/1518 cut-off events. [2024-11-20 17:31:17,725 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:31:17,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2992 conditions, 1518 events. 821/1518 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8596 event pairs, 415 based on Foata normal form. 8/1475 useless extension candidates. Maximal degree in co-relation 2985. Up to 751 conditions per place. [2024-11-20 17:31:17,733 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 28 selfloop transitions, 2 changer transitions 13/62 dead transitions. [2024-11-20 17:31:17,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 238 flow [2024-11-20 17:31:17,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:31:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:31:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2024-11-20 17:31:17,735 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5608695652173913 [2024-11-20 17:31:17,735 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 112 flow. Second operand 5 states and 129 transitions. [2024-11-20 17:31:17,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 238 flow [2024-11-20 17:31:17,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 62 transitions, 237 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:31:17,737 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 123 flow [2024-11-20 17:31:17,737 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-11-20 17:31:17,738 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2024-11-20 17:31:17,738 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 123 flow [2024-11-20 17:31:17,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 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-20 17:31:17,738 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:31:17,739 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:31:17,744 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-20 17:31:17,939 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-20 17:31:17,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:31:17,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:31:17,940 INFO L85 PathProgramCache]: Analyzing trace with hash -176889702, now seen corresponding path program 2 times [2024-11-20 17:31:17,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:31:17,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445396776] [2024-11-20 17:31:17,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 17:31:17,941 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-20 17:31:17,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:31:17,943 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-20 17:31:17,944 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-20 17:31:18,056 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 17:31:18,056 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:31:18,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 17:31:18,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:31:18,450 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-20 17:31:18,450 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:31:18,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:31:18,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445396776] [2024-11-20 17:31:18,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445396776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:31:18,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:31:18,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 17:31:18,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593854860] [2024-11-20 17:31:18,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:31:18,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 17:31:18,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:31:18,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 17:31:18,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 17:31:18,468 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-20 17:31:18,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 123 flow. Second operand has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 9 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:31:18,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:31:18,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-20 17:31:18,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:31:18,901 INFO L124 PetriNetUnfolderBase]: 729/1423 cut-off events. [2024-11-20 17:31:18,901 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-20 17:31:18,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2827 conditions, 1423 events. 729/1423 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8315 event pairs, 154 based on Foata normal form. 8/1362 useless extension candidates. Maximal degree in co-relation 2817. Up to 389 conditions per place. [2024-11-20 17:31:18,910 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 33 selfloop transitions, 7 changer transitions 28/88 dead transitions. [2024-11-20 17:31:18,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 88 transitions, 355 flow [2024-11-20 17:31:18,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 17:31:18,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-20 17:31:18,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 231 transitions. [2024-11-20 17:31:18,912 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5579710144927537 [2024-11-20 17:31:18,912 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 123 flow. Second operand 9 states and 231 transitions. [2024-11-20 17:31:18,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 88 transitions, 355 flow [2024-11-20 17:31:18,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 88 transitions, 341 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-20 17:31:18,918 INFO L231 Difference]: Finished difference. Result has 62 places, 46 transitions, 164 flow [2024-11-20 17:31:18,919 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=164, PETRI_PLACES=62, PETRI_TRANSITIONS=46} [2024-11-20 17:31:18,920 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2024-11-20 17:31:18,921 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 164 flow [2024-11-20 17:31:18,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.11111111111111) internal successors, (181), 9 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:31:18,922 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:31:18,922 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:31:18,928 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-20 17:31:19,122 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-20 17:31:19,123 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:31:19,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:31:19,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1845011280, now seen corresponding path program 3 times [2024-11-20 17:31:19,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:31:19,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940942832] [2024-11-20 17:31:19,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 17:31:19,125 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-20 17:31:19,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:31:19,128 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-20 17:31:19,129 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-20 17:31:19,231 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-20 17:31:19,232 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:31:19,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-20 17:31:19,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:31:19,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:31:19,612 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:31:19,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:31:19,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [940942832] [2024-11-20 17:31:19,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [940942832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:31:19,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:31:19,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 17:31:19,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302173644] [2024-11-20 17:31:19,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:31:19,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 17:31:19,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:31:19,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 17:31:19,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:31:19,626 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-20 17:31:19,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 transitions, 164 flow. Second operand has 10 states, 10 states have (on average 19.9) internal successors, (199), 10 states have internal predecessors, (199), 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-20 17:31:19,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:31:19,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-20 17:31:19,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:31:20,046 INFO L124 PetriNetUnfolderBase]: 780/1514 cut-off events. [2024-11-20 17:31:20,046 INFO L125 PetriNetUnfolderBase]: For 464/518 co-relation queries the response was YES. [2024-11-20 17:31:20,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3494 conditions, 1514 events. 780/1514 cut-off events. For 464/518 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 8795 event pairs, 266 based on Foata normal form. 12/1421 useless extension candidates. Maximal degree in co-relation 3481. Up to 651 conditions per place. [2024-11-20 17:31:20,057 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 31 selfloop transitions, 8 changer transitions 31/90 dead transitions. [2024-11-20 17:31:20,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 90 transitions, 456 flow [2024-11-20 17:31:20,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 17:31:20,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-20 17:31:20,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 227 transitions. [2024-11-20 17:31:20,059 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5483091787439613 [2024-11-20 17:31:20,059 INFO L175 Difference]: Start difference. First operand has 62 places, 46 transitions, 164 flow. Second operand 9 states and 227 transitions. [2024-11-20 17:31:20,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 90 transitions, 456 flow [2024-11-20 17:31:20,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 90 transitions, 403 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-11-20 17:31:20,063 INFO L231 Difference]: Finished difference. Result has 65 places, 52 transitions, 211 flow [2024-11-20 17:31:20,063 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=211, PETRI_PLACES=65, PETRI_TRANSITIONS=52} [2024-11-20 17:31:20,064 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2024-11-20 17:31:20,064 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 52 transitions, 211 flow [2024-11-20 17:31:20,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.9) internal successors, (199), 10 states have internal predecessors, (199), 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-20 17:31:20,064 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:31:20,064 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:31:20,069 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-20 17:31:20,264 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-20 17:31:20,265 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:31:20,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:31:20,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1751292220, now seen corresponding path program 4 times [2024-11-20 17:31:20,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:31:20,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1370250935] [2024-11-20 17:31:20,266 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-20 17:31:20,266 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-20 17:31:20,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:31:20,270 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-20 17:31:20,272 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-20 17:31:20,374 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-20 17:31:20,374 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:31:20,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-20 17:31:20,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:31:21,333 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-20 17:31:21,333 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:31:21,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:31:21,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1370250935] [2024-11-20 17:31:21,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1370250935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:31:21,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:31:21,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 17:31:21,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812760109] [2024-11-20 17:31:21,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:31:21,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 17:31:21,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:31:21,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 17:31:21,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 17:31:21,345 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-20 17:31:21,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 52 transitions, 211 flow. Second operand has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 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-20 17:31:21,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:31:21,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-20 17:31:21,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:31:21,808 INFO L124 PetriNetUnfolderBase]: 793/1577 cut-off events. [2024-11-20 17:31:21,808 INFO L125 PetriNetUnfolderBase]: For 739/941 co-relation queries the response was YES. [2024-11-20 17:31:21,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3940 conditions, 1577 events. 793/1577 cut-off events. For 739/941 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9467 event pairs, 209 based on Foata normal form. 23/1511 useless extension candidates. Maximal degree in co-relation 3925. Up to 560 conditions per place. [2024-11-20 17:31:21,820 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 38 selfloop transitions, 22 changer transitions 29/109 dead transitions. [2024-11-20 17:31:21,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 109 transitions, 621 flow [2024-11-20 17:31:21,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 17:31:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-20 17:31:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 278 transitions. [2024-11-20 17:31:21,822 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.549407114624506 [2024-11-20 17:31:21,822 INFO L175 Difference]: Start difference. First operand has 65 places, 52 transitions, 211 flow. Second operand 11 states and 278 transitions. [2024-11-20 17:31:21,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 109 transitions, 621 flow [2024-11-20 17:31:21,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 109 transitions, 569 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-11-20 17:31:21,826 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 339 flow [2024-11-20 17:31:21,827 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=339, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2024-11-20 17:31:21,827 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 21 predicate places. [2024-11-20 17:31:21,827 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 339 flow [2024-11-20 17:31:21,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 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-20 17:31:21,828 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:31:21,828 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:31:21,833 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-20 17:31:22,028 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-20 17:31:22,029 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:31:22,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:31:22,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1956225490, now seen corresponding path program 5 times [2024-11-20 17:31:22,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:31:22,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687144926] [2024-11-20 17:31:22,030 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 17:31:22,030 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-20 17:31:22,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:31:22,032 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-20 17:31:22,033 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-20 17:31:22,135 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 17:31:22,135 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:31:22,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 17:31:22,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:31:22,307 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-20 17:31:22,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:31:22,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:31:22,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687144926] [2024-11-20 17:31:22,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687144926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:31:22,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:31:22,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 17:31:22,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051555908] [2024-11-20 17:31:22,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:31:22,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 17:31:22,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:31:22,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 17:31:22,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 17:31:22,321 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-20 17:31:22,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 339 flow. Second operand has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 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-20 17:31:22,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:31:22,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-20 17:31:22,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:31:22,704 INFO L124 PetriNetUnfolderBase]: 735/1427 cut-off events. [2024-11-20 17:31:22,704 INFO L125 PetriNetUnfolderBase]: For 1338/1690 co-relation queries the response was YES. [2024-11-20 17:31:22,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3945 conditions, 1427 events. 735/1427 cut-off events. For 1338/1690 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8293 event pairs, 301 based on Foata normal form. 36/1367 useless extension candidates. Maximal degree in co-relation 3927. Up to 803 conditions per place. [2024-11-20 17:31:22,715 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 44 selfloop transitions, 15 changer transitions 24/103 dead transitions. [2024-11-20 17:31:22,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 103 transitions, 698 flow [2024-11-20 17:31:22,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 17:31:22,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-20 17:31:22,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 221 transitions. [2024-11-20 17:31:22,717 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.533816425120773 [2024-11-20 17:31:22,717 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 339 flow. Second operand 9 states and 221 transitions. [2024-11-20 17:31:22,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 103 transitions, 698 flow [2024-11-20 17:31:22,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 103 transitions, 648 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-11-20 17:31:22,721 INFO L231 Difference]: Finished difference. Result has 78 places, 70 transitions, 426 flow [2024-11-20 17:31:22,721 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=426, PETRI_PLACES=78, PETRI_TRANSITIONS=70} [2024-11-20 17:31:22,722 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 27 predicate places. [2024-11-20 17:31:22,722 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 70 transitions, 426 flow [2024-11-20 17:31:22,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 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-20 17:31:22,722 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:31:22,723 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:31:22,727 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-20 17:31:22,923 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-20 17:31:22,923 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:31:22,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:31:22,924 INFO L85 PathProgramCache]: Analyzing trace with hash -9439870, now seen corresponding path program 6 times [2024-11-20 17:31:22,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:31:22,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573482068] [2024-11-20 17:31:22,924 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-20 17:31:22,924 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-20 17:31:22,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:31:22,925 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-20 17:31:22,926 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-20 17:31:23,023 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-20 17:31:23,024 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:31:23,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-20 17:31:23,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:31:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:31:23,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:31:23,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:31:23,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573482068] [2024-11-20 17:31:23,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573482068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:31:23,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:31:23,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 17:31:23,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079473152] [2024-11-20 17:31:23,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:31:23,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 17:31:23,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:31:23,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 17:31:23,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:31:23,444 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-20 17:31:23,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 70 transitions, 426 flow. Second operand has 10 states, 10 states have (on average 19.9) internal successors, (199), 10 states have internal predecessors, (199), 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-20 17:31:23,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:31:23,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-20 17:31:23,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:31:23,852 INFO L124 PetriNetUnfolderBase]: 841/1612 cut-off events. [2024-11-20 17:31:23,852 INFO L125 PetriNetUnfolderBase]: For 2120/2372 co-relation queries the response was YES. [2024-11-20 17:31:23,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4582 conditions, 1612 events. 841/1612 cut-off events. For 2120/2372 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 9577 event pairs, 290 based on Foata normal form. 42/1536 useless extension candidates. Maximal degree in co-relation 4560. Up to 835 conditions per place. [2024-11-20 17:31:23,869 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 52 selfloop transitions, 6 changer transitions 34/112 dead transitions. [2024-11-20 17:31:23,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 112 transitions, 818 flow [2024-11-20 17:31:23,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 17:31:23,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-20 17:31:23,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2024-11-20 17:31:23,872 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5410628019323671 [2024-11-20 17:31:23,872 INFO L175 Difference]: Start difference. First operand has 78 places, 70 transitions, 426 flow. Second operand 9 states and 224 transitions. [2024-11-20 17:31:23,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 112 transitions, 818 flow [2024-11-20 17:31:23,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 112 transitions, 793 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-11-20 17:31:23,879 INFO L231 Difference]: Finished difference. Result has 81 places, 71 transitions, 451 flow [2024-11-20 17:31:23,879 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=451, PETRI_PLACES=81, PETRI_TRANSITIONS=71} [2024-11-20 17:31:23,879 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 30 predicate places. [2024-11-20 17:31:23,880 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 71 transitions, 451 flow [2024-11-20 17:31:23,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.9) internal successors, (199), 10 states have internal predecessors, (199), 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-20 17:31:23,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:31:23,880 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:31:23,885 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-20 17:31:24,081 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-20 17:31:24,081 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:31:24,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:31:24,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1923950336, now seen corresponding path program 7 times [2024-11-20 17:31:24,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:31:24,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019222343] [2024-11-20 17:31:24,082 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-20 17:31:24,082 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-20 17:31:24,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:31:24,083 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-20 17:31:24,084 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-20 17:31:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:31:24,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 17:31:24,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:31:24,381 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-20 17:31:24,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:31:24,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:31:24,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019222343] [2024-11-20 17:31:24,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1019222343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:31:24,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:31:24,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 17:31:24,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468320366] [2024-11-20 17:31:24,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:31:24,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 17:31:24,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:31:24,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 17:31:24,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:31:24,394 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-20 17:31:24,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 71 transitions, 451 flow. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:31:24,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:31:24,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-20 17:31:24,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:31:24,657 INFO L124 PetriNetUnfolderBase]: 716/1370 cut-off events. [2024-11-20 17:31:24,658 INFO L125 PetriNetUnfolderBase]: For 1892/2105 co-relation queries the response was YES. [2024-11-20 17:31:24,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3962 conditions, 1370 events. 716/1370 cut-off events. For 1892/2105 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 7787 event pairs, 223 based on Foata normal form. 31/1295 useless extension candidates. Maximal degree in co-relation 3939. Up to 831 conditions per place. [2024-11-20 17:31:24,665 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 38 selfloop transitions, 16 changer transitions 16/90 dead transitions. [2024-11-20 17:31:24,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 90 transitions, 660 flow [2024-11-20 17:31:24,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:31:24,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:31:24,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2024-11-20 17:31:24,667 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5579710144927537 [2024-11-20 17:31:24,667 INFO L175 Difference]: Start difference. First operand has 81 places, 71 transitions, 451 flow. Second operand 6 states and 154 transitions. [2024-11-20 17:31:24,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 90 transitions, 660 flow [2024-11-20 17:31:24,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 90 transitions, 635 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-11-20 17:31:24,673 INFO L231 Difference]: Finished difference. Result has 78 places, 68 transitions, 459 flow [2024-11-20 17:31:24,673 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=459, PETRI_PLACES=78, PETRI_TRANSITIONS=68} [2024-11-20 17:31:24,674 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 27 predicate places. [2024-11-20 17:31:24,674 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 68 transitions, 459 flow [2024-11-20 17:31:24,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:31:24,674 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:31:24,674 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:31:24,681 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 (13)] Forceful destruction successful, exit code 0 [2024-11-20 17:31:24,878 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-20 17:31:24,879 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-20 17:31:24,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:31:24,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1631443328, now seen corresponding path program 8 times [2024-11-20 17:31:24,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:31:24,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402547533] [2024-11-20 17:31:24,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 17:31:24,880 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-20 17:31:24,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:31:24,881 INFO L229 MonitoredProcess]: Starting monitored process 14 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-20 17:31:24,882 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 (14)] Waiting until timeout for monitored process [2024-11-20 17:31:24,960 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 17:31:24,961 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:31:24,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 17:31:24,964 INFO L278 TraceCheckSpWp]: Computing forward predicates...