./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_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 740668a6bdee7f1177df0d0d81e76f2a2521fb58ce5f63a4942f3d36e11f9dad --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:36:43,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:36:43,993 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:36:43,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:36:43,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:36:44,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:36:44,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:36:44,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:36:44,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:36:44,032 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:36:44,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:36:44,033 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:36:44,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:36:44,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:36:44,035 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:36:44,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:36:44,036 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:36:44,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:36:44,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:36:44,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:36:44,036 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:36:44,037 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:36:44,037 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:36:44,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:36:44,041 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:36:44,041 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:36:44,041 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:36:44,042 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:36:44,042 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:36:44,042 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:36:44,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:36:44,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:36:44,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:36:44,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:36:44,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:36:44,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:36:44,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:36:44,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:36:44,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:36:44,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:36:44,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:36:44,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:36:44,046 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 -> 740668a6bdee7f1177df0d0d81e76f2a2521fb58ce5f63a4942f3d36e11f9dad [2024-11-09 10:36:44,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:36:44,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:36:44,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:36:44,338 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:36:44,338 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:36:44,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2024-11-09 10:36:45,762 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:36:46,032 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:36:46,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2024-11-09 10:36:46,053 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a24453700/fff94cd67f1842878d1958323443fb22/FLAG50e39334a [2024-11-09 10:36:46,069 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a24453700/fff94cd67f1842878d1958323443fb22 [2024-11-09 10:36:46,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:36:46,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:36:46,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:36:46,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:36:46,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:36:46,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:36:46" (1/1) ... [2024-11-09 10:36:46,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b9d6525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:36:46, skipping insertion in model container [2024-11-09 10:36:46,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:36:46" (1/1) ... [2024-11-09 10:36:46,131 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:36:46,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:36:46,549 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:36:46,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:36:46,779 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:36:46,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:36:46 WrapperNode [2024-11-09 10:36:46,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:36:46,781 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:36:46,781 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:36:46,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:36:46,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:36:46" (1/1) ... [2024-11-09 10:36:46,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:36:46" (1/1) ... [2024-11-09 10:36:46,857 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-11-09 10:36:46,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:36:46,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:36:46,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:36:46,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:36:46,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:36:46" (1/1) ... [2024-11-09 10:36:46,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:36:46" (1/1) ... [2024-11-09 10:36:46,875 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:36:46" (1/1) ... [2024-11-09 10:36:46,896 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-09 10:36:46,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:36:46" (1/1) ... [2024-11-09 10:36:46,899 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:36:46" (1/1) ... [2024-11-09 10:36:46,909 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:36:46" (1/1) ... [2024-11-09 10:36:46,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:36:46" (1/1) ... [2024-11-09 10:36:46,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:36:46" (1/1) ... [2024-11-09 10:36:46,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:36:46" (1/1) ... [2024-11-09 10:36:46,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:36:46,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:36:46,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:36:46,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:36:46,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:36:46" (1/1) ... [2024-11-09 10:36:46,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:36:46,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:36:46,960 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-09 10:36:46,966 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-09 10:36:47,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:36:47,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:36:47,017 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-09 10:36:47,017 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-09 10:36:47,017 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-09 10:36:47,017 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-09 10:36:47,017 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-09 10:36:47,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-09 10:36:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:36:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:36:47,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:36:47,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:36:47,020 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:36:47,186 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:36:47,188 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:36:47,504 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:36:47,504 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:36:47,684 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:36:47,685 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:36:47,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:36:47 BoogieIcfgContainer [2024-11-09 10:36:47,686 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:36:47,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:36:47,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:36:47,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:36:47,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:36:46" (1/3) ... [2024-11-09 10:36:47,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbfe732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:36:47, skipping insertion in model container [2024-11-09 10:36:47,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:36:46" (2/3) ... [2024-11-09 10:36:47,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbfe732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:36:47, skipping insertion in model container [2024-11-09 10:36:47,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:36:47" (3/3) ... [2024-11-09 10:36:47,693 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.opt_pso.opt_rmo.opt.i [2024-11-09 10:36:47,707 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:36:47,707 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 10:36:47,707 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:36:47,782 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:36:47,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2024-11-09 10:36:47,851 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2024-11-09 10:36:47,852 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:36:47,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-11-09 10:36:47,856 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2024-11-09 10:36:47,860 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2024-11-09 10:36:47,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:36:47,881 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;@57400430, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:36:47,882 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:36:47,890 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:36:47,891 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-11-09 10:36:47,891 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:36:47,891 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:36:47,892 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:36:47,892 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-09 10:36:47,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:36:47,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1143059156, now seen corresponding path program 1 times [2024-11-09 10:36:47,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:36:47,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766026206] [2024-11-09 10:36:47,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:36:47,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:36:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:36:48,404 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-09 10:36:48,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:36:48,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766026206] [2024-11-09 10:36:48,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766026206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:36:48,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:36:48,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:36:48,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195593671] [2024-11-09 10:36:48,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:36:48,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:36:48,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:36:48,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:36:48,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:36:48,448 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 45 [2024-11-09 10:36:48,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-09 10:36:48,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:36:48,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 45 [2024-11-09 10:36:48,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:36:48,760 INFO L124 PetriNetUnfolderBase]: 407/744 cut-off events. [2024-11-09 10:36:48,761 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:36:48,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1407 conditions, 744 events. 407/744 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4371 event pairs, 128 based on Foata normal form. 48/778 useless extension candidates. Maximal degree in co-relation 1396. Up to 496 conditions per place. [2024-11-09 10:36:48,772 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 27 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2024-11-09 10:36:48,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 49 transitions, 169 flow [2024-11-09 10:36:48,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:36:48,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:36:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-11-09 10:36:48,784 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2024-11-09 10:36:48,786 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 99 transitions. [2024-11-09 10:36:48,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 49 transitions, 169 flow [2024-11-09 10:36:48,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:36:48,792 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2024-11-09 10:36:48,794 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, 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=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-09 10:36:48,799 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2024-11-09 10:36:48,800 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2024-11-09 10:36:48,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-09 10:36:48,801 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:36:48,801 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:36:48,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:36:48,801 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-09 10:36:48,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:36:48,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1459971501, now seen corresponding path program 1 times [2024-11-09 10:36:48,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:36:48,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459042393] [2024-11-09 10:36:48,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:36:48,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:36:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:36:48,910 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-09 10:36:48,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:36:48,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459042393] [2024-11-09 10:36:48,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459042393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:36:48,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:36:48,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:36:48,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312581926] [2024-11-09 10:36:48,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:36:48,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:36:48,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:36:48,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:36:48,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:36:48,916 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-11-09 10:36:48,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 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-09 10:36:48,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:36:48,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-11-09 10:36:48,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:36:49,102 INFO L124 PetriNetUnfolderBase]: 361/698 cut-off events. [2024-11-09 10:36:49,103 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 10:36:49,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 698 events. 361/698 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4849 event pairs, 361 based on Foata normal form. 24/695 useless extension candidates. Maximal degree in co-relation 1328. Up to 570 conditions per place. [2024-11-09 10:36:49,111 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 17 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2024-11-09 10:36:49,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 120 flow [2024-11-09 10:36:49,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:36:49,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:36:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-09 10:36:49,114 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-11-09 10:36:49,114 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 80 transitions. [2024-11-09 10:36:49,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 120 flow [2024-11-09 10:36:49,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:36:49,118 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2024-11-09 10:36:49,118 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-11-09 10:36:49,119 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2024-11-09 10:36:49,120 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2024-11-09 10:36:49,120 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-09 10:36:49,121 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:36:49,121 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:36:49,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:36:49,121 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-09 10:36:49,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:36:49,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1459972987, now seen corresponding path program 1 times [2024-11-09 10:36:49,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:36:49,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785050436] [2024-11-09 10:36:49,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:36:49,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:36:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:36:50,069 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-09 10:36:50,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:36:50,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785050436] [2024-11-09 10:36:50,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785050436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:36:50,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:36:50,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:36:50,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873556810] [2024-11-09 10:36:50,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:36:50,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:36:50,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:36:50,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:36:50,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:36:50,089 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-09 10:36:50,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 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-09 10:36:50,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:36:50,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-09 10:36:50,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:36:50,904 INFO L124 PetriNetUnfolderBase]: 1575/2655 cut-off events. [2024-11-09 10:36:50,905 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:36:50,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5051 conditions, 2655 events. 1575/2655 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 17252 event pairs, 463 based on Foata normal form. 0/2584 useless extension candidates. Maximal degree in co-relation 5045. Up to 1298 conditions per place. [2024-11-09 10:36:50,920 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 35 selfloop transitions, 9 changer transitions 64/121 dead transitions. [2024-11-09 10:36:50,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 121 transitions, 470 flow [2024-11-09 10:36:50,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:36:50,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 10:36:50,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 315 transitions. [2024-11-09 10:36:50,926 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-11-09 10:36:50,926 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 12 states and 315 transitions. [2024-11-09 10:36:50,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 121 transitions, 470 flow [2024-11-09 10:36:50,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 121 transitions, 469 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:36:50,931 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 161 flow [2024-11-09 10:36:50,931 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=161, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2024-11-09 10:36:50,932 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2024-11-09 10:36:50,933 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 41 transitions, 161 flow [2024-11-09 10:36:50,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 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-09 10:36:50,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:36:50,934 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:36:50,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:36:50,934 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-09 10:36:50,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:36:50,935 INFO L85 PathProgramCache]: Analyzing trace with hash -844283526, now seen corresponding path program 1 times [2024-11-09 10:36:50,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:36:50,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450069812] [2024-11-09 10:36:50,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:36:50,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:36:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:36:51,371 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-09 10:36:51,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:36:51,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450069812] [2024-11-09 10:36:51,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450069812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:36:51,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:36:51,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:36:51,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360091631] [2024-11-09 10:36:51,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:36:51,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:36:51,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:36:51,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:36:51,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:36:51,376 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-11-09 10:36:51,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 41 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-09 10:36:51,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:36:51,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-11-09 10:36:51,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:36:51,863 INFO L124 PetriNetUnfolderBase]: 1203/2248 cut-off events. [2024-11-09 10:36:51,864 INFO L125 PetriNetUnfolderBase]: For 4094/4248 co-relation queries the response was YES. [2024-11-09 10:36:51,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6914 conditions, 2248 events. 1203/2248 cut-off events. For 4094/4248 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 15624 event pairs, 456 based on Foata normal form. 96/2234 useless extension candidates. Maximal degree in co-relation 6898. Up to 1316 conditions per place. [2024-11-09 10:36:51,887 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 27 selfloop transitions, 3 changer transitions 27/76 dead transitions. [2024-11-09 10:36:51,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 76 transitions, 409 flow [2024-11-09 10:36:51,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:36:51,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:36:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2024-11-09 10:36:51,889 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2024-11-09 10:36:51,889 INFO L175 Difference]: Start difference. First operand has 63 places, 41 transitions, 161 flow. Second operand 7 states and 185 transitions. [2024-11-09 10:36:51,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 76 transitions, 409 flow [2024-11-09 10:36:51,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 76 transitions, 379 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-11-09 10:36:51,923 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 182 flow [2024-11-09 10:36:51,924 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2024-11-09 10:36:51,924 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2024-11-09 10:36:51,926 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 182 flow [2024-11-09 10:36:51,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-09 10:36:51,927 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:36:51,927 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:36:51,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:36:51,927 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-09 10:36:51,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:36:51,927 INFO L85 PathProgramCache]: Analyzing trace with hash 695422254, now seen corresponding path program 1 times [2024-11-09 10:36:51,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:36:51,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102635067] [2024-11-09 10:36:51,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:36:51,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:36:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:36:52,589 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-09 10:36:52,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:36:52,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102635067] [2024-11-09 10:36:52,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102635067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:36:52,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:36:52,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:36:52,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726772949] [2024-11-09 10:36:52,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:36:52,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:36:52,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:36:52,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:36:52,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:36:52,606 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-09 10:36:52,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 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-09 10:36:52,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:36:52,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-09 10:36:52,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:36:53,231 INFO L124 PetriNetUnfolderBase]: 1847/3285 cut-off events. [2024-11-09 10:36:53,231 INFO L125 PetriNetUnfolderBase]: For 5384/5388 co-relation queries the response was YES. [2024-11-09 10:36:53,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10660 conditions, 3285 events. 1847/3285 cut-off events. For 5384/5388 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 22995 event pairs, 519 based on Foata normal form. 85/3344 useless extension candidates. Maximal degree in co-relation 10642. Up to 1267 conditions per place. [2024-11-09 10:36:53,260 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 41 selfloop transitions, 10 changer transitions 29/94 dead transitions. [2024-11-09 10:36:53,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 94 transitions, 594 flow [2024-11-09 10:36:53,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:36:53,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:36:53,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2024-11-09 10:36:53,262 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-11-09 10:36:53,262 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 182 flow. Second operand 8 states and 210 transitions. [2024-11-09 10:36:53,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 94 transitions, 594 flow [2024-11-09 10:36:53,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 94 transitions, 578 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-09 10:36:53,274 INFO L231 Difference]: Finished difference. Result has 66 places, 48 transitions, 254 flow [2024-11-09 10:36:53,275 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=254, PETRI_PLACES=66, PETRI_TRANSITIONS=48} [2024-11-09 10:36:53,275 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2024-11-09 10:36:53,276 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 48 transitions, 254 flow [2024-11-09 10:36:53,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 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-09 10:36:53,276 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:36:53,276 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-09 10:36:53,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:36:53,277 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-09 10:36:53,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:36:53,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1761659638, now seen corresponding path program 1 times [2024-11-09 10:36:53,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:36:53,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595392515] [2024-11-09 10:36:53,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:36:53,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:36:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:36:53,454 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-09 10:36:53,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:36:53,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595392515] [2024-11-09 10:36:53,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595392515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:36:53,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:36:53,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:36:53,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243210236] [2024-11-09 10:36:53,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:36:53,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:36:53,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:36:53,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:36:53,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:36:53,468 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-09 10:36:53,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 48 transitions, 254 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-09 10:36:53,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:36:53,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-09 10:36:53,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:36:54,165 INFO L124 PetriNetUnfolderBase]: 2956/4956 cut-off events. [2024-11-09 10:36:54,165 INFO L125 PetriNetUnfolderBase]: For 8767/9102 co-relation queries the response was YES. [2024-11-09 10:36:54,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15105 conditions, 4956 events. 2956/4956 cut-off events. For 8767/9102 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 32550 event pairs, 576 based on Foata normal form. 306/5093 useless extension candidates. Maximal degree in co-relation 15082. Up to 2751 conditions per place. [2024-11-09 10:36:54,211 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 50 selfloop transitions, 5 changer transitions 1/74 dead transitions. [2024-11-09 10:36:54,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 74 transitions, 481 flow [2024-11-09 10:36:54,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:36:54,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:36:54,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2024-11-09 10:36:54,212 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6277777777777778 [2024-11-09 10:36:54,212 INFO L175 Difference]: Start difference. First operand has 66 places, 48 transitions, 254 flow. Second operand 4 states and 113 transitions. [2024-11-09 10:36:54,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 74 transitions, 481 flow [2024-11-09 10:36:54,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 74 transitions, 454 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-09 10:36:54,230 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 258 flow [2024-11-09 10:36:54,230 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2024-11-09 10:36:54,231 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2024-11-09 10:36:54,231 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 258 flow [2024-11-09 10:36:54,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-09 10:36:54,231 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:36:54,231 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-09 10:36:54,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:36:54,232 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-09 10:36:54,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:36:54,232 INFO L85 PathProgramCache]: Analyzing trace with hash -981758284, now seen corresponding path program 1 times [2024-11-09 10:36:54,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:36:54,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348640501] [2024-11-09 10:36:54,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:36:54,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:36:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:36:55,029 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-09 10:36:55,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:36:55,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348640501] [2024-11-09 10:36:55,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348640501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:36:55,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:36:55,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 10:36:55,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213163447] [2024-11-09 10:36:55,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:36:55,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:36:55,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:36:55,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:36:55,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:36:55,041 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-11-09 10:36:55,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 258 flow. Second operand has 8 states, 8 states have (on average 20.75) internal successors, (166), 8 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:36:55,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:36:55,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-11-09 10:36:55,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:36:55,865 INFO L124 PetriNetUnfolderBase]: 1921/3681 cut-off events. [2024-11-09 10:36:55,866 INFO L125 PetriNetUnfolderBase]: For 5845/6019 co-relation queries the response was YES. [2024-11-09 10:36:55,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11667 conditions, 3681 events. 1921/3681 cut-off events. For 5845/6019 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 27495 event pairs, 643 based on Foata normal form. 96/3574 useless extension candidates. Maximal degree in co-relation 11645. Up to 2227 conditions per place. [2024-11-09 10:36:55,905 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 41 selfloop transitions, 14 changer transitions 16/95 dead transitions. [2024-11-09 10:36:55,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 95 transitions, 638 flow [2024-11-09 10:36:55,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:36:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:36:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 253 transitions. [2024-11-09 10:36:55,907 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5622222222222222 [2024-11-09 10:36:55,907 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 258 flow. Second operand 10 states and 253 transitions. [2024-11-09 10:36:55,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 95 transitions, 638 flow [2024-11-09 10:36:55,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 95 transitions, 624 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-09 10:36:55,915 INFO L231 Difference]: Finished difference. Result has 76 places, 58 transitions, 373 flow [2024-11-09 10:36:55,915 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=373, PETRI_PLACES=76, PETRI_TRANSITIONS=58} [2024-11-09 10:36:55,916 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 26 predicate places. [2024-11-09 10:36:55,916 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 58 transitions, 373 flow [2024-11-09 10:36:55,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.75) internal successors, (166), 8 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:36:55,916 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:36:55,916 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-09 10:36:55,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:36:55,917 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-09 10:36:55,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:36:55,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1960423094, now seen corresponding path program 1 times [2024-11-09 10:36:55,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:36:55,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395924223] [2024-11-09 10:36:55,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:36:55,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:36:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:36:56,107 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-09 10:36:56,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:36:56,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395924223] [2024-11-09 10:36:56,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395924223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:36:56,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:36:56,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:36:56,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053435723] [2024-11-09 10:36:56,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:36:56,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:36:56,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:36:56,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:36:56,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:36:56,119 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-09 10:36:56,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 58 transitions, 373 flow. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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-09 10:36:56,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:36:56,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-09 10:36:56,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:36:56,778 INFO L124 PetriNetUnfolderBase]: 2018/3486 cut-off events. [2024-11-09 10:36:56,779 INFO L125 PetriNetUnfolderBase]: For 10603/10933 co-relation queries the response was YES. [2024-11-09 10:36:56,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12132 conditions, 3486 events. 2018/3486 cut-off events. For 10603/10933 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 21487 event pairs, 267 based on Foata normal form. 294/3662 useless extension candidates. Maximal degree in co-relation 12103. Up to 1181 conditions per place. [2024-11-09 10:36:56,813 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 61 selfloop transitions, 8 changer transitions 8/95 dead transitions. [2024-11-09 10:36:56,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 95 transitions, 748 flow [2024-11-09 10:36:56,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:36:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:36:56,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2024-11-09 10:36:56,815 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6355555555555555 [2024-11-09 10:36:56,815 INFO L175 Difference]: Start difference. First operand has 76 places, 58 transitions, 373 flow. Second operand 5 states and 143 transitions. [2024-11-09 10:36:56,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 95 transitions, 748 flow [2024-11-09 10:36:56,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 95 transitions, 682 flow, removed 31 selfloop flow, removed 3 redundant places. [2024-11-09 10:36:56,834 INFO L231 Difference]: Finished difference. Result has 77 places, 56 transitions, 349 flow [2024-11-09 10:36:56,834 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=349, PETRI_PLACES=77, PETRI_TRANSITIONS=56} [2024-11-09 10:36:56,835 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 27 predicate places. [2024-11-09 10:36:56,835 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 56 transitions, 349 flow [2024-11-09 10:36:56,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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-09 10:36:56,835 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:36:56,836 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-09 10:36:56,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:36:56,836 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-09 10:36:56,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:36:56,837 INFO L85 PathProgramCache]: Analyzing trace with hash 2028913496, now seen corresponding path program 1 times [2024-11-09 10:36:56,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:36:56,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673725172] [2024-11-09 10:36:56,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:36:56,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:36:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:36:57,063 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-09 10:36:57,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:36:57,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673725172] [2024-11-09 10:36:57,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673725172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:36:57,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:36:57,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:36:57,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886688488] [2024-11-09 10:36:57,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:36:57,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:36:57,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:36:57,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:36:57,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:36:57,073 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-09 10:36:57,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 56 transitions, 349 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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-09 10:36:57,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:36:57,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-09 10:36:57,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:36:57,483 INFO L124 PetriNetUnfolderBase]: 1515/2575 cut-off events. [2024-11-09 10:36:57,484 INFO L125 PetriNetUnfolderBase]: For 8286/8812 co-relation queries the response was YES. [2024-11-09 10:36:57,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9742 conditions, 2575 events. 1515/2575 cut-off events. For 8286/8812 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 15433 event pairs, 244 based on Foata normal form. 199/2647 useless extension candidates. Maximal degree in co-relation 9712. Up to 948 conditions per place. [2024-11-09 10:36:57,503 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 45 selfloop transitions, 11 changer transitions 16/87 dead transitions. [2024-11-09 10:36:57,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 87 transitions, 639 flow [2024-11-09 10:36:57,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:36:57,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:36:57,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2024-11-09 10:36:57,505 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2024-11-09 10:36:57,505 INFO L175 Difference]: Start difference. First operand has 77 places, 56 transitions, 349 flow. Second operand 6 states and 159 transitions. [2024-11-09 10:36:57,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 87 transitions, 639 flow [2024-11-09 10:36:57,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 87 transitions, 575 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-11-09 10:36:57,514 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 294 flow [2024-11-09 10:36:57,515 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=294, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2024-11-09 10:36:57,515 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 22 predicate places. [2024-11-09 10:36:57,516 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 294 flow [2024-11-09 10:36:57,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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-09 10:36:57,516 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:36:57,516 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] [2024-11-09 10:36:57,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:36:57,516 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-09 10:36:57,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:36:57,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1771740986, now seen corresponding path program 1 times [2024-11-09 10:36:57,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:36:57,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934898473] [2024-11-09 10:36:57,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:36:57,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:36:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:36:57,777 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-09 10:36:57,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:36:57,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934898473] [2024-11-09 10:36:57,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934898473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:36:57,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:36:57,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:36:57,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002586928] [2024-11-09 10:36:57,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:36:57,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:36:57,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:36:57,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:36:57,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:36:57,787 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2024-11-09 10:36:57,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 294 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:36:57,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:36:57,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2024-11-09 10:36:57,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:36:58,093 INFO L124 PetriNetUnfolderBase]: 725/1605 cut-off events. [2024-11-09 10:36:58,094 INFO L125 PetriNetUnfolderBase]: For 4052/4331 co-relation queries the response was YES. [2024-11-09 10:36:58,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5036 conditions, 1605 events. 725/1605 cut-off events. For 4052/4331 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 11177 event pairs, 155 based on Foata normal form. 31/1467 useless extension candidates. Maximal degree in co-relation 5010. Up to 535 conditions per place. [2024-11-09 10:36:58,105 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 28 selfloop transitions, 1 changer transitions 24/79 dead transitions. [2024-11-09 10:36:58,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 79 transitions, 515 flow [2024-11-09 10:36:58,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:36:58,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:36:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2024-11-09 10:36:58,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2024-11-09 10:36:58,107 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 294 flow. Second operand 6 states and 156 transitions. [2024-11-09 10:36:58,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 79 transitions, 515 flow [2024-11-09 10:36:58,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 79 transitions, 444 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-11-09 10:36:58,117 INFO L231 Difference]: Finished difference. Result has 73 places, 47 transitions, 234 flow [2024-11-09 10:36:58,117 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=73, PETRI_TRANSITIONS=47} [2024-11-09 10:36:58,118 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 23 predicate places. [2024-11-09 10:36:58,118 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 47 transitions, 234 flow [2024-11-09 10:36:58,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:36:58,118 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:36:58,119 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] [2024-11-09 10:36:58,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:36:58,119 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-09 10:36:58,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:36:58,120 INFO L85 PathProgramCache]: Analyzing trace with hash 576370338, now seen corresponding path program 2 times [2024-11-09 10:36:58,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:36:58,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626519996] [2024-11-09 10:36:58,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:36:58,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:36:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:36:59,425 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-09 10:36:59,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:36:59,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626519996] [2024-11-09 10:36:59,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626519996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:36:59,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:36:59,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 10:36:59,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273044106] [2024-11-09 10:36:59,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:36:59,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:36:59,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:36:59,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:36:59,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:36:59,440 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-11-09 10:36:59,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 47 transitions, 234 flow. Second operand has 10 states, 10 states have (on average 20.6) internal successors, (206), 10 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-09 10:36:59,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:36:59,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-11-09 10:36:59,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:36:59,868 INFO L124 PetriNetUnfolderBase]: 547/1212 cut-off events. [2024-11-09 10:36:59,868 INFO L125 PetriNetUnfolderBase]: For 1368/1476 co-relation queries the response was YES. [2024-11-09 10:36:59,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3374 conditions, 1212 events. 547/1212 cut-off events. For 1368/1476 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 8110 event pairs, 202 based on Foata normal form. 22/1097 useless extension candidates. Maximal degree in co-relation 3350. Up to 398 conditions per place. [2024-11-09 10:36:59,876 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 20 selfloop transitions, 3 changer transitions 24/72 dead transitions. [2024-11-09 10:36:59,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 72 transitions, 404 flow [2024-11-09 10:36:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:36:59,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:36:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-11-09 10:36:59,877 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5472222222222223 [2024-11-09 10:36:59,877 INFO L175 Difference]: Start difference. First operand has 73 places, 47 transitions, 234 flow. Second operand 8 states and 197 transitions. [2024-11-09 10:36:59,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 72 transitions, 404 flow [2024-11-09 10:36:59,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 72 transitions, 390 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-09 10:36:59,883 INFO L231 Difference]: Finished difference. Result has 77 places, 44 transitions, 228 flow [2024-11-09 10:36:59,884 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=228, PETRI_PLACES=77, PETRI_TRANSITIONS=44} [2024-11-09 10:36:59,884 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 27 predicate places. [2024-11-09 10:36:59,884 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 44 transitions, 228 flow [2024-11-09 10:36:59,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.6) internal successors, (206), 10 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-09 10:36:59,885 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:36:59,885 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] [2024-11-09 10:36:59,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:36:59,885 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-09 10:36:59,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:36:59,886 INFO L85 PathProgramCache]: Analyzing trace with hash -148768062, now seen corresponding path program 3 times [2024-11-09 10:36:59,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:36:59,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199970341] [2024-11-09 10:36:59,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:36:59,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:36:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:36:59,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:36:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:37:00,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:37:00,030 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:37:00,031 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-09 10:37:00,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-09 10:37:00,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-09 10:37:00,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-09 10:37:00,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-09 10:37:00,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-09 10:37:00,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:37:00,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:37:00,036 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:37:00,131 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:37:00,132 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:37:00,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:37:00 BasicIcfg [2024-11-09 10:37:00,137 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:37:00,137 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:37:00,138 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:37:00,138 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:37:00,139 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:36:47" (3/4) ... [2024-11-09 10:37:00,140 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:37:00,142 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:37:00,142 INFO L158 Benchmark]: Toolchain (without parser) took 14069.12ms. Allocated memory was 163.6MB in the beginning and 645.9MB in the end (delta: 482.3MB). Free memory was 93.4MB in the beginning and 232.9MB in the end (delta: -139.4MB). Peak memory consumption was 344.5MB. Max. memory is 16.1GB. [2024-11-09 10:37:00,142 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:37:00,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 704.22ms. Allocated memory is still 163.6MB. Free memory was 93.2MB in the beginning and 126.7MB in the end (delta: -33.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 10:37:00,144 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.73ms. Allocated memory is still 163.6MB. Free memory was 126.7MB in the beginning and 123.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:37:00,144 INFO L158 Benchmark]: Boogie Preprocessor took 66.33ms. Allocated memory is still 163.6MB. Free memory was 123.9MB in the beginning and 120.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:37:00,144 INFO L158 Benchmark]: RCFGBuilder took 759.79ms. Allocated memory is still 163.6MB. Free memory was 120.4MB in the beginning and 72.2MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-09 10:37:00,145 INFO L158 Benchmark]: TraceAbstraction took 12449.15ms. Allocated memory was 163.6MB in the beginning and 645.9MB in the end (delta: 482.3MB). Free memory was 71.4MB in the beginning and 233.9MB in the end (delta: -162.5MB). Peak memory consumption was 320.5MB. Max. memory is 16.1GB. [2024-11-09 10:37:00,145 INFO L158 Benchmark]: Witness Printer took 4.61ms. Allocated memory is still 645.9MB. Free memory was 233.9MB in the beginning and 232.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:37:00,146 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.16ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 704.22ms. Allocated memory is still 163.6MB. Free memory was 93.2MB in the beginning and 126.7MB in the end (delta: -33.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.73ms. Allocated memory is still 163.6MB. Free memory was 126.7MB in the beginning and 123.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.33ms. Allocated memory is still 163.6MB. Free memory was 123.9MB in the beginning and 120.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 759.79ms. Allocated memory is still 163.6MB. Free memory was 120.4MB in the beginning and 72.2MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12449.15ms. Allocated memory was 163.6MB in the beginning and 645.9MB in the end (delta: 482.3MB). Free memory was 71.4MB in the beginning and 233.9MB in the end (delta: -162.5MB). Peak memory consumption was 320.5MB. Max. memory is 16.1GB. * Witness Printer took 4.61ms. Allocated memory is still 645.9MB. Free memory was 233.9MB in the beginning and 232.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2516; [L816] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2516=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t2517; [L818] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2516=-2, t2517=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L819] 0 pthread_t t2518; [L820] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2516=-2, t2517=-1, t2518=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L741] 1 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L758] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L761] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L800] 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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516=-2, t2517=-1, t2518=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L824] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L824] RET 0 assume_abort_if_not(main$tmp_guard0) [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516=-2, t2517=-1, t2518=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516=-2, t2517=-1, t2518=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L848] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L17] 0 __assert_fail ("0", "safe031_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 818]: 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: 820]: 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, 70 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: 12.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 469 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 440 mSDsluCounter, 150 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1250 IncrementalHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 42 mSDtfsCounter, 1250 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=373occurred in iteration=7, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 1483 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 10:37:00,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_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 740668a6bdee7f1177df0d0d81e76f2a2521fb58ce5f63a4942f3d36e11f9dad --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:37:02,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:37:02,534 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:37:02,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:37:02,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:37:02,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:37:02,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:37:02,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:37:02,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:37:02,576 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:37:02,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:37:02,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:37:02,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:37:02,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:37:02,579 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:37:02,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:37:02,581 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:37:02,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:37:02,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:37:02,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:37:02,584 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:37:02,585 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:37:02,585 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:37:02,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:37:02,585 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:37:02,586 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:37:02,586 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:37:02,586 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:37:02,586 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:37:02,587 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:37:02,587 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:37:02,587 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:37:02,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:37:02,588 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:37:02,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:37:02,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:37:02,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:37:02,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:37:02,589 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:37:02,589 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:37:02,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:37:02,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:37:02,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:37:02,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:37:02,591 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 -> 740668a6bdee7f1177df0d0d81e76f2a2521fb58ce5f63a4942f3d36e11f9dad [2024-11-09 10:37:02,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:37:02,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:37:02,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:37:02,963 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:37:02,964 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:37:02,965 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2024-11-09 10:37:04,594 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:37:04,880 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:37:04,880 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2024-11-09 10:37:04,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85f396644/4974e2628e6c49c38d2fd2ce0534277f/FLAG16120e70d [2024-11-09 10:37:04,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85f396644/4974e2628e6c49c38d2fd2ce0534277f [2024-11-09 10:37:04,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:37:04,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:37:04,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:37:04,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:37:04,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:37:04,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:04" (1/1) ... [2024-11-09 10:37:04,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7832fb54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:04, skipping insertion in model container [2024-11-09 10:37:04,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:04" (1/1) ... [2024-11-09 10:37:04,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:37:05,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:37:05,443 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:37:05,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:37:05,558 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:37:05,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05 WrapperNode [2024-11-09 10:37:05,559 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:37:05,560 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:37:05,560 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:37:05,560 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:37:05,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (1/1) ... [2024-11-09 10:37:05,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (1/1) ... [2024-11-09 10:37:05,627 INFO L138 Inliner]: procedures = 176, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-11-09 10:37:05,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:37:05,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:37:05,634 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:37:05,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:37:05,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (1/1) ... [2024-11-09 10:37:05,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (1/1) ... [2024-11-09 10:37:05,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (1/1) ... [2024-11-09 10:37:05,674 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-09 10:37:05,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (1/1) ... [2024-11-09 10:37:05,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (1/1) ... [2024-11-09 10:37:05,682 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (1/1) ... [2024-11-09 10:37:05,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (1/1) ... [2024-11-09 10:37:05,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (1/1) ... [2024-11-09 10:37:05,696 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (1/1) ... [2024-11-09 10:37:05,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:37:05,704 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:37:05,704 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:37:05,704 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:37:05,705 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (1/1) ... [2024-11-09 10:37:05,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:37:05,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:37:05,743 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-09 10:37:05,755 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-09 10:37:05,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:37:05,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:37:05,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:37:05,791 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-09 10:37:05,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-09 10:37:05,791 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-09 10:37:05,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-09 10:37:05,791 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-09 10:37:05,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-09 10:37:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:37:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:37:05,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:37:05,795 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:37:05,944 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:37:05,947 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:37:06,309 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:37:06,309 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:37:06,536 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:37:06,536 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:37:06,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:37:06 BoogieIcfgContainer [2024-11-09 10:37:06,537 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:37:06,539 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:37:06,539 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:37:06,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:37:06,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:37:04" (1/3) ... [2024-11-09 10:37:06,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ebaa4f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:37:06, skipping insertion in model container [2024-11-09 10:37:06,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:05" (2/3) ... [2024-11-09 10:37:06,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ebaa4f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:37:06, skipping insertion in model container [2024-11-09 10:37:06,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:37:06" (3/3) ... [2024-11-09 10:37:06,547 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.opt_pso.opt_rmo.opt.i [2024-11-09 10:37:06,566 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:37:06,566 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 10:37:06,566 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:37:06,628 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:37:06,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2024-11-09 10:37:06,717 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2024-11-09 10:37:06,718 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:37:06,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-11-09 10:37:06,723 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2024-11-09 10:37:06,726 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2024-11-09 10:37:06,738 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:37:06,746 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;@20ff5f53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:37:06,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:37:06,753 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:37:06,754 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-11-09 10:37:06,754 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:37:06,754 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:06,755 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:37:06,755 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-09 10:37:06,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:06,761 INFO L85 PathProgramCache]: Analyzing trace with hash -2127080492, now seen corresponding path program 1 times [2024-11-09 10:37:06,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:06,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597610280] [2024-11-09 10:37:06,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:06,778 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-09 10:37:06,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:06,782 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-09 10:37:06,805 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-09 10:37:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:06,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:37:06,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:06,969 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-09 10:37:06,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:06,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:06,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597610280] [2024-11-09 10:37:06,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1597610280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:06,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:06,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:37:06,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35032919] [2024-11-09 10:37:06,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:06,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:37:06,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:07,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:37:07,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:37:07,023 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 45 [2024-11-09 10:37:07,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-09 10:37:07,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:07,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 45 [2024-11-09 10:37:07,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:07,344 INFO L124 PetriNetUnfolderBase]: 407/798 cut-off events. [2024-11-09 10:37:07,344 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:37:07,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1461 conditions, 798 events. 407/798 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5417 event pairs, 74 based on Foata normal form. 48/832 useless extension candidates. Maximal degree in co-relation 1450. Up to 496 conditions per place. [2024-11-09 10:37:07,357 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 27 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2024-11-09 10:37:07,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 49 transitions, 169 flow [2024-11-09 10:37:07,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:37:07,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:37:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-11-09 10:37:07,370 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2024-11-09 10:37:07,372 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 99 transitions. [2024-11-09 10:37:07,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 49 transitions, 169 flow [2024-11-09 10:37:07,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:37:07,382 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2024-11-09 10:37:07,384 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, 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=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-09 10:37:07,388 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2024-11-09 10:37:07,388 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2024-11-09 10:37:07,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-09 10:37:07,388 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:07,388 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:37:07,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 (2)] Ended with exit code 0 [2024-11-09 10:37:07,591 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-09 10:37:07,592 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-09 10:37:07,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:07,593 INFO L85 PathProgramCache]: Analyzing trace with hash 853273583, now seen corresponding path program 1 times [2024-11-09 10:37:07,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:07,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603383895] [2024-11-09 10:37:07,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:07,594 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-09 10:37:07,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:07,597 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-09 10:37:07,599 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-09 10:37:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:07,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:37:07,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:07,785 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-09 10:37:07,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:07,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:07,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603383895] [2024-11-09 10:37:07,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [603383895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:07,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:07,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:37:07,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893622240] [2024-11-09 10:37:07,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:07,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:37:07,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:07,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:37:07,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:37:07,797 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-09 10:37:07,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-09 10:37:07,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:07,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-09 10:37:07,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:08,107 INFO L124 PetriNetUnfolderBase]: 1129/1946 cut-off events. [2024-11-09 10:37:08,107 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2024-11-09 10:37:08,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3806 conditions, 1946 events. 1129/1946 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 12445 event pairs, 94 based on Foata normal form. 60/1996 useless extension candidates. Maximal degree in co-relation 3796. Up to 1184 conditions per place. [2024-11-09 10:37:08,120 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 38 selfloop transitions, 5 changer transitions 1/58 dead transitions. [2024-11-09 10:37:08,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 222 flow [2024-11-09 10:37:08,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:37:08,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:37:08,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2024-11-09 10:37:08,122 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2024-11-09 10:37:08,122 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 4 states and 114 transitions. [2024-11-09 10:37:08,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 222 flow [2024-11-09 10:37:08,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 58 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:37:08,124 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 114 flow [2024-11-09 10:37:08,125 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2024-11-09 10:37:08,125 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2024-11-09 10:37:08,126 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 114 flow [2024-11-09 10:37:08,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-09 10:37:08,126 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:08,126 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-09 10:37:08,131 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-09 10:37:08,327 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-09 10:37:08,327 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-09 10:37:08,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:08,328 INFO L85 PathProgramCache]: Analyzing trace with hash 284700741, now seen corresponding path program 1 times [2024-11-09 10:37:08,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:08,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568196045] [2024-11-09 10:37:08,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:08,329 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-09 10:37:08,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:08,332 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-09 10:37:08,333 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-09 10:37:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:08,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:37:08,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:08,500 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-09 10:37:08,500 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:08,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:08,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568196045] [2024-11-09 10:37:08,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568196045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:08,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:08,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:37:08,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451866562] [2024-11-09 10:37:08,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:08,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:37:08,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:08,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:37:08,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:37:08,517 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-09 10:37:08,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-09 10:37:08,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:08,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-09 10:37:08,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:08,783 INFO L124 PetriNetUnfolderBase]: 748/1317 cut-off events. [2024-11-09 10:37:08,785 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2024-11-09 10:37:08,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2964 conditions, 1317 events. 748/1317 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7419 event pairs, 34 based on Foata normal form. 54/1361 useless extension candidates. Maximal degree in co-relation 2952. Up to 645 conditions per place. [2024-11-09 10:37:08,793 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 47 selfloop transitions, 8 changer transitions 1/70 dead transitions. [2024-11-09 10:37:08,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 307 flow [2024-11-09 10:37:08,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:37:08,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:37:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2024-11-09 10:37:08,797 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6355555555555555 [2024-11-09 10:37:08,798 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 114 flow. Second operand 5 states and 143 transitions. [2024-11-09 10:37:08,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 307 flow [2024-11-09 10:37:08,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 70 transitions, 297 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 10:37:08,802 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 154 flow [2024-11-09 10:37:08,803 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2024-11-09 10:37:08,804 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2024-11-09 10:37:08,804 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 154 flow [2024-11-09 10:37:08,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-09 10:37:08,805 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:08,805 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-09 10:37:08,811 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-09 10:37:09,006 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-09 10:37:09,006 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-09 10:37:09,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:09,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1229317361, now seen corresponding path program 1 times [2024-11-09 10:37:09,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:09,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230449820] [2024-11-09 10:37:09,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:09,008 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-09 10:37:09,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:09,012 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-09 10:37:09,013 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-09 10:37:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:09,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:37:09,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:09,175 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-09 10:37:09,175 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:09,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:09,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230449820] [2024-11-09 10:37:09,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1230449820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:09,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:09,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:37:09,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888173248] [2024-11-09 10:37:09,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:09,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:37:09,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:09,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:37:09,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:37:09,186 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-11-09 10:37:09,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 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-09 10:37:09,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:09,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-11-09 10:37:09,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:09,442 INFO L124 PetriNetUnfolderBase]: 381/664 cut-off events. [2024-11-09 10:37:09,442 INFO L125 PetriNetUnfolderBase]: For 571/571 co-relation queries the response was YES. [2024-11-09 10:37:09,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1742 conditions, 664 events. 381/664 cut-off events. For 571/571 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2886 event pairs, 23 based on Foata normal form. 32/686 useless extension candidates. Maximal degree in co-relation 1728. Up to 228 conditions per place. [2024-11-09 10:37:09,448 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 42 selfloop transitions, 11 changer transitions 1/68 dead transitions. [2024-11-09 10:37:09,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 322 flow [2024-11-09 10:37:09,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:37:09,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:37:09,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2024-11-09 10:37:09,453 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5851851851851851 [2024-11-09 10:37:09,453 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 154 flow. Second operand 6 states and 158 transitions. [2024-11-09 10:37:09,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 322 flow [2024-11-09 10:37:09,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 68 transitions, 297 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-09 10:37:09,458 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 168 flow [2024-11-09 10:37:09,458 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2024-11-09 10:37:09,459 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2024-11-09 10:37:09,459 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 168 flow [2024-11-09 10:37:09,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 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-09 10:37:09,460 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:09,460 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] [2024-11-09 10:37:09,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 10:37:09,660 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-09 10:37:09,661 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-09 10:37:09,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:09,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1839678380, now seen corresponding path program 1 times [2024-11-09 10:37:09,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:09,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559746826] [2024-11-09 10:37:09,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:09,663 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-09 10:37:09,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:09,666 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-09 10:37:09,667 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-09 10:37:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:09,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:37:09,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:09,826 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-09 10:37:09,826 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:09,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:09,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559746826] [2024-11-09 10:37:09,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [559746826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:09,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:09,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:37:09,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910278855] [2024-11-09 10:37:09,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:09,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:37:09,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:09,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:37:09,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:37:09,828 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-11-09 10:37:09,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-09 10:37:09,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:09,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-11-09 10:37:09,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:09,914 INFO L124 PetriNetUnfolderBase]: 186/392 cut-off events. [2024-11-09 10:37:09,915 INFO L125 PetriNetUnfolderBase]: For 127/129 co-relation queries the response was YES. [2024-11-09 10:37:09,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 392 events. 186/392 cut-off events. For 127/129 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1807 event pairs, 178 based on Foata normal form. 8/358 useless extension candidates. Maximal degree in co-relation 845. Up to 311 conditions per place. [2024-11-09 10:37:09,917 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 17 selfloop transitions, 1 changer transitions 1/42 dead transitions. [2024-11-09 10:37:09,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 42 transitions, 204 flow [2024-11-09 10:37:09,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:37:09,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:37:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-09 10:37:09,919 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-11-09 10:37:09,919 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 168 flow. Second operand 3 states and 80 transitions. [2024-11-09 10:37:09,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 42 transitions, 204 flow [2024-11-09 10:37:09,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 148 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-09 10:37:09,921 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 110 flow [2024-11-09 10:37:09,922 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2024-11-09 10:37:09,923 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2024-11-09 10:37:09,924 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 110 flow [2024-11-09 10:37:09,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-09 10:37:09,925 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:09,925 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] [2024-11-09 10:37:09,931 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 (6)] Forceful destruction successful, exit code 0 [2024-11-09 10:37:10,125 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-09 10:37:10,126 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-09 10:37:10,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:10,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1609447182, now seen corresponding path program 1 times [2024-11-09 10:37:10,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:10,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344259878] [2024-11-09 10:37:10,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:10,128 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-09 10:37:10,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:10,131 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-09 10:37:10,132 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-09 10:37:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:10,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:37:10,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:10,483 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-09 10:37:10,483 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:10,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:10,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344259878] [2024-11-09 10:37:10,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344259878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:10,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:10,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:37:10,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033914067] [2024-11-09 10:37:10,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:10,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:37:10,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:10,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:37:10,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:37:10,493 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-11-09 10:37:10,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 110 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:37:10,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:10,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-11-09 10:37:10,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:10,746 INFO L124 PetriNetUnfolderBase]: 497/994 cut-off events. [2024-11-09 10:37:10,747 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:37:10,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1926 conditions, 994 events. 497/994 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5468 event pairs, 100 based on Foata normal form. 8/953 useless extension candidates. Maximal degree in co-relation 1919. Up to 370 conditions per place. [2024-11-09 10:37:10,751 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 26 selfloop transitions, 1 changer transitions 20/68 dead transitions. [2024-11-09 10:37:10,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 262 flow [2024-11-09 10:37:10,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:37:10,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:37:10,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2024-11-09 10:37:10,752 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-11-09 10:37:10,753 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 110 flow. Second operand 6 states and 162 transitions. [2024-11-09 10:37:10,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 262 flow [2024-11-09 10:37:10,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 261 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:37:10,754 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 120 flow [2024-11-09 10:37:10,755 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=120, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2024-11-09 10:37:10,755 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2024-11-09 10:37:10,756 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 120 flow [2024-11-09 10:37:10,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:37:10,756 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:10,756 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] [2024-11-09 10:37:10,761 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 (7)] Forceful destruction successful, exit code 0 [2024-11-09 10:37:10,957 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-09 10:37:10,957 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-09 10:37:10,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:10,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1596083362, now seen corresponding path program 2 times [2024-11-09 10:37:10,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:10,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543034964] [2024-11-09 10:37:10,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:37:10,959 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-09 10:37:10,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:10,960 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-09 10:37:10,961 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-09 10:37:11,045 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 10:37:11,045 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:37:11,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:37:11,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:37:11,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:11,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:11,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543034964] [2024-11-09 10:37:11,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543034964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:11,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:11,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:37:11,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682073647] [2024-11-09 10:37:11,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:11,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:37:11,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:11,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:37:11,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:37:11,118 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-11-09 10:37:11,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:37:11,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:11,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-11-09 10:37:11,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:11,308 INFO L124 PetriNetUnfolderBase]: 456/928 cut-off events. [2024-11-09 10:37:11,309 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-09 10:37:11,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1845 conditions, 928 events. 456/928 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5245 event pairs, 234 based on Foata normal form. 8/868 useless extension candidates. Maximal degree in co-relation 1834. Up to 440 conditions per place. [2024-11-09 10:37:11,313 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 21 selfloop transitions, 2 changer transitions 14/58 dead transitions. [2024-11-09 10:37:11,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 232 flow [2024-11-09 10:37:11,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:37:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:37:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2024-11-09 10:37:11,314 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5911111111111111 [2024-11-09 10:37:11,314 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 120 flow. Second operand 5 states and 133 transitions. [2024-11-09 10:37:11,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 232 flow [2024-11-09 10:37:11,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 221 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-09 10:37:11,318 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 125 flow [2024-11-09 10:37:11,319 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2024-11-09 10:37:11,320 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2024-11-09 10:37:11,320 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 125 flow [2024-11-09 10:37:11,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:37:11,320 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:11,321 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] [2024-11-09 10:37:11,326 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-09 10:37:11,521 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-09 10:37:11,522 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-09 10:37:11,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:11,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1500401418, now seen corresponding path program 3 times [2024-11-09 10:37:11,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:11,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636722396] [2024-11-09 10:37:11,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:37:11,524 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-09 10:37:11,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:11,527 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-09 10:37:11,530 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-09 10:37:11,609 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 10:37:11,610 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:37:11,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 10:37:11,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:11,906 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-09 10:37:11,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:11,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:11,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636722396] [2024-11-09 10:37:11,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636722396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:11,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:11,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 10:37:11,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148615115] [2024-11-09 10:37:11,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:11,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:37:11,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:11,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:37:11,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:37:11,917 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45 [2024-11-09 10:37:11,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 125 flow. Second operand has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 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-09 10:37:11,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:11,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45 [2024-11-09 10:37:11,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:12,140 INFO L124 PetriNetUnfolderBase]: 328/651 cut-off events. [2024-11-09 10:37:12,140 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:37:12,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1320 conditions, 651 events. 328/651 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3069 event pairs, 129 based on Foata normal form. 8/601 useless extension candidates. Maximal degree in co-relation 1309. Up to 254 conditions per place. [2024-11-09 10:37:12,144 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 20 selfloop transitions, 3 changer transitions 15/60 dead transitions. [2024-11-09 10:37:12,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 245 flow [2024-11-09 10:37:12,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:37:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:37:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2024-11-09 10:37:12,146 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2024-11-09 10:37:12,146 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 125 flow. Second operand 6 states and 159 transitions. [2024-11-09 10:37:12,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 245 flow [2024-11-09 10:37:12,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 60 transitions, 231 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-09 10:37:12,149 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 129 flow [2024-11-09 10:37:12,150 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=129, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2024-11-09 10:37:12,150 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2024-11-09 10:37:12,151 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 129 flow [2024-11-09 10:37:12,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 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-09 10:37:12,152 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:12,152 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] [2024-11-09 10:37:12,157 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 (9)] Forceful destruction successful, exit code 0 [2024-11-09 10:37:12,352 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-09 10:37:12,353 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-09 10:37:12,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:12,354 INFO L85 PathProgramCache]: Analyzing trace with hash -718362544, now seen corresponding path program 4 times [2024-11-09 10:37:12,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:12,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765965386] [2024-11-09 10:37:12,355 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:37:12,355 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-09 10:37:12,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:12,358 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-09 10:37:12,359 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-09 10:37:12,445 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 10:37:12,445 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 10:37:12,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:37:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:37:12,544 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 10:37:12,544 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:37:12,545 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-09 10:37:12,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-09 10:37:12,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-09 10:37:12,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-09 10:37:12,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-09 10:37:12,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-09 10:37:12,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:37:12,556 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-09 10:37:12,750 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-09 10:37:12,750 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-09 10:37:12,861 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:37:12,861 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:37:12,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:37:12 BasicIcfg [2024-11-09 10:37:12,868 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:37:12,869 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:37:12,869 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:37:12,869 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:37:12,870 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:37:06" (3/4) ... [2024-11-09 10:37:12,871 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:37:12,873 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:37:12,873 INFO L158 Benchmark]: Toolchain (without parser) took 7963.91ms. Allocated memory was 62.9MB in the beginning and 157.3MB in the end (delta: 94.4MB). Free memory was 38.3MB in the beginning and 121.0MB in the end (delta: -82.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 10:37:12,874 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 44.0MB. Free memory was 20.9MB in the beginning and 20.8MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:37:12,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 648.66ms. Allocated memory is still 62.9MB. Free memory was 38.1MB in the beginning and 29.4MB in the end (delta: 8.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 10:37:12,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.90ms. Allocated memory is still 62.9MB. Free memory was 29.4MB in the beginning and 26.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:37:12,875 INFO L158 Benchmark]: Boogie Preprocessor took 71.22ms. Allocated memory is still 62.9MB. Free memory was 26.6MB in the beginning and 23.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:37:12,877 INFO L158 Benchmark]: RCFGBuilder took 832.88ms. Allocated memory was 62.9MB in the beginning and 88.1MB in the end (delta: 25.2MB). Free memory was 23.2MB in the beginning and 42.3MB in the end (delta: -19.1MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2024-11-09 10:37:12,877 INFO L158 Benchmark]: TraceAbstraction took 6329.59ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 41.6MB in the beginning and 121.0MB in the end (delta: -79.3MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. [2024-11-09 10:37:12,877 INFO L158 Benchmark]: Witness Printer took 3.95ms. Allocated memory is still 157.3MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:37:12,879 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.91ms. Allocated memory is still 44.0MB. Free memory was 20.9MB in the beginning and 20.8MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 648.66ms. Allocated memory is still 62.9MB. Free memory was 38.1MB in the beginning and 29.4MB in the end (delta: 8.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.90ms. Allocated memory is still 62.9MB. Free memory was 29.4MB in the beginning and 26.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.22ms. Allocated memory is still 62.9MB. Free memory was 26.6MB in the beginning and 23.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 832.88ms. Allocated memory was 62.9MB in the beginning and 88.1MB in the end (delta: 25.2MB). Free memory was 23.2MB in the beginning and 42.3MB in the end (delta: -19.1MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6329.59ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 41.6MB in the beginning and 121.0MB in the end (delta: -79.3MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. * Witness Printer took 3.95ms. Allocated memory is still 157.3MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2516; [L816] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2516=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t2517; [L818] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2516=0, t2517=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L819] 0 pthread_t t2518; [L820] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2516=0, t2517=1, t2518=2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L741] 1 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L758] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L761] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516=0, t2517=1, t2518=2, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L824] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L824] RET 0 assume_abort_if_not(main$tmp_guard0) [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516=0, t2517=1, t2518=2, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516=0, t2517=1, t2518=2, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L848] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L17] 0 __assert_fail ("0", "safe031_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 818]: 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: 820]: 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, 70 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 263 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 250 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 764 IncrementalHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 9 mSDtfsCounter, 764 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=4, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 223 NumberOfCodeBlocks, 223 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 661 SizeOfPredicates, 12 NumberOfNonLiveVariables, 887 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 10:37:12,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample