./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f 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/mix024_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 1b7eb90186eb2f5804d582daa800e24f20cc36e3f07dd8983b72b6a43dcf9225 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:53:01,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:53:01,093 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:53:01,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:53:01,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:53:01,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:53:01,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:53:01,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:53:01,125 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:53:01,125 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:53:01,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:53:01,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:53:01,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:53:01,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:53:01,127 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:53:01,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:53:01,127 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:53:01,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:53:01,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:53:01,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:53:01,129 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:53:01,129 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:53:01,129 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:53:01,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:53:01,130 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:53:01,130 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:53:01,130 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:53:01,131 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:53:01,131 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:53:01,131 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:53:01,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:53:01,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:53:01,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:53:01,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:53:01,133 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:53:01,133 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:53:01,133 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:53:01,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:53:01,134 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:53:01,134 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:53:01,134 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:53:01,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:53:01,135 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 -> 1b7eb90186eb2f5804d582daa800e24f20cc36e3f07dd8983b72b6a43dcf9225 [2024-11-10 17:53:01,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:53:01,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:53:01,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:53:01,401 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:53:01,402 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:53:01,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2024-11-10 17:53:02,803 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:53:03,011 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:53:03,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2024-11-10 17:53:03,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d78d72fe/96cf06c7ec304b5695d35b982900d389/FLAG559819b8b [2024-11-10 17:53:03,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d78d72fe/96cf06c7ec304b5695d35b982900d389 [2024-11-10 17:53:03,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:53:03,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:53:03,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:53:03,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:53:03,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:53:03,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:53:03" (1/1) ... [2024-11-10 17:53:03,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48149b52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:03, skipping insertion in model container [2024-11-10 17:53:03,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:53:03" (1/1) ... [2024-11-10 17:53:03,410 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:53:03,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:53:03,714 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:53:03,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:53:03,834 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:53:03,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:03 WrapperNode [2024-11-10 17:53:03,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:53:03,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:53:03,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:53:03,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:53:03,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:03" (1/1) ... [2024-11-10 17:53:03,856 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:03" (1/1) ... [2024-11-10 17:53:03,888 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 122 [2024-11-10 17:53:03,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:53:03,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:53:03,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:53:03,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:53:03,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:03" (1/1) ... [2024-11-10 17:53:03,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:03" (1/1) ... [2024-11-10 17:53:03,905 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:03" (1/1) ... [2024-11-10 17:53:03,928 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-10 17:53:03,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:03" (1/1) ... [2024-11-10 17:53:03,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:03" (1/1) ... [2024-11-10 17:53:03,940 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:03" (1/1) ... [2024-11-10 17:53:03,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:03" (1/1) ... [2024-11-10 17:53:03,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:03" (1/1) ... [2024-11-10 17:53:03,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:03" (1/1) ... [2024-11-10 17:53:03,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:53:03,953 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:53:03,953 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:53:03,953 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:53:03,954 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:03" (1/1) ... [2024-11-10 17:53:03,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:53:03,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:53:03,996 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-10 17:53:04,005 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-10 17:53:04,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 17:53:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:53:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-10 17:53:04,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-10 17:53:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-10 17:53:04,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-10 17:53:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-10 17:53:04,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-10 17:53:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 17:53:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 17:53:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:53:04,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:53:04,049 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 17:53:04,176 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:53:04,181 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:53:04,416 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 17:53:04,416 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:53:04,614 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:53:04,615 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 17:53:04,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:53:04 BoogieIcfgContainer [2024-11-10 17:53:04,618 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:53:04,620 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:53:04,620 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:53:04,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:53:04,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:53:03" (1/3) ... [2024-11-10 17:53:04,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb500e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:53:04, skipping insertion in model container [2024-11-10 17:53:04,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:03" (2/3) ... [2024-11-10 17:53:04,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb500e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:53:04, skipping insertion in model container [2024-11-10 17:53:04,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:53:04" (3/3) ... [2024-11-10 17:53:04,634 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.opt_pso.opt_rmo.opt.i [2024-11-10 17:53:04,665 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:53:04,666 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-10 17:53:04,666 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 17:53:04,719 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 17:53:04,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 106 flow [2024-11-10 17:53:04,781 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2024-11-10 17:53:04,781 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:53:04,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 2/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2024-11-10 17:53:04,784 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 47 transitions, 106 flow [2024-11-10 17:53:04,787 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 44 transitions, 97 flow [2024-11-10 17:53:04,794 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:53:04,800 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;@a50735c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:53:04,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 17:53:04,807 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 17:53:04,809 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-10 17:53:04,809 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:53:04,809 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:04,810 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:53:04,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:53:04,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:04,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1450921081, now seen corresponding path program 1 times [2024-11-10 17:53:04,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:53:04,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423591414] [2024-11-10 17:53:04,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:53:04,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:53:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:53:05,191 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-10 17:53:05,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:53:05,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423591414] [2024-11-10 17:53:05,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423591414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:05,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:05,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 17:53:05,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031404800] [2024-11-10 17:53:05,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:05,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:53:05,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:53:05,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:53:05,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:53:05,229 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-11-10 17:53:05,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-10 17:53:05,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:05,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-11-10 17:53:05,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:06,440 INFO L124 PetriNetUnfolderBase]: 8463/12150 cut-off events. [2024-11-10 17:53:06,441 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-11-10 17:53:06,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24205 conditions, 12150 events. 8463/12150 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 70332 event pairs, 943 based on Foata normal form. 672/12812 useless extension candidates. Maximal degree in co-relation 24194. Up to 10401 conditions per place. [2024-11-10 17:53:06,558 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 53 selfloop transitions, 2 changer transitions 2/64 dead transitions. [2024-11-10 17:53:06,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 64 transitions, 254 flow [2024-11-10 17:53:06,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:53:06,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:53:06,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-11-10 17:53:06,569 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6524822695035462 [2024-11-10 17:53:06,570 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 97 flow. Second operand 3 states and 92 transitions. [2024-11-10 17:53:06,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 64 transitions, 254 flow [2024-11-10 17:53:06,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 64 transitions, 250 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 17:53:06,576 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow [2024-11-10 17:53:06,579 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-10 17:53:06,584 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2024-11-10 17:53:06,584 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow [2024-11-10 17:53:06,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-10 17:53:06,585 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:06,585 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:53:06,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 17:53:06,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:53:06,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:06,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2097447542, now seen corresponding path program 1 times [2024-11-10 17:53:06,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:53:06,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83129284] [2024-11-10 17:53:06,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:53:06,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:53:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:53:06,663 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-10 17:53:06,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:53:06,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83129284] [2024-11-10 17:53:06,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83129284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:06,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:06,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 17:53:06,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345444082] [2024-11-10 17:53:06,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:06,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:53:06,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:53:06,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:53:06,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:53:06,671 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-11-10 17:53:06,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-10 17:53:06,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:06,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-11-10 17:53:06,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:07,658 INFO L124 PetriNetUnfolderBase]: 7601/11707 cut-off events. [2024-11-10 17:53:07,658 INFO L125 PetriNetUnfolderBase]: For 520/520 co-relation queries the response was YES. [2024-11-10 17:53:07,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23083 conditions, 11707 events. 7601/11707 cut-off events. For 520/520 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 72071 event pairs, 7601 based on Foata normal form. 336/11989 useless extension candidates. Maximal degree in co-relation 23073. Up to 10738 conditions per place. [2024-11-10 17:53:07,784 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 30 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2024-11-10 17:53:07,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 150 flow [2024-11-10 17:53:07,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:53:07,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:53:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-11-10 17:53:07,787 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.425531914893617 [2024-11-10 17:53:07,787 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 3 states and 60 transitions. [2024-11-10 17:53:07,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 150 flow [2024-11-10 17:53:07,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 17:53:07,790 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 82 flow [2024-11-10 17:53:07,792 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-10 17:53:07,793 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2024-11-10 17:53:07,793 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 82 flow [2024-11-10 17:53:07,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-10 17:53:07,793 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:07,793 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:53:07,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 17:53:07,793 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:53:07,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:07,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2097447851, now seen corresponding path program 1 times [2024-11-10 17:53:07,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:53:07,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421002274] [2024-11-10 17:53:07,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:53:07,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:53:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:53:08,042 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-10 17:53:08,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:53:08,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421002274] [2024-11-10 17:53:08,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421002274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:08,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:08,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:53:08,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853531080] [2024-11-10 17:53:08,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:08,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:53:08,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:53:08,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:53:08,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:53:08,048 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-11-10 17:53:08,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-10 17:53:08,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:08,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-11-10 17:53:08,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:09,996 INFO L124 PetriNetUnfolderBase]: 15579/22881 cut-off events. [2024-11-10 17:53:09,997 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:53:10,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45275 conditions, 22881 events. 15579/22881 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 144866 event pairs, 3632 based on Foata normal form. 0/22347 useless extension candidates. Maximal degree in co-relation 45269. Up to 9687 conditions per place. [2024-11-10 17:53:10,095 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 52 selfloop transitions, 7 changer transitions 113/177 dead transitions. [2024-11-10 17:53:10,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 177 transitions, 710 flow [2024-11-10 17:53:10,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 17:53:10,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 17:53:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 255 transitions. [2024-11-10 17:53:10,097 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6028368794326241 [2024-11-10 17:53:10,097 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 82 flow. Second operand 9 states and 255 transitions. [2024-11-10 17:53:10,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 177 transitions, 710 flow [2024-11-10 17:53:10,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 177 transitions, 709 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 17:53:10,106 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 177 flow [2024-11-10 17:53:10,107 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=177, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2024-11-10 17:53:10,108 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2024-11-10 17:53:10,109 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 177 flow [2024-11-10 17:53:10,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-10 17:53:10,109 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:10,109 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:53:10,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 17:53:10,109 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:53:10,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:10,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1541448554, now seen corresponding path program 1 times [2024-11-10 17:53:10,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:53:10,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629926946] [2024-11-10 17:53:10,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:53:10,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:53:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:53:10,230 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-10 17:53:10,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:53:10,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629926946] [2024-11-10 17:53:10,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629926946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:10,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:10,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:53:10,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328702639] [2024-11-10 17:53:10,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:10,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:53:10,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:53:10,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:53:10,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:53:10,234 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-11-10 17:53:10,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-10 17:53:10,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:10,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-11-10 17:53:10,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:11,763 INFO L124 PetriNetUnfolderBase]: 11644/17606 cut-off events. [2024-11-10 17:53:11,764 INFO L125 PetriNetUnfolderBase]: For 16447/16458 co-relation queries the response was YES. [2024-11-10 17:53:11,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48318 conditions, 17606 events. 11644/17606 cut-off events. For 16447/16458 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 110770 event pairs, 3230 based on Foata normal form. 530/18132 useless extension candidates. Maximal degree in co-relation 48303. Up to 10961 conditions per place. [2024-11-10 17:53:11,868 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 52 selfloop transitions, 3 changer transitions 77/137 dead transitions. [2024-11-10 17:53:11,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 137 transitions, 853 flow [2024-11-10 17:53:11,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 17:53:11,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 17:53:11,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-11-10 17:53:11,874 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5319148936170213 [2024-11-10 17:53:11,874 INFO L175 Difference]: Start difference. First operand has 61 places, 42 transitions, 177 flow. Second operand 7 states and 175 transitions. [2024-11-10 17:53:11,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 137 transitions, 853 flow [2024-11-10 17:53:11,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 137 transitions, 745 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-11-10 17:53:11,992 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 166 flow [2024-11-10 17:53:11,992 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=166, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2024-11-10 17:53:11,993 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2024-11-10 17:53:11,993 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 166 flow [2024-11-10 17:53:11,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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-10 17:53:11,994 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:11,994 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-10 17:53:11,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 17:53:11,994 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:53:11,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:11,995 INFO L85 PathProgramCache]: Analyzing trace with hash 266466691, now seen corresponding path program 1 times [2024-11-10 17:53:11,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:53:11,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871821480] [2024-11-10 17:53:11,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:53:11,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:53:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:53:12,154 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-10 17:53:12,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:53:12,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871821480] [2024-11-10 17:53:12,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871821480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:12,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:12,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:53:12,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049594331] [2024-11-10 17:53:12,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:12,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:53:12,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:53:12,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:53:12,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:53:12,158 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-11-10 17:53:12,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-10 17:53:12,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:12,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-11-10 17:53:12,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:13,452 INFO L124 PetriNetUnfolderBase]: 9988/14940 cut-off events. [2024-11-10 17:53:13,452 INFO L125 PetriNetUnfolderBase]: For 11721/11733 co-relation queries the response was YES. [2024-11-10 17:53:13,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39390 conditions, 14940 events. 9988/14940 cut-off events. For 11721/11733 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 88021 event pairs, 4900 based on Foata normal form. 404/15340 useless extension candidates. Maximal degree in co-relation 39372. Up to 8773 conditions per place. [2024-11-10 17:53:13,690 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 55 selfloop transitions, 3 changer transitions 61/124 dead transitions. [2024-11-10 17:53:13,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 124 transitions, 686 flow [2024-11-10 17:53:13,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 17:53:13,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 17:53:13,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-11-10 17:53:13,692 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2024-11-10 17:53:13,692 INFO L175 Difference]: Start difference. First operand has 61 places, 42 transitions, 166 flow. Second operand 7 states and 168 transitions. [2024-11-10 17:53:13,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 124 transitions, 686 flow [2024-11-10 17:53:13,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 124 transitions, 656 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-10 17:53:13,759 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 167 flow [2024-11-10 17:53:13,759 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=167, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2024-11-10 17:53:13,761 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2024-11-10 17:53:13,762 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 167 flow [2024-11-10 17:53:13,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-10 17:53:13,762 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:13,762 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-10 17:53:13,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 17:53:13,762 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:53:13,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:13,763 INFO L85 PathProgramCache]: Analyzing trace with hash 650432921, now seen corresponding path program 1 times [2024-11-10 17:53:13,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:53:13,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208787553] [2024-11-10 17:53:13,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:53:13,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:53:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:53:13,893 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-10 17:53:13,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:53:13,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208787553] [2024-11-10 17:53:13,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208787553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:13,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:13,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:53:13,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487662636] [2024-11-10 17:53:13,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:13,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:53:13,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:53:13,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:53:13,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:53:13,898 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-11-10 17:53:13,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 42 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-10 17:53:13,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:13,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-11-10 17:53:13,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:14,553 INFO L124 PetriNetUnfolderBase]: 7178/10996 cut-off events. [2024-11-10 17:53:14,553 INFO L125 PetriNetUnfolderBase]: For 8311/8323 co-relation queries the response was YES. [2024-11-10 17:53:14,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28552 conditions, 10996 events. 7178/10996 cut-off events. For 8311/8323 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 64850 event pairs, 1304 based on Foata normal form. 548/11540 useless extension candidates. Maximal degree in co-relation 28535. Up to 5361 conditions per place. [2024-11-10 17:53:14,612 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 80 selfloop transitions, 5 changer transitions 1/91 dead transitions. [2024-11-10 17:53:14,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 91 transitions, 541 flow [2024-11-10 17:53:14,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:53:14,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 17:53:14,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2024-11-10 17:53:14,613 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-11-10 17:53:14,613 INFO L175 Difference]: Start difference. First operand has 60 places, 42 transitions, 167 flow. Second operand 4 states and 112 transitions. [2024-11-10 17:53:14,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 91 transitions, 541 flow [2024-11-10 17:53:14,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 91 transitions, 519 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-10 17:53:14,760 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 187 flow [2024-11-10 17:53:14,760 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2024-11-10 17:53:14,763 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2024-11-10 17:53:14,763 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 187 flow [2024-11-10 17:53:14,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-10 17:53:14,764 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:14,764 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-10 17:53:14,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 17:53:14,764 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:53:14,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:14,765 INFO L85 PathProgramCache]: Analyzing trace with hash 217575662, now seen corresponding path program 1 times [2024-11-10 17:53:14,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:53:14,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823131252] [2024-11-10 17:53:14,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:53:14,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:53:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:53:14,940 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-10 17:53:14,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:53:14,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823131252] [2024-11-10 17:53:14,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823131252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:14,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:14,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:53:14,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123590938] [2024-11-10 17:53:14,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:14,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:53:14,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:53:14,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:53:14,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:53:14,944 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-11-10 17:53:14,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 187 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-10 17:53:14,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:14,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-11-10 17:53:14,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:15,416 INFO L124 PetriNetUnfolderBase]: 4286/6622 cut-off events. [2024-11-10 17:53:15,417 INFO L125 PetriNetUnfolderBase]: For 4983/4995 co-relation queries the response was YES. [2024-11-10 17:53:15,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18604 conditions, 6622 events. 4286/6622 cut-off events. For 4983/4995 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 35509 event pairs, 772 based on Foata normal form. 374/6992 useless extension candidates. Maximal degree in co-relation 18589. Up to 2419 conditions per place. [2024-11-10 17:53:15,446 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 102 selfloop transitions, 8 changer transitions 2/117 dead transitions. [2024-11-10 17:53:15,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 117 transitions, 714 flow [2024-11-10 17:53:15,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:53:15,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 17:53:15,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2024-11-10 17:53:15,447 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6085106382978723 [2024-11-10 17:53:15,447 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 187 flow. Second operand 5 states and 143 transitions. [2024-11-10 17:53:15,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 117 transitions, 714 flow [2024-11-10 17:53:15,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 117 transitions, 704 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-10 17:53:15,452 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 227 flow [2024-11-10 17:53:15,452 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2024-11-10 17:53:15,453 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2024-11-10 17:53:15,453 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 227 flow [2024-11-10 17:53:15,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-10 17:53:15,453 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:15,453 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:53:15,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 17:53:15,454 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:53:15,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:15,454 INFO L85 PathProgramCache]: Analyzing trace with hash -685436503, now seen corresponding path program 1 times [2024-11-10 17:53:15,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:53:15,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070907069] [2024-11-10 17:53:15,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:53:15,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:53:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:53:15,643 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-10 17:53:15,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:53:15,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070907069] [2024-11-10 17:53:15,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070907069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:15,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:15,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:53:15,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452014773] [2024-11-10 17:53:15,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:15,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:53:15,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:53:15,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:53:15,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:53:15,647 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-11-10 17:53:15,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 227 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-10 17:53:15,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:15,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-11-10 17:53:15,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:16,494 INFO L124 PetriNetUnfolderBase]: 4819/7436 cut-off events. [2024-11-10 17:53:16,494 INFO L125 PetriNetUnfolderBase]: For 6847/6849 co-relation queries the response was YES. [2024-11-10 17:53:16,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21905 conditions, 7436 events. 4819/7436 cut-off events. For 6847/6849 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 40698 event pairs, 821 based on Foata normal form. 76/7510 useless extension candidates. Maximal degree in co-relation 21888. Up to 3432 conditions per place. [2024-11-10 17:53:16,529 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 95 selfloop transitions, 15 changer transitions 38/153 dead transitions. [2024-11-10 17:53:16,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 153 transitions, 968 flow [2024-11-10 17:53:16,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 17:53:16,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 17:53:16,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 212 transitions. [2024-11-10 17:53:16,531 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5011820330969267 [2024-11-10 17:53:16,531 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 227 flow. Second operand 9 states and 212 transitions. [2024-11-10 17:53:16,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 153 transitions, 968 flow [2024-11-10 17:53:16,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 153 transitions, 896 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-11-10 17:53:16,544 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 331 flow [2024-11-10 17:53:16,544 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=331, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2024-11-10 17:53:16,545 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 18 predicate places. [2024-11-10 17:53:16,545 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 331 flow [2024-11-10 17:53:16,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-10 17:53:16,545 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:16,545 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:53:16,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 17:53:16,546 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:53:16,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:16,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1296989183, now seen corresponding path program 2 times [2024-11-10 17:53:16,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:53:16,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810244970] [2024-11-10 17:53:16,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:53:16,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:53:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:53:16,765 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-10 17:53:16,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:53:16,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810244970] [2024-11-10 17:53:16,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810244970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:16,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:16,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 17:53:16,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370215941] [2024-11-10 17:53:16,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:16,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:53:16,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:53:16,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:53:16,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:53:16,770 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-11-10 17:53:16,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 331 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 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-10 17:53:16,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:16,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-11-10 17:53:16,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:18,004 INFO L124 PetriNetUnfolderBase]: 6151/9464 cut-off events. [2024-11-10 17:53:18,005 INFO L125 PetriNetUnfolderBase]: For 12251/12253 co-relation queries the response was YES. [2024-11-10 17:53:18,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29259 conditions, 9464 events. 6151/9464 cut-off events. For 12251/12253 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 54134 event pairs, 1261 based on Foata normal form. 60/9522 useless extension candidates. Maximal degree in co-relation 29236. Up to 3836 conditions per place. [2024-11-10 17:53:18,060 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 99 selfloop transitions, 13 changer transitions 52/169 dead transitions. [2024-11-10 17:53:18,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 169 transitions, 1143 flow [2024-11-10 17:53:18,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 17:53:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 17:53:18,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 211 transitions. [2024-11-10 17:53:18,062 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5611702127659575 [2024-11-10 17:53:18,062 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 331 flow. Second operand 8 states and 211 transitions. [2024-11-10 17:53:18,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 169 transitions, 1143 flow [2024-11-10 17:53:18,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 169 transitions, 1099 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-11-10 17:53:18,097 INFO L231 Difference]: Finished difference. Result has 72 places, 53 transitions, 315 flow [2024-11-10 17:53:18,097 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=315, PETRI_PLACES=72, PETRI_TRANSITIONS=53} [2024-11-10 17:53:18,098 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2024-11-10 17:53:18,098 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 53 transitions, 315 flow [2024-11-10 17:53:18,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 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-10 17:53:18,099 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:18,099 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:53:18,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 17:53:18,099 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:53:18,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:18,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1638956031, now seen corresponding path program 3 times [2024-11-10 17:53:18,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:53:18,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171522337] [2024-11-10 17:53:18,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:53:18,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:53:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:53:18,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:53:18,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:53:18,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171522337] [2024-11-10 17:53:18,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171522337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:18,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:18,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 17:53:18,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84229551] [2024-11-10 17:53:18,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:18,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:53:18,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:53:18,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:53:18,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:53:18,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-11-10 17:53:18,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 53 transitions, 315 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-10 17:53:18,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:18,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-11-10 17:53:18,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:18,972 INFO L124 PetriNetUnfolderBase]: 3359/5245 cut-off events. [2024-11-10 17:53:18,972 INFO L125 PetriNetUnfolderBase]: For 9519/9530 co-relation queries the response was YES. [2024-11-10 17:53:18,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16517 conditions, 5245 events. 3359/5245 cut-off events. For 9519/9530 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 28306 event pairs, 727 based on Foata normal form. 180/5421 useless extension candidates. Maximal degree in co-relation 16493. Up to 2010 conditions per place. [2024-11-10 17:53:18,997 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 75 selfloop transitions, 11 changer transitions 20/111 dead transitions. [2024-11-10 17:53:19,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 111 transitions, 879 flow [2024-11-10 17:53:19,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:53:19,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 17:53:19,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-11-10 17:53:19,006 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5035460992907801 [2024-11-10 17:53:19,006 INFO L175 Difference]: Start difference. First operand has 72 places, 53 transitions, 315 flow. Second operand 6 states and 142 transitions. [2024-11-10 17:53:19,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 111 transitions, 879 flow [2024-11-10 17:53:19,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 111 transitions, 768 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-11-10 17:53:19,029 INFO L231 Difference]: Finished difference. Result has 67 places, 49 transitions, 261 flow [2024-11-10 17:53:19,032 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=261, PETRI_PLACES=67, PETRI_TRANSITIONS=49} [2024-11-10 17:53:19,033 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2024-11-10 17:53:19,033 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 49 transitions, 261 flow [2024-11-10 17:53:19,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-10 17:53:19,034 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:19,034 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:53:19,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 17:53:19,034 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:53:19,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:19,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2088354367, now seen corresponding path program 1 times [2024-11-10 17:53:19,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:53:19,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105585275] [2024-11-10 17:53:19,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:53:19,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:53:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:53:19,305 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-10 17:53:19,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:53:19,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105585275] [2024-11-10 17:53:19,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105585275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:19,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:19,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:53:19,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350693715] [2024-11-10 17:53:19,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:19,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:53:19,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:53:19,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:53:19,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:53:19,315 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-11-10 17:53:19,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 49 transitions, 261 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 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-10 17:53:19,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:19,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-11-10 17:53:19,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:19,888 INFO L124 PetriNetUnfolderBase]: 2953/4699 cut-off events. [2024-11-10 17:53:19,888 INFO L125 PetriNetUnfolderBase]: For 7036/7038 co-relation queries the response was YES. [2024-11-10 17:53:19,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14621 conditions, 4699 events. 2953/4699 cut-off events. For 7036/7038 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 25358 event pairs, 949 based on Foata normal form. 8/4706 useless extension candidates. Maximal degree in co-relation 14601. Up to 2762 conditions per place. [2024-11-10 17:53:19,906 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 41 selfloop transitions, 3 changer transitions 45/94 dead transitions. [2024-11-10 17:53:19,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 94 transitions, 657 flow [2024-11-10 17:53:19,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:53:19,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 17:53:19,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-11-10 17:53:19,908 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44680851063829785 [2024-11-10 17:53:19,908 INFO L175 Difference]: Start difference. First operand has 67 places, 49 transitions, 261 flow. Second operand 6 states and 126 transitions. [2024-11-10 17:53:19,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 94 transitions, 657 flow [2024-11-10 17:53:19,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 94 transitions, 498 flow, removed 42 selfloop flow, removed 11 redundant places. [2024-11-10 17:53:19,936 INFO L231 Difference]: Finished difference. Result has 63 places, 42 transitions, 150 flow [2024-11-10 17:53:19,937 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=150, PETRI_PLACES=63, PETRI_TRANSITIONS=42} [2024-11-10 17:53:19,937 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2024-11-10 17:53:19,937 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 42 transitions, 150 flow [2024-11-10 17:53:19,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 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-10 17:53:19,938 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:19,938 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:53:19,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 17:53:19,938 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:53:19,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:19,939 INFO L85 PathProgramCache]: Analyzing trace with hash -687102721, now seen corresponding path program 2 times [2024-11-10 17:53:19,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:53:19,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383466743] [2024-11-10 17:53:19,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:53:19,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:53:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:53:20,819 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-10 17:53:20,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:53:20,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383466743] [2024-11-10 17:53:20,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383466743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:20,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:20,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 17:53:20,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707128205] [2024-11-10 17:53:20,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:20,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 17:53:20,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:53:20,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 17:53:20,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 17:53:20,824 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-11-10 17:53:20,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 42 transitions, 150 flow. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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-10 17:53:20,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:20,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-11-10 17:53:20,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:21,239 INFO L124 PetriNetUnfolderBase]: 1079/1741 cut-off events. [2024-11-10 17:53:21,240 INFO L125 PetriNetUnfolderBase]: For 504/504 co-relation queries the response was YES. [2024-11-10 17:53:21,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4157 conditions, 1741 events. 1079/1741 cut-off events. For 504/504 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7577 event pairs, 140 based on Foata normal form. 8/1749 useless extension candidates. Maximal degree in co-relation 4141. Up to 913 conditions per place. [2024-11-10 17:53:21,245 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 48 selfloop transitions, 4 changer transitions 39/96 dead transitions. [2024-11-10 17:53:21,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 96 transitions, 499 flow [2024-11-10 17:53:21,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 17:53:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 17:53:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-11-10 17:53:21,247 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.375886524822695 [2024-11-10 17:53:21,247 INFO L175 Difference]: Start difference. First operand has 63 places, 42 transitions, 150 flow. Second operand 9 states and 159 transitions. [2024-11-10 17:53:21,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 96 transitions, 499 flow [2024-11-10 17:53:21,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 96 transitions, 469 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-11-10 17:53:21,249 INFO L231 Difference]: Finished difference. Result has 65 places, 42 transitions, 148 flow [2024-11-10 17:53:21,249 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=148, PETRI_PLACES=65, PETRI_TRANSITIONS=42} [2024-11-10 17:53:21,250 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 13 predicate places. [2024-11-10 17:53:21,250 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 42 transitions, 148 flow [2024-11-10 17:53:21,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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-10 17:53:21,250 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:21,250 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:53:21,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 17:53:21,251 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:53:21,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:21,251 INFO L85 PathProgramCache]: Analyzing trace with hash 880622085, now seen corresponding path program 3 times [2024-11-10 17:53:21,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:53:21,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692535366] [2024-11-10 17:53:21,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:53:21,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:53:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 17:53:21,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 17:53:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 17:53:21,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 17:53:21,399 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 17:53:21,400 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-10 17:53:21,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-10 17:53:21,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-10 17:53:21,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-10 17:53:21,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-10 17:53:21,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-10 17:53:21,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-10 17:53:21,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 17:53:21,403 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:53:21,473 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 17:53:21,473 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 17:53:21,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:53:21 BasicIcfg [2024-11-10 17:53:21,478 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 17:53:21,479 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 17:53:21,479 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 17:53:21,479 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 17:53:21,479 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:53:04" (3/4) ... [2024-11-10 17:53:21,481 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 17:53:21,482 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 17:53:21,482 INFO L158 Benchmark]: Toolchain (without parser) took 18114.75ms. Allocated memory was 138.4MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 65.6MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2024-11-10 17:53:21,482 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 138.4MB. Free memory is still 101.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:53:21,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.90ms. Allocated memory was 138.4MB in the beginning and 201.3MB in the end (delta: 62.9MB). Free memory was 65.4MB in the beginning and 153.9MB in the end (delta: -88.5MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-11-10 17:53:21,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.58ms. Allocated memory is still 201.3MB. Free memory was 153.9MB in the beginning and 151.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 17:53:21,483 INFO L158 Benchmark]: Boogie Preprocessor took 60.19ms. Allocated memory is still 201.3MB. Free memory was 151.8MB in the beginning and 148.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 17:53:21,483 INFO L158 Benchmark]: IcfgBuilder took 665.46ms. Allocated memory is still 201.3MB. Free memory was 148.6MB in the beginning and 165.0MB in the end (delta: -16.4MB). Peak memory consumption was 60.1MB. Max. memory is 16.1GB. [2024-11-10 17:53:21,484 INFO L158 Benchmark]: TraceAbstraction took 16858.18ms. Allocated memory was 201.3MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 163.9MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2024-11-10 17:53:21,484 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 5.3GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:53:21,485 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 138.4MB. Free memory is still 101.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 466.90ms. Allocated memory was 138.4MB in the beginning and 201.3MB in the end (delta: 62.9MB). Free memory was 65.4MB in the beginning and 153.9MB in the end (delta: -88.5MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.58ms. Allocated memory is still 201.3MB. Free memory was 153.9MB in the beginning and 151.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.19ms. Allocated memory is still 201.3MB. Free memory was 151.8MB in the beginning and 148.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 665.46ms. Allocated memory is still 201.3MB. Free memory was 148.6MB in the beginning and 165.0MB in the end (delta: -16.4MB). Peak memory consumption was 60.1MB. Max. memory is 16.1GB. * TraceAbstraction took 16858.18ms. Allocated memory was 201.3MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 163.9MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 5.3GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff1_thd0; [L734] 0 _Bool y$r_buff1_thd1; [L735] 0 _Bool y$r_buff1_thd2; [L736] 0 _Bool y$r_buff1_thd3; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t636; [L845] FCALL, FORK 0 pthread_create(&t636, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t636=-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] [L846] 0 pthread_t t637; [L847] FCALL, FORK 0 pthread_create(&t637, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t636=-2, t637=-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] [L848] 0 pthread_t t638; [L849] FCALL, FORK 0 pthread_create(&t638, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t636=-2, t637=-1, t638=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] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 1 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L796] 2 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L813] 3 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L816] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L819] 3 __unbuffered_p2_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L822] 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) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 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}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L756] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] 1 y$mem_tmp = y [L763] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L764] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L765] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L767] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L769] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 __unbuffered_p0_EBX = y [L771] 1 y = y$flush_delayed ? y$mem_tmp : y [L772] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L799] 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) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 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 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636=-2, t637=-1, t638=0, weak$$choice0=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 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) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 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 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636=-2, t637=-1, t638=0, weak$$choice0=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L862] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636=-2, t637=-1, t638=0, weak$$choice0=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L18] 0 __assert_fail ("0", "mix024_power.opt_pso.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that 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: 845]: 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: 849]: 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, 74 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: 16.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 852 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 845 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2406 IncrementalHoareTripleChecker+Invalid, 2446 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 2 mSDtfsCounter, 2406 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=331occurred in iteration=8, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 1566 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 17:53:21,508 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/mix024_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 1b7eb90186eb2f5804d582daa800e24f20cc36e3f07dd8983b72b6a43dcf9225 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:53:23,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:53:23,945 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 17:53:23,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:53:23,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:53:23,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:53:23,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:53:23,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:53:23,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:53:23,981 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:53:23,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:53:23,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:53:23,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:53:23,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:53:23,982 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:53:23,982 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:53:23,982 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:53:23,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:53:23,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:53:23,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:53:23,984 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:53:23,984 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:53:23,984 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:53:23,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:53:23,985 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:53:23,985 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 17:53:23,985 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:53:23,986 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 17:53:23,986 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:53:23,986 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:53:23,986 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:53:23,986 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:53:23,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:53:23,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:53:23,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:53:23,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:53:23,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:53:23,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:53:23,989 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 17:53:23,989 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 17:53:23,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:53:23,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:53:23,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:53:23,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:53:23,989 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 -> 1b7eb90186eb2f5804d582daa800e24f20cc36e3f07dd8983b72b6a43dcf9225 [2024-11-10 17:53:24,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:53:24,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:53:24,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:53:24,283 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:53:24,283 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:53:24,285 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2024-11-10 17:53:25,695 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:53:25,876 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:53:25,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2024-11-10 17:53:25,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39bb4aea7/c17f8135852c41b7beb16f3d557b0af3/FLAGf2daeec66 [2024-11-10 17:53:25,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39bb4aea7/c17f8135852c41b7beb16f3d557b0af3 [2024-11-10 17:53:25,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:53:25,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:53:25,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:53:25,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:53:25,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:53:25,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:53:25" (1/1) ... [2024-11-10 17:53:25,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eaa5359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:25, skipping insertion in model container [2024-11-10 17:53:25,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:53:25" (1/1) ... [2024-11-10 17:53:25,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:53:26,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:53:26,320 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:53:26,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:53:26,420 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:53:26,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26 WrapperNode [2024-11-10 17:53:26,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:53:26,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:53:26,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:53:26,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:53:26,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 17:53:26,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 17:53:26,477 INFO L138 Inliner]: procedures = 176, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 123 [2024-11-10 17:53:26,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:53:26,481 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:53:26,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:53:26,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:53:26,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 17:53:26,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 17:53:26,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 17:53:26,520 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-10 17:53:26,521 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 17:53:26,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 17:53:26,529 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 17:53:26,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 17:53:26,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 17:53:26,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 17:53:26,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:53:26,544 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:53:26,546 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:53:26,546 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:53:26,547 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (1/1) ... [2024-11-10 17:53:26,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:53:26,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:53:26,587 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-10 17:53:26,598 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-10 17:53:26,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 17:53:26,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:53:26,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 17:53:26,635 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-10 17:53:26,635 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-10 17:53:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-10 17:53:26,636 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-10 17:53:26,636 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-10 17:53:26,645 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-10 17:53:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 17:53:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:53:26,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:53:26,648 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 17:53:26,773 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:53:26,774 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:53:27,065 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 17:53:27,065 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:53:27,249 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:53:27,249 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 17:53:27,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:53:27 BoogieIcfgContainer [2024-11-10 17:53:27,250 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:53:27,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:53:27,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:53:27,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:53:27,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:53:25" (1/3) ... [2024-11-10 17:53:27,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a39f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:53:27, skipping insertion in model container [2024-11-10 17:53:27,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:53:26" (2/3) ... [2024-11-10 17:53:27,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a39f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:53:27, skipping insertion in model container [2024-11-10 17:53:27,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:53:27" (3/3) ... [2024-11-10 17:53:27,258 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.opt_pso.opt_rmo.opt.i [2024-11-10 17:53:27,282 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:53:27,282 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-10 17:53:27,283 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 17:53:27,337 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 17:53:27,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 106 flow [2024-11-10 17:53:27,380 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2024-11-10 17:53:27,380 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:53:27,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 2/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2024-11-10 17:53:27,384 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 47 transitions, 106 flow [2024-11-10 17:53:27,386 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 44 transitions, 97 flow [2024-11-10 17:53:27,392 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:53:27,397 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;@4e552610, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:53:27,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 17:53:27,400 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 17:53:27,401 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-10 17:53:27,401 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:53:27,401 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:27,401 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:53:27,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:53:27,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:27,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1391754169, now seen corresponding path program 1 times [2024-11-10 17:53:27,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:53:27,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113833018] [2024-11-10 17:53:27,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:53:27,432 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-10 17:53:27,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:53:27,438 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-10 17:53:27,444 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-10 17:53:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:53:27,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 17:53:27,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:53:27,597 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-10 17:53:27,597 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:53:27,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:53:27,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113833018] [2024-11-10 17:53:27,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113833018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:27,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:27,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 17:53:27,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241177034] [2024-11-10 17:53:27,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:27,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:53:27,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:53:27,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:53:27,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:53:27,633 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-11-10 17:53:27,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-10 17:53:27,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:27,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-11-10 17:53:27,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:28,791 INFO L124 PetriNetUnfolderBase]: 8463/12150 cut-off events. [2024-11-10 17:53:28,791 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-11-10 17:53:28,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24205 conditions, 12150 events. 8463/12150 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 70232 event pairs, 943 based on Foata normal form. 672/12812 useless extension candidates. Maximal degree in co-relation 24194. Up to 10401 conditions per place. [2024-11-10 17:53:28,857 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 53 selfloop transitions, 2 changer transitions 2/64 dead transitions. [2024-11-10 17:53:28,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 64 transitions, 254 flow [2024-11-10 17:53:28,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:53:28,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:53:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-11-10 17:53:28,867 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6524822695035462 [2024-11-10 17:53:28,868 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 97 flow. Second operand 3 states and 92 transitions. [2024-11-10 17:53:28,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 64 transitions, 254 flow [2024-11-10 17:53:28,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 64 transitions, 250 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 17:53:28,873 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow [2024-11-10 17:53:28,876 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-10 17:53:28,880 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2024-11-10 17:53:28,880 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow [2024-11-10 17:53:28,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-10 17:53:28,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:28,880 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:53:28,886 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-10 17:53:29,083 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-10 17:53:29,084 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:53:29,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:29,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1490749624, now seen corresponding path program 1 times [2024-11-10 17:53:29,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:53:29,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115132708] [2024-11-10 17:53:29,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:53:29,087 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-10 17:53:29,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:53:29,089 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-10 17:53:29,111 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-10 17:53:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:53:29,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:53:29,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:53:29,200 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-10 17:53:29,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:53:29,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:53:29,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115132708] [2024-11-10 17:53:29,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115132708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:29,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:29,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:53:29,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314563604] [2024-11-10 17:53:29,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:29,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:53:29,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:53:29,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:53:29,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:53:29,203 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-11-10 17:53:29,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-10 17:53:29,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:29,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-11-10 17:53:29,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:29,906 INFO L124 PetriNetUnfolderBase]: 5727/9233 cut-off events. [2024-11-10 17:53:29,907 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2024-11-10 17:53:29,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18077 conditions, 9233 events. 5727/9233 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 58386 event pairs, 955 based on Foata normal form. 336/9563 useless extension candidates. Maximal degree in co-relation 18067. Up to 5027 conditions per place. [2024-11-10 17:53:29,947 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 65 selfloop transitions, 5 changer transitions 1/78 dead transitions. [2024-11-10 17:53:29,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 78 transitions, 316 flow [2024-11-10 17:53:29,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:53:29,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 17:53:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2024-11-10 17:53:29,949 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.601063829787234 [2024-11-10 17:53:29,949 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 4 states and 113 transitions. [2024-11-10 17:53:29,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 78 transitions, 316 flow [2024-11-10 17:53:29,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 78 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 17:53:29,952 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 118 flow [2024-11-10 17:53:29,952 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-11-10 17:53:29,953 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2024-11-10 17:53:29,953 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 118 flow [2024-11-10 17:53:29,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-10 17:53:29,953 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:29,953 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-10 17:53:29,959 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-10 17:53:30,154 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-10 17:53:30,154 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:53:30,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:30,155 INFO L85 PathProgramCache]: Analyzing trace with hash -854311808, now seen corresponding path program 1 times [2024-11-10 17:53:30,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:53:30,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228829739] [2024-11-10 17:53:30,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:53:30,156 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-10 17:53:30,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:53:30,160 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-10 17:53:30,167 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-10 17:53:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:53:30,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:53:30,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:53:30,262 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-10 17:53:30,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:53:30,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:53:30,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228829739] [2024-11-10 17:53:30,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228829739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:30,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:30,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:53:30,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337209478] [2024-11-10 17:53:30,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:30,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:53:30,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:53:30,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:53:30,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:53:30,265 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-11-10 17:53:30,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:53:30,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:30,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-11-10 17:53:30,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:30,762 INFO L124 PetriNetUnfolderBase]: 2925/4683 cut-off events. [2024-11-10 17:53:30,762 INFO L125 PetriNetUnfolderBase]: For 866/866 co-relation queries the response was YES. [2024-11-10 17:53:30,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10421 conditions, 4683 events. 2925/4683 cut-off events. For 866/866 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 24933 event pairs, 625 based on Foata normal form. 216/4893 useless extension candidates. Maximal degree in co-relation 10409. Up to 1494 conditions per place. [2024-11-10 17:53:30,777 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 83 selfloop transitions, 8 changer transitions 1/99 dead transitions. [2024-11-10 17:53:30,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 99 transitions, 437 flow [2024-11-10 17:53:30,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:53:30,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 17:53:30,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2024-11-10 17:53:30,779 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6127659574468085 [2024-11-10 17:53:30,779 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 118 flow. Second operand 5 states and 144 transitions. [2024-11-10 17:53:30,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 99 transitions, 437 flow [2024-11-10 17:53:30,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 99 transitions, 427 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-10 17:53:30,783 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 158 flow [2024-11-10 17:53:30,783 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2024-11-10 17:53:30,784 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2024-11-10 17:53:30,784 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 158 flow [2024-11-10 17:53:30,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:53:30,784 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:30,784 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-10 17:53:30,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 17:53:30,987 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-10 17:53:30,988 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:53:30,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:30,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1022674163, now seen corresponding path program 1 times [2024-11-10 17:53:30,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:53:30,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864685123] [2024-11-10 17:53:30,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:53:30,989 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-10 17:53:30,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:53:30,995 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-10 17:53:31,001 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-10 17:53:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:53:31,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 17:53:31,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:53:31,109 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-10 17:53:31,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:53:31,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:53:31,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864685123] [2024-11-10 17:53:31,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864685123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:31,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:31,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 17:53:31,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727749092] [2024-11-10 17:53:31,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:31,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:53:31,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:53:31,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:53:31,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:53:31,112 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-11-10 17:53:31,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 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-10 17:53:31,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:31,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-11-10 17:53:31,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:31,446 INFO L124 PetriNetUnfolderBase]: 1775/2725 cut-off events. [2024-11-10 17:53:31,446 INFO L125 PetriNetUnfolderBase]: For 1468/1468 co-relation queries the response was YES. [2024-11-10 17:53:31,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6657 conditions, 2725 events. 1775/2725 cut-off events. For 1468/1468 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 12502 event pairs, 569 based on Foata normal form. 68/2787 useless extension candidates. Maximal degree in co-relation 6643. Up to 1036 conditions per place. [2024-11-10 17:53:31,458 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 69 selfloop transitions, 11 changer transitions 1/88 dead transitions. [2024-11-10 17:53:31,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 88 transitions, 416 flow [2024-11-10 17:53:31,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:53:31,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 17:53:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-11-10 17:53:31,460 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5070921985815603 [2024-11-10 17:53:31,461 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 158 flow. Second operand 6 states and 143 transitions. [2024-11-10 17:53:31,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 88 transitions, 416 flow [2024-11-10 17:53:31,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 88 transitions, 391 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-10 17:53:31,472 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 172 flow [2024-11-10 17:53:31,472 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2024-11-10 17:53:31,473 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2024-11-10 17:53:31,473 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 172 flow [2024-11-10 17:53:31,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 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-10 17:53:31,473 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:31,473 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:53:31,477 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-10 17:53:31,674 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-10 17:53:31,675 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:53:31,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:31,675 INFO L85 PathProgramCache]: Analyzing trace with hash 280265314, now seen corresponding path program 1 times [2024-11-10 17:53:31,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:53:31,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250608453] [2024-11-10 17:53:31,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:53:31,676 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-10 17:53:31,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:53:31,679 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-10 17:53:31,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 17:53:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:53:31,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:53:31,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:53:31,805 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-10 17:53:31,805 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:53:31,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:53:31,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250608453] [2024-11-10 17:53:31,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250608453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:31,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:31,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 17:53:31,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076766599] [2024-11-10 17:53:31,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:31,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:53:31,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:53:31,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:53:31,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:53:31,807 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-11-10 17:53:31,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-10 17:53:31,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:31,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-11-10 17:53:31,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:32,054 INFO L124 PetriNetUnfolderBase]: 1651/2525 cut-off events. [2024-11-10 17:53:32,055 INFO L125 PetriNetUnfolderBase]: For 1382/1382 co-relation queries the response was YES. [2024-11-10 17:53:32,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6178 conditions, 2525 events. 1651/2525 cut-off events. For 1382/1382 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 11287 event pairs, 1571 based on Foata normal form. 8/2527 useless extension candidates. Maximal degree in co-relation 6163. Up to 2492 conditions per place. [2024-11-10 17:53:32,065 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 36 selfloop transitions, 1 changer transitions 1/44 dead transitions. [2024-11-10 17:53:32,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 44 transitions, 246 flow [2024-11-10 17:53:32,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:53:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:53:32,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-11-10 17:53:32,067 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.425531914893617 [2024-11-10 17:53:32,067 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 172 flow. Second operand 3 states and 60 transitions. [2024-11-10 17:53:32,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 44 transitions, 246 flow [2024-11-10 17:53:32,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 44 transitions, 190 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-10 17:53:32,073 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 114 flow [2024-11-10 17:53:32,074 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2024-11-10 17:53:32,075 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2024-11-10 17:53:32,076 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 114 flow [2024-11-10 17:53:32,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-10 17:53:32,076 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:32,076 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:53:32,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 17:53:32,277 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-10 17:53:32,277 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:53:32,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:32,278 INFO L85 PathProgramCache]: Analyzing trace with hash 275046849, now seen corresponding path program 1 times [2024-11-10 17:53:32,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:53:32,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524015166] [2024-11-10 17:53:32,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:53:32,279 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-10 17:53:32,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:53:32,280 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-10 17:53:32,281 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-10 17:53:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:53:32,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 17:53:32,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:53:32,378 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-10 17:53:32,379 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:53:32,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:53:32,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524015166] [2024-11-10 17:53:32,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524015166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:32,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:32,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 17:53:32,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083349740] [2024-11-10 17:53:32,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:32,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:53:32,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:53:32,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:53:32,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:53:32,383 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-11-10 17:53:32,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-10 17:53:32,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:32,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-11-10 17:53:32,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:32,748 INFO L124 PetriNetUnfolderBase]: 2451/3749 cut-off events. [2024-11-10 17:53:32,748 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2024-11-10 17:53:32,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8106 conditions, 3749 events. 2451/3749 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 18624 event pairs, 1083 based on Foata normal form. 8/3754 useless extension candidates. Maximal degree in co-relation 8099. Up to 2041 conditions per place. [2024-11-10 17:53:32,810 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 50 selfloop transitions, 2 changer transitions 21/79 dead transitions. [2024-11-10 17:53:32,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 79 transitions, 353 flow [2024-11-10 17:53:32,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:53:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 17:53:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2024-11-10 17:53:32,812 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4765957446808511 [2024-11-10 17:53:32,812 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 114 flow. Second operand 5 states and 112 transitions. [2024-11-10 17:53:32,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 79 transitions, 353 flow [2024-11-10 17:53:32,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 79 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 17:53:32,813 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 125 flow [2024-11-10 17:53:32,813 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2024-11-10 17:53:32,814 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2024-11-10 17:53:32,814 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 125 flow [2024-11-10 17:53:32,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-10 17:53:32,814 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:32,815 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:53:32,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-10 17:53:33,015 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-10 17:53:33,016 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:53:33,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:33,016 INFO L85 PathProgramCache]: Analyzing trace with hash -394378027, now seen corresponding path program 2 times [2024-11-10 17:53:33,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:53:33,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675318523] [2024-11-10 17:53:33,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 17:53:33,017 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-10 17:53:33,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:53:33,019 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-10 17:53:33,036 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-10 17:53:33,107 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 17:53:33,107 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:53:33,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:53:33,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:53:33,178 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-10 17:53:33,178 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:53:33,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:53:33,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675318523] [2024-11-10 17:53:33,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [675318523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:33,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:33,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:53:33,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450147295] [2024-11-10 17:53:33,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:33,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:53:33,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:53:33,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:53:33,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:53:33,184 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-11-10 17:53:33,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-10 17:53:33,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:33,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-11-10 17:53:33,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:33,494 INFO L124 PetriNetUnfolderBase]: 1659/2600 cut-off events. [2024-11-10 17:53:33,494 INFO L125 PetriNetUnfolderBase]: For 386/387 co-relation queries the response was YES. [2024-11-10 17:53:33,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5896 conditions, 2600 events. 1659/2600 cut-off events. For 386/387 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 11931 event pairs, 147 based on Foata normal form. 8/2607 useless extension candidates. Maximal degree in co-relation 5886. Up to 1618 conditions per place. [2024-11-10 17:53:33,502 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 45 selfloop transitions, 1 changer transitions 39/91 dead transitions. [2024-11-10 17:53:33,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 91 transitions, 432 flow [2024-11-10 17:53:33,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:53:33,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 17:53:33,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2024-11-10 17:53:33,504 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46808510638297873 [2024-11-10 17:53:33,504 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 125 flow. Second operand 6 states and 132 transitions. [2024-11-10 17:53:33,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 91 transitions, 432 flow [2024-11-10 17:53:33,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 91 transitions, 414 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-10 17:53:33,506 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 126 flow [2024-11-10 17:53:33,506 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=126, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2024-11-10 17:53:33,506 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2024-11-10 17:53:33,506 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 126 flow [2024-11-10 17:53:33,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-10 17:53:33,506 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:33,507 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:53:33,518 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-10 17:53:33,707 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-10 17:53:33,708 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:53:33,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:33,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1514748911, now seen corresponding path program 3 times [2024-11-10 17:53:33,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:53:33,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563389990] [2024-11-10 17:53:33,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 17:53:33,709 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-10 17:53:33,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:53:33,715 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-10 17:53:33,716 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-10 17:53:33,782 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-10 17:53:33,783 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:53:33,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 17:53:33,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:53:34,149 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-10 17:53:34,149 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:53:34,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:53:34,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563389990] [2024-11-10 17:53:34,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [563389990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:53:34,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:53:34,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 17:53:34,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580332567] [2024-11-10 17:53:34,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:53:34,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 17:53:34,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:53:34,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 17:53:34,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 17:53:34,157 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-11-10 17:53:34,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 126 flow. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 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-10 17:53:34,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:53:34,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-11-10 17:53:34,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:53:34,660 INFO L124 PetriNetUnfolderBase]: 1495/2406 cut-off events. [2024-11-10 17:53:34,660 INFO L125 PetriNetUnfolderBase]: For 454/454 co-relation queries the response was YES. [2024-11-10 17:53:34,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5477 conditions, 2406 events. 1495/2406 cut-off events. For 454/454 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 11207 event pairs, 201 based on Foata normal form. 8/2413 useless extension candidates. Maximal degree in co-relation 5466. Up to 1174 conditions per place. [2024-11-10 17:53:34,666 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 48 selfloop transitions, 4 changer transitions 48/106 dead transitions. [2024-11-10 17:53:34,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 106 transitions, 501 flow [2024-11-10 17:53:34,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 17:53:34,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 17:53:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-11-10 17:53:34,668 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41843971631205673 [2024-11-10 17:53:34,668 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 126 flow. Second operand 9 states and 177 transitions. [2024-11-10 17:53:34,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 106 transitions, 501 flow [2024-11-10 17:53:34,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 106 transitions, 488 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-10 17:53:34,670 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 137 flow [2024-11-10 17:53:34,670 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=137, PETRI_PLACES=64, PETRI_TRANSITIONS=43} [2024-11-10 17:53:34,673 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2024-11-10 17:53:34,673 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 137 flow [2024-11-10 17:53:34,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 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-10 17:53:34,673 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:53:34,674 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:53:34,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-10 17:53:34,874 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-10 17:53:34,875 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:53:34,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:53:34,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1536615105, now seen corresponding path program 4 times [2024-11-10 17:53:34,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:53:34,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721038394] [2024-11-10 17:53:34,879 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 17:53:34,879 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-10 17:53:34,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:53:34,881 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-10 17:53:34,886 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-10 17:53:34,963 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 17:53:34,963 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-10 17:53:34,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 17:53:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 17:53:35,086 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 17:53:35,087 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 17:53:35,088 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-10 17:53:35,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-10 17:53:35,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-10 17:53:35,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-10 17:53:35,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-10 17:53:35,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-10 17:53:35,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-10 17:53:35,098 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 (10)] Forceful destruction successful, exit code 0 [2024-11-10 17:53:35,294 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-10 17:53:35,294 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-10 17:53:35,368 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 17:53:35,368 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 17:53:35,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:53:35 BasicIcfg [2024-11-10 17:53:35,376 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 17:53:35,377 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 17:53:35,377 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 17:53:35,377 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 17:53:35,377 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:53:27" (3/4) ... [2024-11-10 17:53:35,379 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 17:53:35,380 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 17:53:35,382 INFO L158 Benchmark]: Toolchain (without parser) took 9475.33ms. Allocated memory was 86.0MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 47.0MB in the beginning and 852.7MB in the end (delta: -805.7MB). Peak memory consumption was 231.2MB. Max. memory is 16.1GB. [2024-11-10 17:53:35,383 INFO L158 Benchmark]: CDTParser took 0.83ms. Allocated memory is still 86.0MB. Free memory is still 67.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:53:35,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.24ms. Allocated memory is still 86.0MB. Free memory was 46.9MB in the beginning and 45.6MB in the end (delta: 1.2MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2024-11-10 17:53:35,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.80ms. Allocated memory is still 86.0MB. Free memory was 45.6MB in the beginning and 43.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 17:53:35,383 INFO L158 Benchmark]: Boogie Preprocessor took 62.74ms. Allocated memory is still 86.0MB. Free memory was 43.2MB in the beginning and 40.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 17:53:35,384 INFO L158 Benchmark]: IcfgBuilder took 705.53ms. Allocated memory was 86.0MB in the beginning and 130.0MB in the end (delta: 44.0MB). Free memory was 39.7MB in the beginning and 77.4MB in the end (delta: -37.7MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2024-11-10 17:53:35,384 INFO L158 Benchmark]: TraceAbstraction took 8124.60ms. Allocated memory was 130.0MB in the beginning and 1.1GB in the end (delta: 989.9MB). Free memory was 77.4MB in the beginning and 852.7MB in the end (delta: -775.3MB). Peak memory consumption was 214.3MB. Max. memory is 16.1GB. [2024-11-10 17:53:35,384 INFO L158 Benchmark]: Witness Printer took 5.28ms. Allocated memory is still 1.1GB. Free memory is still 852.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:53:35,385 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.83ms. Allocated memory is still 86.0MB. Free memory is still 67.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 512.24ms. Allocated memory is still 86.0MB. Free memory was 46.9MB in the beginning and 45.6MB in the end (delta: 1.2MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.80ms. Allocated memory is still 86.0MB. Free memory was 45.6MB in the beginning and 43.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.74ms. Allocated memory is still 86.0MB. Free memory was 43.2MB in the beginning and 40.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 705.53ms. Allocated memory was 86.0MB in the beginning and 130.0MB in the end (delta: 44.0MB). Free memory was 39.7MB in the beginning and 77.4MB in the end (delta: -37.7MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8124.60ms. Allocated memory was 130.0MB in the beginning and 1.1GB in the end (delta: 989.9MB). Free memory was 77.4MB in the beginning and 852.7MB in the end (delta: -775.3MB). Peak memory consumption was 214.3MB. Max. memory is 16.1GB. * Witness Printer took 5.28ms. Allocated memory is still 1.1GB. Free memory is still 852.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff1_thd0; [L734] 0 _Bool y$r_buff1_thd1; [L735] 0 _Bool y$r_buff1_thd2; [L736] 0 _Bool y$r_buff1_thd3; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t636; [L845] FCALL, FORK 0 pthread_create(&t636, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t636=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] [L846] 0 pthread_t t637; [L847] FCALL, FORK 0 pthread_create(&t637, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t636=0, t637=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] [L848] 0 pthread_t t638; [L849] FCALL, FORK 0 pthread_create(&t638, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t636=0, t637=1, t638=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] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 1 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L796] 2 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L813] 3 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L816] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L819] 3 __unbuffered_p2_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L756] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] 1 y$mem_tmp = y [L763] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L764] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L765] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L767] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L769] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 __unbuffered_p0_EBX = y [L771] 1 y = y$flush_delayed ? y$mem_tmp : y [L772] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L822] 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) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 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}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L799] 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) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 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 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636=0, t637=1, t638=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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 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) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 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 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636=0, t637=1, t638=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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L862] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636=0, t637=1, t638=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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L18] 0 __assert_fail ("0", "mix024_power.opt_pso.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 847]: 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: 845]: 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, 74 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: 7.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 421 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 415 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1477 IncrementalHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 2 mSDtfsCounter, 1477 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=4, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 746 SizeOfPredicates, 13 NumberOfNonLiveVariables, 891 ConjunctsInSsa, 44 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-10 17:53:35,409 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